WorldWideScience

Sample records for vessel tracking algorithm

  1. Large scale tracking algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Hansen, Ross L. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Love, Joshua Alan [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Melgaard, David Kennett [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Karelitz, David B. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Pitts, Todd Alan [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Zollweg, Joshua David [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Anderson, Dylan Z. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Nandy, Prabal [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Whitlow, Gary L. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Bender, Daniel A. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Byrne, Raymond Harry [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

    2015-01-01

    Low signal-to-noise data processing algorithms for improved detection, tracking, discrimination and situational threat assessment are a key research challenge. As sensor technologies progress, the number of pixels will increase signi cantly. This will result in increased resolution, which could improve object discrimination, but unfortunately, will also result in a significant increase in the number of potential targets to track. Many tracking techniques, like multi-hypothesis trackers, suffer from a combinatorial explosion as the number of potential targets increase. As the resolution increases, the phenomenology applied towards detection algorithms also changes. For low resolution sensors, "blob" tracking is the norm. For higher resolution data, additional information may be employed in the detection and classfication steps. The most challenging scenarios are those where the targets cannot be fully resolved, yet must be tracked and distinguished for neighboring closely spaced objects. Tracking vehicles in an urban environment is an example of such a challenging scenario. This report evaluates several potential tracking algorithms for large-scale tracking in an urban environment.

  2. Segmentation of vessels: the corkscrew algorithm

    Science.gov (United States)

    Wesarg, Stefan; Firle, Evelyn A.

    2004-05-01

    Medical imaging is nowadays much more than only providing data for diagnosis. It also links 'classical' diagnosis to modern forms of treatment such as image guided surgery. Those systems require the identification of organs, anatomical regions of the human body etc., i. e. the segmentation of structures from medical data sets. The algorithms used for these segmentation tasks strongly depend on the object to be segmented. One structure which plays an important role in surgery planning are vessels that are found everywhere in the human body. Several approaches for their extraction already exist. However, there is no general one which is suitable for all types of data or all sorts of vascular structures. This work presents a new algorithm for the segmentation of vessels. It can be classified as a skeleton-based approach working on 3D data sets, and has been designed for a reliable segmentation of coronary arteries. The algorithm is a semi-automatic extraction technique requiring the definition of the start and end the point of the (centerline) path to be found. A first estimation of the vessel's centerline is calculated and then corrected iteratively by detecting the vessel's border perpendicular to the centerline. We used contrast enhanced CT data sets of the thorax for testing our approach. Coronary arteries have been extracted from the data sets using the 'corkscrew algorithm' presented in this work. The segmentation turned out to be robust even if moderate breathing artifacts were present in the data sets.

  3. Fixed Scan Area Tracking with Track Splitting Filtering Algorithm

    DEFF Research Database (Denmark)

    Hussain, Dil Muhammad Akbar; Ahmed, Zaki

    2006-01-01

    The paper presents a simulation study by tracking multiple objects in a fixed window using a non deterministic scenario for the performance evaluation of track splitting algorithm on a digital signal processor.  Much of the previous work [1] was done on specific (deterministic) scenarios. One of ...... of such a tracking system by varying the density of the objects.  The track splitting algorithm using Kalman filters is implemented and a couple of tracking performance parameters are computed to investigate such randomly walking objects....

  4. Online evaluation of tracking algorithm performance

    OpenAIRE

    Chau, Duc Phu; Bremond, François; Thonnat, Monique

    2009-01-01

    In the 3rd International Conference on Imaging for Crime Detection and Prevention 2009 (ICDP), Kingston University, London, UK; International audience; This paper presents a method to evaluate online the performance of tracking algorithms in surveillance videos. We use a set of features to compute the confidence of trajectories and also the precision of tracking results. A global score is computed online based on these features and is used to estimate the performance of tracking algorithms. T...

  5. Algorithm for dynamic object tracking

    Science.gov (United States)

    Datcu, Mihai P.; Folta, Florin; Toma, Cristian E.

    1992-11-01

    The purpose of this paper is to present a hierarchic processor architecture for the tracking of moving objects. Two goals are envisaged: the definition of a moving window for the target tracking, and multiresolution segmentation needed for scale independent target recognition. Memory windows in single processor systems obtained by software methods are limited in speed for high complexity images. In a multiprocessor system the limitation arises in bus or memory bottleneck. Highly concurrent system architectures have been studied and implemented as crossbar bus systems, multiple buses systems, or hypercube structures. Because of the complexity of these architectures and considering the particularities of image signals we suggest a hierarchic architecture that reduces the number of connections preserving the flexibility and which is well adapted for multiresolution algorithm implementations. The hierarchy is a quadtree. The solution is in using switched bus and block memory partition (granular image memory organization). To organize such an architecture in the first stage, the moving objects are identified in the camera field and the adequate windows are defined. The system is reorganized such as the computing power is concentrated in these windows. Image segmentation and motion prediction are accomplished. Motion parameters are interpreted to adapt the windows and to dynamically reorganize the system. The estimation of the motion parameters is done over low resolution images (top of the pyramid). Multiresolution image representation has been introduced for picture transmission and for scene analysis. The pyramidal implementation was elaborated for the evaluation of the image details at various scales. The multiresolution pyramid is obtained by low pass filtering and subsampling the intermediate result. The technique is applied over a limited range of scale. The multiresolution representations, as a consequence, are close to scale invariance. In the mean time image

  6. Adaptive Kalman snake for semi-autonomous 3D vessel tracking.

    Science.gov (United States)

    Lee, Sang-Hoon; Lee, Sanghoon

    2015-10-01

    In this paper, we propose a robust semi-autonomous algorithm for 3D vessel segmentation and tracking based on an active contour model and a Kalman filter. For each computed tomography angiography (CTA) slice, we use the active contour model to segment the vessel boundary and the Kalman filter to track position and shape variations of the vessel boundary between slices. For successful segmentation via active contour, we select an adequate number of initial points from the contour of the first slice. The points are set manually by user input for the first slice. For the remaining slices, the initial contour position is estimated autonomously based on segmentation results of the previous slice. To obtain refined segmentation results, an adaptive control spacing algorithm is introduced into the active contour model. Moreover, a block search-based initial contour estimation procedure is proposed to ensure that the initial contour of each slice can be near the vessel boundary. Experiments were performed on synthetic and real chest CTA images. Compared with the well-known Chan-Vese (CV) model, the proposed algorithm exhibited better performance in segmentation and tracking. In particular, receiver operating characteristic analysis on the synthetic and real CTA images demonstrated the time efficiency and tracking robustness of the proposed model. In terms of computational time redundancy, processing time can be effectively reduced by approximately 20%. Copyright © 2015 Elsevier Ireland Ltd. All rights reserved.

  7. Common barrel and forward CA tracking algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Mykhailo, Pugach [Goethe-Universitaet, Frankfurt (Germany); Frankfurt Institute for Advanced Studies, Frankfurt (Germany); KINR, Kyiv (Ukraine); Gorbunov, Sergey; Kisel, Ivan [Goethe-Universitaet, Frankfurt (Germany); Frankfurt Institute for Advanced Studies, Frankfurt (Germany); Collaboration: PANDA-Collaboration

    2016-07-01

    There are complex detector setups which consist of barrel (cylindrical) and forward parts, and such systems require a special approach in the registered charged particles track finding procedure. Currently the tracking procedure might be performed in both parts of such detector independently from each other, but the final goal on this direction is a creation of a combined tracking, which will work in both parts of the detector simultaneously. The basic algorithm is based on Kalman Filter (KF) and Cellular Automata (CA). And the tracking procedure in such a complex system is rather extraordinary as far as it requires 2 different models to describe the state vector of segments of the reconstructed track in the mathematical apparatus of the KF-algorithm. To overcome this specifics a mathematical apparatus of transition matrices must be developed and implemented, so that one can transfer from one track model to another. Afterwards the work of the CA is performed, which reduces to segments sorting, their union into track-candidates and selection of the best candidates by the chi-square criteria after fitting of the track-candidate by the KF. In this report the algorithm, status and perspectives of such combined tracking are described.

  8. A computational algorithm addressing how vessel length might depend on vessel diameter

    Science.gov (United States)

    Jing Cai; Shuoxin Zhang; Melvin T. Tyree

    2010-01-01

    The objective of this method paper was to examine a computational algorithm that may reveal how vessel length might depend on vessel diameter within any given stem or species. The computational method requires the assumption that vessels remain approximately constant in diameter over their entire length. When this method is applied to three species or hybrids in the...

  9. An automatic contrail tracking algorithm

    Directory of Open Access Journals (Sweden)

    M. Vazquez-Navarro

    2010-08-01

    Full Text Available A method designed to track the life cycle of contrail-cirrus using satellite data with high temporal and spatial resolution, from its formation to the final dissolution of the aviation-induced cirrus cloud is presented. The method follows the evolution of contrails from their linear stage until they are undistinguishable from natural cirrus clouds. Therefore, the study of the effect of aircraft-induced clouds in the atmosphere is no longer restricted to linear contrails and can include contrail-cirrus. The method takes advantage of the high spatial resolution of polar orbiting satellites and the high temporal resolution of geostationary satellites to identify the pixels that belong to an aviation induced cloud. The high spatial resolution data of the MODIS sensor is used for contrail detection, and the high temporal resolution of the SEVIRI sensor in the Rapid Scan mode is used for contrail tracking. An example is included in which the method is applied to the study of a long lived contrail over the bay of Biscay.

  10. UWB Tracking System Design with TDOA Algorithm

    Science.gov (United States)

    Ni, Jianjun; Arndt, Dickey; Ngo, Phong; Phan, Chau; Gross, Julia; Dusl, John; Schwing, Alan

    2006-01-01

    This presentation discusses an ultra-wideband (UWB) tracking system design effort using a tracking algorithm TDOA (Time Difference of Arrival). UWB technology is exploited to implement the tracking system due to its properties, such as high data rate, fine time resolution, and low power spectral density. A system design using commercially available UWB products is proposed. A two-stage weighted least square method is chosen to solve the TDOA non-linear equations. Matlab simulations in both two-dimensional space and three-dimensional space show that the tracking algorithm can achieve fine tracking resolution with low noise TDOA data. The error analysis reveals various ways to improve the tracking resolution. Lab experiments demonstrate the UWBTDOA tracking capability with fine resolution. This research effort is motivated by a prototype development project Mini-AERCam (Autonomous Extra-vehicular Robotic Camera), a free-flying video camera system under development at NASA Johnson Space Center for aid in surveillance around the International Space Station (ISS).

  11. The research on the mean shift algorithm for target tracking

    Science.gov (United States)

    CAO, Honghong

    2017-06-01

    The traditional mean shift algorithm for target tracking is effective and high real-time, but there still are some shortcomings. The traditional mean shift algorithm is easy to fall into local optimum in the tracking process, the effectiveness of the method is weak when the object is moving fast. And the size of the tracking window never changes, the method will fail when the size of the moving object changes, as a result, we come up with a new method. We use particle swarm optimization algorithm to optimize the mean shift algorithm for target tracking, Meanwhile, SIFT (scale-invariant feature transform) and affine transformation make the size of tracking window adaptive. At last, we evaluate the method by comparing experiments. Experimental result indicates that the proposed method can effectively track the object and the size of the tracking window changes.

  12. New Algorithm of Seed Finding for Track Reconstruction

    OpenAIRE

    Baranov Dmitry; Merts Sergei; Ososkov Gennady; Rogachevsky Oleg

    2016-01-01

    Event reconstruction is a fundamental problem in the high energy physics experiments. It consists of track finding and track fitting procedures in the experiment tracking detectors. This requires a tremendous search of detector responses belonging to each track aimed at obtaining so-called “seeds”, i.e. initial approximations of track parameters of charged particles. In the paper we propose a new algorithm of the seedfinding procedure for the BM@N experiment.

  13. New Algorithm of Seed Finding for Track Reconstruction

    Directory of Open Access Journals (Sweden)

    Baranov Dmitry

    2016-01-01

    Full Text Available Event reconstruction is a fundamental problem in the high energy physics experiments. It consists of track finding and track fitting procedures in the experiment tracking detectors. This requires a tremendous search of detector responses belonging to each track aimed at obtaining so-called “seeds”, i.e. initial approximations of track parameters of charged particles. In the paper we propose a new algorithm of the seedfinding procedure for the BM@N experiment.

  14. FPGA Online Tracking Algorithm for the PANDA Straw Tube Tracker

    Science.gov (United States)

    Liang, Yutie; Ye, Hua; Galuska, Martin J.; Gessler, Thomas; Kuhn, Wolfgang; Lange, Jens Soren; Wagner, Milan N.; Liu, Zhen'an; Zhao, Jingzhou

    2017-06-01

    A novel FPGA based online tracking algorithm for helix track reconstruction in a solenoidal field, developed for the PANDA spectrometer, is described. Employing the Straw Tube Tracker detector with 4636 straw tubes, the algorithm includes a complex track finder, and a track fitter. Implemented in VHDL, the algorithm is tested on a Xilinx Virtex-4 FX60 FPGA chip with different types of events, at different event rates. A processing time of 7 $\\mu$s per event for an average of 6 charged tracks is obtained. The momentum resolution is about 3\\% (4\\%) for $p_t$ ($p_z$) at 1 GeV/c. Comparing to the algorithm running on a CPU chip (single core Intel Xeon E5520 at 2.26 GHz), an improvement of 3 orders of magnitude in processing time is obtained. The algorithm can handle severe overlapping of events which are typical for interaction rates above 10 MHz.

  15. Experiments with conjugate gradient algorithms for homotopy curve tracking

    Science.gov (United States)

    Irani, Kashmira M.; Ribbens, Calvin J.; Watson, Layne T.; Kamat, Manohar P.; Walker, Homer F.

    1991-01-01

    There are algorithms for finding zeros or fixed points of nonlinear systems of equations that are globally convergent for almost all starting points, i.e., with probability one. The essence of all such algorithms is the construction of an appropriate homotopy map and then tracking some smooth curve in the zero set of this homotopy map. HOMPACK is a mathematical software package implementing globally convergent homotopy algorithms with three different techniques for tracking a homotopy zero curve, and has separate routines for dense and sparse Jacobian matrices. The HOMPACK algorithms for sparse Jacobian matrices use a preconditioned conjugate gradient algorithm for the computation of the kernel of the homotopy Jacobian matrix, a required linear algebra step for homotopy curve tracking. Here, variants of the conjugate gradient algorithm are implemented in the context of homotopy curve tracking and compared with Craig's preconditioned conjugate gradient method used in HOMPACK. The test problems used include actual large scale, sparse structural mechanics problems.

  16. Models and Algorithms for Tracking Target with Coordinated Turn Motion

    Directory of Open Access Journals (Sweden)

    Xianghui Yuan

    2014-01-01

    Full Text Available Tracking target with coordinated turn (CT motion is highly dependent on the models and algorithms. First, the widely used models are compared in this paper—coordinated turn (CT model with known turn rate, augmented coordinated turn (ACT model with Cartesian velocity, ACT model with polar velocity, CT model using a kinematic constraint, and maneuver centered circular motion model. Then, in the single model tracking framework, the tracking algorithms for the last four models are compared and the suggestions on the choice of models for different practical target tracking problems are given. Finally, in the multiple models (MM framework, the algorithm based on expectation maximization (EM algorithm is derived, including both the batch form and the recursive form. Compared with the widely used interacting multiple model (IMM algorithm, the EM algorithm shows its effectiveness.

  17. Seismic noise attenuation using an online subspace tracking algorithm

    Science.gov (United States)

    Zhou, Yatong; Li, Shuhua; Zhang, Dong; Chen, Yangkang

    2018-02-01

    We propose a new low-rank based noise attenuation method using an efficient algorithm for tracking subspaces from highly corrupted seismic observations. The subspace tracking algorithm requires only basic linear algebraic manipulations. The algorithm is derived by analysing incremental gradient descent on the Grassmannian manifold of subspaces. When the multidimensional seismic data are mapped to a low-rank space, the subspace tracking algorithm can be directly applied to the input low-rank matrix to estimate the useful signals. Since the subspace tracking algorithm is an online algorithm, it is more robust to random noise than traditional truncated singular value decomposition (TSVD) based subspace tracking algorithm. Compared with the state-of-the-art algorithms, the proposed denoising method can obtain better performance. More specifically, the proposed method outperforms the TSVD-based singular spectrum analysis method in causing less residual noise and also in saving half of the computational cost. Several synthetic and field data examples with different levels of complexities demonstrate the effectiveness and robustness of the presented algorithm in rejecting different types of noise including random noise, spiky noise, blending noise, and coherent noise.

  18. A benchmark for comparison of cell tracking algorithms

    NARCIS (Netherlands)

    M. Maška (Martin); V. Ulman (Vladimír); K. Svoboda; P. Matula (Pavel); P. Matula (Petr); C. Ederra (Cristina); A. Urbiola (Ainhoa); T. España (Tomás); R. Venkatesan (Rajkumar); D.M.W. Balak (Deepak); P. Karas (Pavel); T. Bolcková (Tereza); M. Štreitová (Markéta); C. Carthel (Craig); S. Coraluppi (Stefano); N. Harder (Nathalie); K. Rohr (Karl); K.E.G. Magnusson (Klas E.); J. Jaldén (Joakim); H.M. Blau (Helen); O.M. Dzyubachyk (Oleh); P. Křížek (Pavel); G.M. Hagen (Guy); D. Pastor-Escuredo (David); D. Jimenez-Carretero (Daniel); M.J. Ledesma-Carbayo (Maria); A. Muñoz-Barrutia (Arrate); E. Meijering (Erik); M. Kozubek (Michal); C. Ortiz-De-Solorzano (Carlos)

    2014-01-01

    textabstractMotivation: Automatic tracking of cells in multidimensional time-lapse fluorescence microscopy is an important task in many biomedical applications. A novel framework for objective evaluation of cell tracking algorithms has been established under the auspices of the IEEE International

  19. Digital practical tracking: Algorithms with vector settling time

    Directory of Open Access Journals (Sweden)

    Stojčić Mihajlo J.

    2005-01-01

    Full Text Available In this paper nonlinear stationary digital system with separated control is treated. The new definitions of practical tracking with vector settling time are presented. Furthermore, new criteria and control algorithms which ensure digital practical tracking with vector settling time are given and proven. The results are simulated on an example.

  20. Performance Evaluation of Random Set Based Pedestrian Tracking Algorithms

    OpenAIRE

    Ristic, Branko; Sherrah, Jamie; García-Fernández, Ángel F.

    2012-01-01

    The paper evaluates the error performance of three random finite set based multi-object trackers in the context of pedestrian video tracking. The evaluation is carried out using a publicly available video dataset of 4500 frames (town centre street) for which the ground truth is available. The input to all pedestrian tracking algorithms is an identical set of head and body detections, obtained using the Histogram of Oriented Gradients (HOG) detector. The tracking error is measured using the re...

  1. Extraction of Eye Tracking Movements Using Path Stitching Algorithm

    Science.gov (United States)

    Morita, Souhei; Furukawa, Koichi; Ozaki, Tomonobu

    Researchers are able to estimate what subjects attend to by using eye tracking systems. Existing approaches for analyzing eye movements are very useful to estimate attention to still objects. But they are inadequate to estimate attention to moving objects, although paying attention to moving objects is usual human behavior. Thus, we propose a novel approach and algorithm to estimate attention to moving objects more precisely. Our approach is to extract "eye tracking movements". We phrase both saccadic eye movements and smooth pursuit eye movements as "eye tracking movements". Because previous works reveal that humans often track a moving object by the eye movements when they pay attention to the object, our approach seems to be appropriate. Our algorithm used for extracting eye tracking movements is called Path Stitching (PS) algorithm. The PS algorithm is a kind of Longest Common Subsequence (LCS) discovery algorithms using Dynamic Time Warping (DTW) as a similarity measurement procedure. Eye tracking movements can be regarded as a situation that a subsequence of eye movements' trajectory is similar to a subsequence of the target's trajectory with a small or no time-difference. Because humans track a moving object by the eye movements with locally fluctuated time difference, we think the use of DTW is very appropriate. In addition, to make outputs more comprehensible, we employ the LCS discovery approach for the PS algorithm. The experimental results show that the PS algorithm is more able to extract eye tracking movements than the fixation extracting approach. The fixation extracting approach is the most popular and the strongest approach to analyze eye movements. Therefore, we conclude that our novel approach will advance the analysis of human behavior by the eye movements and human-computer interaction systems they utilize user's eye movements.

  2. Multiple Object Tracking Using the Shortest Path Faster Association Algorithm

    Directory of Open Access Journals (Sweden)

    Zhenghao Xi

    2014-01-01

    Full Text Available To solve the persistently multiple object tracking in cluttered environments, this paper presents a novel tracking association approach based on the shortest path faster algorithm. First, the multiple object tracking is formulated as an integer programming problem of the flow network. Then we relax the integer programming to a standard linear programming problem. Therefore, the global optimum can be quickly obtained using the shortest path faster algorithm. The proposed method avoids the difficulties of integer programming, and it has a lower worst-case complexity than competing methods but better robustness and tracking accuracy in complex environments. Simulation results show that the proposed algorithm takes less time than other state-of-the-art methods and can operate in real time.

  3. Model of ballistic targets' dynamics used for trajectory tracking algorithms

    Science.gov (United States)

    Okoń-FÄ fara, Marta; Kawalec, Adam; Witczak, Andrzej

    2017-04-01

    There are known only few ballistic object tracking algorithms. To develop such algorithms and to its further testing, it is necessary to implement possibly simple and reliable objects' dynamics model. The article presents the dynamics' model of a tactical ballistic missile (TBM) including the three stages of flight: the boost stage and two passive stages - the ascending one and the descending one. Additionally, the procedure of transformation from the local coordinate system to the polar-radar oriented and the global is presented. The prepared theoretical data may be used to determine the tracking algorithm parameters and to its further verification.

  4. A gamma-ray tracking algorithm for the GRETA spectrometer

    CERN Document Server

    Schmid, G J; Lee, I Y; Stephens, F S; Vetter, K; Clark, R M; Diamond, R M; Fallon, P; Macchiavelli, A O; MacLeod, R W

    1999-01-01

    We discuss a gamma-ray tracking algorithm that has been developed for the proposed gamma-ray energy tracking array (GRETA). This algorithm has been designed so as to maximize the resolving power for detecting high-multiplicity gamma-ray events. The conceptual basis for this algorithm will be presented. In addition, Monte Carlo simulated data will be used to assess performance over a large range of relevant parameters. A discussion of the potential gamma-ray polarimeter performance of GRETA is also presented.

  5. Efficient Vessel Tracking  with Accuracy Guarantees

    DEFF Research Database (Denmark)

    Redoutey, Martin; Scotti, Eric; Jensen, Christian Søndergaard

    2008-01-01

    Safety and security are top concerns in maritime navigation, particularly as maritime traffic continues to grow and as crew sizes are reduced. The Automatic Identification System (AIS) plays a key role in regard to these concerns. This system, whose objective is in part to identify and locate ves...... accuracies at lower communication costs. The techniques employ movement predictions that are shared between vessels and the VTS. Empirical studies with a prototype implementation and real vessel data demonstrate that the techniques are capable of significantly improving the AIS....

  6. Tracking blood vessels in human forearms using visual servoing

    DEFF Research Database (Denmark)

    Savarimuthu, Thiusius Rajeeth; Ellekilde, Lars-Peter; Hansen, Morten

    compensation. By using images taken with near-infrared light to locate the blood vessels in a human forearm and using the same images to detects movements of the arm, this paper shows that it is possible make a robot arm, potentially equipped with a needle for drawing the blood, compensate for the movements...

  7. The Seeding tracking algorithm for a scintillating detector at LHCb

    CERN Document Server

    Amhis, Y; De Cian, M; Nikodem, T; Polci, F

    2014-01-01

    The project of the LHCb upgraded detector foreseens the presence of a Scintillating Fiber Tracker (SciFi). This note describes the algorithm used for reconstructing standalone tracks in the SciFi, called $Seeding$. This algorithm is crucial for reconstructing tracks generated by long lived particles such as $K^0_s$. The main performances on simulated samples for running conditions expected in future data taking after the upgrade, namely a luminosity larger than $\\mathcal{L} = 2 \\times 10^{33} cm^{-2}s^{1}$, are also discussed.

  8. Study of hardware implementations of fast tracking algorithms

    Science.gov (United States)

    Song, Z.; De Lentdecker, G.; Dong, J.; Huang, G.; Léonard, A.; Robert, F.; Wang, D.; Yang, Y.

    2017-02-01

    Real-time track reconstruction at high event rates is a major challenge for future experiments in high energy physics. To perform pattern-recognition and track fitting, artificial retina or Hough transformation methods have been introduced in the field which have to be implemented in FPGA firmware. In this note we report on a case study of a possible FPGA hardware implementation approach of the retina algorithm based on a Floating-Point core. Detailed measurements with this algorithm are investigated. Retina performance and capabilities of the FPGA are discussed along with perspectives for further optimization and applications.

  9. An object tracking algorithm with embedded gyro information

    Science.gov (United States)

    Zhang, Yutong; Yan, Ding; Yuan, Yating

    2017-01-01

    The high speed attitude maneuver of Unmanned Aerial Vehicle (UAV) always causes large motion between adjacent frames of the video stream produced from the camera fixed on the UAV body, which will severely disrupt the performance of image object tracking process. To solve this problem, this paper proposes a method that using a gyroscope fixed on the camera to measure the angular velocity of camera, and then the object position's substantial change in the video stream is predicted. We accomplished the object tracking based on template matching. Experimental result shows that the object tracking algorithm's performance is improved in its efficiency and robustness with embedded gyroscope information.

  10. Improving the apatite fission-track annealing algorithm

    Science.gov (United States)

    Luijendijk, Elco; Andriessen, Paul; ter Voorde, Marlies; van Balen, Ronald

    2017-04-01

    Low-temperature thermochronology is a key tool to quantifying the thermal history and exhumation of the crust. The interpretation of one of the most widely-used thermochronometers, apatite fission-track analysis, relies on models that relate fission track density to temperature history. These models have been calibrated to fission-track data from the Otway basin, Australia. We discuss geological evidence that the current benchmark dataset is located in a basin in which rocks may have been warmer in the past than previously assumed. We recalibrate the apatite fission-track annealing algorithm to a dataset from Southern Texas with a well-constrained thermal history. We show that current models underestimate the temperature at which fission tracks anneal completely by 19 ˚C to 34 ˚C. Exhumation rates derived from fission-track data have been underestimated; at normal geothermal gradients estimates may have to be revised upward by 500 to 2000 m. The results also have implications for the (U-Th)/He thermochronometer, because radiation damage influences the diffusivity of helium in apatites. The difference in modelled (U-Th)/He ages is approximately 10% for samples that have undergone a long cooling history. We also present a new Python code that can be used for forward or inverse modelling of fission track data using the new annealing algorithm.

  11. Algorithm-based method for detection of blood vessels in breast MRI for development of computer-aided diagnosis.

    Science.gov (United States)

    Lin, Muqing; Chen, Jeon-Hor; Nie, Ke; Chang, Daniel; Nalcioglu, Orhan; Su, Min-Ying

    2009-10-01

    To develop a computer-based algorithm for detecting blood vessels that appear in breast dynamic contrast-enhanced (DCE) magnetic resonance imaging (MRI), and to evaluate the improvement in reducing the number of vascular pixels that are labeled by computer-aided diagnosis (CAD) systems as being suspicious of malignancy. The analysis was performed in 34 cases. The algorithm applied a filter bank based on wavelet transform and the Hessian matrix to detect linear structures as blood vessels on a two-dimensional maximum intensity projection (MIP). The vessels running perpendicular to the MIP plane were then detected based on the connectivity of enhanced pixels above a threshold. The nonvessel enhancements were determined and excluded based on their morphological properties, including those showing scattered small segment enhancements or nodular or planar clusters. The detected vessels were first converted to a vasculature skeleton by thinning and subsequently compared to the vascular track manually drawn by a radiologist. When evaluating the performance of the algorithm in identifying vascular tissue, the correct-detection rate refers to pixels identified by both the algorithm and radiologist, while the incorrect-detection rate refers to pixels identified by only the algorithm, and the missed-detection rate refers to pixels identified only by the radiologist. From 34 analyzed cases the median correct-detection rate was 85.6% (mean 84.9% +/- 7.8%), the incorrect-detection rate was 13.1% (mean 15.1% +/- 7.8%), and the missed-detection rate was 19.2% (mean 21.3% +/- 12.8%). When detected vessels were excluded in the hot-spot color-coding of the CAD system, they could reduce the labeling of vascular vessels in 2.6%-68.6% of hot-spot pixels (mean 16.6% +/- 15.9%). The computer algorithm-based method can detect most large vessels and provide an effective means in reducing the labeling of vascular pixels as suspicious on a DCE-MRI CAD system. This algorithm may improve the

  12. A baseline algorithm for face detection and tracking in video

    Science.gov (United States)

    Manohar, Vasant; Soundararajan, Padmanabhan; Korzhova, Valentina; Boonstra, Matthew; Goldgof, Dmitry; Kasturi, Rangachar

    2007-10-01

    Establishing benchmark datasets, performance metrics and baseline algorithms have considerable research significance in gauging the progress in any application domain. These primarily allow both users and developers to compare the performance of various algorithms on a common platform. In our earlier works, we focused on developing performance metrics and establishing a substantial dataset with ground truth for object detection and tracking tasks (text and face) in two video domains -- broadcast news and meetings. In this paper, we present the results of a face detection and tracking algorithm on broadcast news videos with the objective of establishing a baseline performance for this task-domain pair. The detection algorithm uses a statistical approach that was originally developed by Viola and Jones and later extended by Lienhart. The algorithm uses a feature set that is Haar-like and a cascade of boosted decision tree classifiers as a statistical model. In this work, we used the Intel Open Source Computer Vision Library (OpenCV) implementation of the Haar face detection algorithm. The optimal values for the tunable parameters of this implementation were found through an experimental design strategy commonly used in statistical analyses of industrial processes. Tracking was accomplished as continuous detection with the detected objects in two frames mapped using a greedy algorithm based on the distances between the centroids of bounding boxes. Results on the evaluation set containing 50 sequences (~ 2.5 mins.) using the developed performance metrics show good performance of the algorithm reflecting the state-of-the-art which makes it an appropriate choice as the baseline algorithm for the problem.

  13. Robust Coordinated Control Algorithm for Multiple Marine Vessels with External Disturbances

    Directory of Open Access Journals (Sweden)

    Weixue Liu

    2013-01-01

    Full Text Available The problem of coordinated control for multiple marine vessels in the presence of external disturbances is considered in this paper. A robust coordinated control algorithm is proposed for multiple marine vessels. The proposed robust coordinated control algorithm is divided into two parts. The first part develops an extended state observer to estimate the disturbances of marine vessels. The second part presents a robust coordinated control algorithm based on the output of the extended state observer. Furthermore, the robust coordinated control algorithm is designed using the dynamic surface control method. In light of the leader-follower strategy, the trajectory for each vessel is defined according to the desired trajectory of the assigned leader and the relative distance with respect to the leader. The effectiveness of the proposed coordination algorithm is demonstrated by the simulation results.

  14. Path-tracking Algorithm for Aircraft Fuel Tank Inspection Robots

    Directory of Open Access Journals (Sweden)

    Niu Guochen

    2014-05-01

    Full Text Available A 3D path-tracking algorithm based on end-point approximation is proposed to implement the path traversal of robots designed to inspect aircraft fuel tanks. Kinematic models of single-joint segments and multiple-joint segments were created. First, each joint segment of the path was divided into many equal sections and the rotation angle was computed. The rotation angle was found for the plane determined by one divided point and the secondary terminal joint segment. Second, the shortest distance search strategy was used to calculate the bending angle of the joint segment. The main advantage of the algorithm was that only the terminal joint segment variables needed to be solved, the joint variables of other joint segments were copied from the adjacent front-end joint segment variables in turn. Finally, evaluation indexes of path tracking performance were proposed to evaluate the effect of the algorithm. Simulations of planar and space path tracking were carried out using MATLAB, and the effectiveness and stability of the tracking algorithm were verified.

  15. Performance Assessment of Hybrid Data Fusion and Tracking Algorithms

    DEFF Research Database (Denmark)

    Sand, Stephan; Mensing, Christian; Laaraiedh, Mohamed

    2009-01-01

    This paper presents an overview on the performance of hybrid data fusion and tracking algorithms evaluated in the WHERE consortium. The focus is on three scenarios. For the small scale indoor scenario with ultra wideband (UWB) complementing cellular communication systems, the accuracy can vary...

  16. Multiscale Architectures and Parallel Algorithms for Video Object Tracking

    Science.gov (United States)

    2011-10-01

    Black River Systems. This may have inadvertently introduced bugs that were later discovered by AFRL during testing (of the June 22, 2011 version of...Parallelism in Algorithms and Architectures, pages 289–298, 2007. [3] S. Ali and M. Shah. COCOA - Tracking in aerial imagery. In Daniel J. Henry

  17. A benchmark for comparison of cell tracking algorithms

    Science.gov (United States)

    Maška, Martin; Ulman, Vladimír; Svoboda, David; Matula, Pavel; Matula, Petr; Ederra, Cristina; Urbiola, Ainhoa; España, Tomás; Venkatesan, Subramanian; Balak, Deepak M.W.; Karas, Pavel; Bolcková, Tereza; Štreitová, Markéta; Carthel, Craig; Coraluppi, Stefano; Harder, Nathalie; Rohr, Karl; Magnusson, Klas E. G.; Jaldén, Joakim; Blau, Helen M.; Dzyubachyk, Oleh; Křížek, Pavel; Hagen, Guy M.; Pastor-Escuredo, David; Jimenez-Carretero, Daniel; Ledesma-Carbayo, Maria J.; Muñoz-Barrutia, Arrate; Meijering, Erik; Kozubek, Michal; Ortiz-de-Solorzano, Carlos

    2014-01-01

    Motivation: Automatic tracking of cells in multidimensional time-lapse fluorescence microscopy is an important task in many biomedical applications. A novel framework for objective evaluation of cell tracking algorithms has been established under the auspices of the IEEE International Symposium on Biomedical Imaging 2013 Cell Tracking Challenge. In this article, we present the logistics, datasets, methods and results of the challenge and lay down the principles for future uses of this benchmark. Results: The main contributions of the challenge include the creation of a comprehensive video dataset repository and the definition of objective measures for comparison and ranking of the algorithms. With this benchmark, six algorithms covering a variety of segmentation and tracking paradigms have been compared and ranked based on their performance on both synthetic and real datasets. Given the diversity of the datasets, we do not declare a single winner of the challenge. Instead, we present and discuss the results for each individual dataset separately. Availability and implementation: The challenge Web site (http://www.codesolorzano.com/celltrackingchallenge) provides access to the training and competition datasets, along with the ground truth of the training videos. It also provides access to Windows and Linux executable files of the evaluation software and most of the algorithms that competed in the challenge. Contact: codesolorzano@unav.es Supplementary information: Supplementary data are available at Bioinformatics online. PMID:24526711

  18. Comparison of tracking algorithms implemented in OpenCV

    Directory of Open Access Journals (Sweden)

    Janku Peter

    2016-01-01

    Full Text Available Computer vision is very progressive and modern part of computer science. From scientific point of view, theoretical aspects of computer vision algorithms prevail in many papers and publications. The underlying theory is really important, but on the other hand, the final implementation of an algorithm significantly affects its performance and robustness. For this reason, this paper tries to compare real implementation of tracking algorithms (one part of computer vision problem, which can be found in the very popular library OpenCV. Moreover, the possibilities of optimizations are discussed.

  19. An algorithm to automate yeast segmentation and tracking.

    Directory of Open Access Journals (Sweden)

    Andreas Doncic

    Full Text Available Our understanding of dynamic cellular processes has been greatly enhanced by rapid advances in quantitative fluorescence microscopy. Imaging single cells has emphasized the prevalence of phenomena that can be difficult to infer from population measurements, such as all-or-none cellular decisions, cell-to-cell variability, and oscillations. Examination of these phenomena requires segmenting and tracking individual cells over long periods of time. However, accurate segmentation and tracking of cells is difficult and is often the rate-limiting step in an experimental pipeline. Here, we present an algorithm that accomplishes fully automated segmentation and tracking of budding yeast cells within growing colonies. The algorithm incorporates prior information of yeast-specific traits, such as immobility and growth rate, to segment an image using a set of threshold values rather than one specific optimized threshold. Results from the entire set of thresholds are then used to perform a robust final segmentation.

  20. An algorithm to automate yeast segmentation and tracking.

    Science.gov (United States)

    Doncic, Andreas; Eser, Umut; Atay, Oguzhan; Skotheim, Jan M

    2013-01-01

    Our understanding of dynamic cellular processes has been greatly enhanced by rapid advances in quantitative fluorescence microscopy. Imaging single cells has emphasized the prevalence of phenomena that can be difficult to infer from population measurements, such as all-or-none cellular decisions, cell-to-cell variability, and oscillations. Examination of these phenomena requires segmenting and tracking individual cells over long periods of time. However, accurate segmentation and tracking of cells is difficult and is often the rate-limiting step in an experimental pipeline. Here, we present an algorithm that accomplishes fully automated segmentation and tracking of budding yeast cells within growing colonies. The algorithm incorporates prior information of yeast-specific traits, such as immobility and growth rate, to segment an image using a set of threshold values rather than one specific optimized threshold. Results from the entire set of thresholds are then used to perform a robust final segmentation.

  1. Genetic algorithm for multiple-target-tracking data association

    Science.gov (United States)

    Carrier, Jean-Yves; Litva, John; Leung, Henry; Lo, Titus K. Y.

    1996-06-01

    The heart of any tracking system is its data association algorithm where measurements, received as sensor returns, are assigned to a track, or rejected as clutter. In this paper, we investigate the use of genetic algorithms (GA) for the multiple target tracking data association problem. GA are search methods based on the mechanics of natural selection and genetics. They have been proven theoretically and empirically robust in complex space searches by the founder J. H. Holland. Contrary to most optimization techniques, which seek to improve performance toward the optimum, GA find near-optimal solutions through parallel searches in the solution space. We propose to optimize a simplified version of the neural energy function proposed by Sengupta and Iltis in their network implementation of the joint probability data association. We follow an identical approach by first implementing a GA for the travelling salesperson problem based on Hopfield and Tank's neural network research.

  2. High speed railway track dynamics models, algorithms and applications

    CERN Document Server

    Lei, Xiaoyan

    2017-01-01

    This book systematically summarizes the latest research findings on high-speed railway track dynamics, made by the author and his research team over the past decade. It explores cutting-edge issues concerning the basic theory of high-speed railways, covering the dynamic theories, models, algorithms and engineering applications of the high-speed train and track coupling system. Presenting original concepts, systematic theories and advanced algorithms, the book places great emphasis on the precision and completeness of its content. The chapters are interrelated yet largely self-contained, allowing readers to either read through the book as a whole or focus on specific topics. It also combines theories with practice to effectively introduce readers to the latest research findings and developments in high-speed railway track dynamics. It offers a valuable resource for researchers, postgraduates and engineers in the fields of civil engineering, transportation, highway & railway engineering.

  3. An algorithm of adaptive scale object tracking in occlusion

    Science.gov (United States)

    Zhao, Congmei

    2017-05-01

    Although the correlation filter-based trackers achieve the competitive results both on accuracy and robustness, there are still some problems in handling scale variations, object occlusion, fast motions and so on. In this paper, a multi-scale kernel correlation filter algorithm based on random fern detector was proposed. The tracking task was decomposed into the target scale estimation and the translation estimation. At the same time, the Color Names features and HOG features were fused in response level to further improve the overall tracking performance of the algorithm. In addition, an online random fern classifier was trained to re-obtain the target after the target was lost. By comparing with some algorithms such as KCF, DSST, TLD, MIL, CT and CSK, experimental results show that the proposed approach could estimate the object state accurately and handle the object occlusion effectively.

  4. IDENTIFICATION SYSTEM, TRACKING AND SUPPORT FOR VESSELS ON RIVERS

    Directory of Open Access Journals (Sweden)

    SAMOILESCU Gheorghe

    2015-05-01

    Full Text Available According to the program COMPRIS (Consortium Operational Management Platform River Information Services, AIS (Automatic Identification System, RIS (River Information Services have compiled a reference model based on the perspective of navigation on the river with related information services. This paper presents a tracking and monitoring surveillance system necessary for assistance of each ship sailing in an area of interest. It shows the operating principle of the composition and role of each equipment. Transferring data to traffic monitoring authority is part of this work.

  5. Sensitivities of a cyclone detection and tracking algorithm: individual tracks and climatology

    Energy Technology Data Exchange (ETDEWEB)

    Pinto, J.G.; Speth, P. [Inst. fuer Geophysik und Meteorologie, Univ. zu Koeln (Germany); Spangehl, T.; Ulbrich, U. [Inst. fuer Geophysik und Meteorologie, Univ. zu Koeln (Germany); Inst. fuer Meteorologie, Freie Univ. Berlin (Germany)

    2005-12-01

    Northern Hemisphere cyclone activity is assessed by applying an algorithm for the detection and tracking of synoptic scale cyclones to mean sea level pressure data. The method, originally developed for the Southern Hemisphere, is adapted for application in the Northern Hemisphere winter season. NCEP-Reanalysis data from 1958/59 to 1997/98 are used as input. The sensitivities of the results to particular parameters of the algorithm are discussed for both case studies and from a climatological point of view. Results show that the choice of settings is of major relevance especially for the tracking of smaller scale and fast moving systems. With an appropriate setting the algorithm is capable of automatically tracking different types of cyclones at the same time: Both fast moving and developing systems over the large ocean basins and smaller scale cyclones over the Mediterranean basin can be assessed. The climatology of cyclone variables, e.g., cyclone track density, cyclone counts, intensification rates, propagation speeds and areas of cyclogenesis and -lysis gives detailed information on typical cyclone life cycles for different regions. The lowering of the spatial and temporal resolution of the input data from full resolution T62/06h to T42/12h decreases the cyclone track density and cyclone counts. Reducing the temporal resolution alone contributes to a decline in the number of fast moving systems, which is relevant for the cyclone track density. Lowering spatial resolution alone mainly reduces the number of weak cyclones. (orig.)

  6. Patch Based Multiple Instance Learning Algorithm for Object Tracking.

    Science.gov (United States)

    Wang, Zhenjie; Wang, Lijia; Zhang, Hua

    2017-01-01

    To deal with the problems of illumination changes or pose variations and serious partial occlusion, patch based multiple instance learning (P-MIL) algorithm is proposed. The algorithm divides an object into many blocks. Then, the online MIL algorithm is applied on each block for obtaining strong classifier. The algorithm takes account of both the average classification score and classification scores of all the blocks for detecting the object. In particular, compared with the whole object based MIL algorithm, the P-MIL algorithm detects the object according to the unoccluded patches when partial occlusion occurs. After detecting the object, the learning rates for updating weak classifiers' parameters are adaptively tuned. The classifier updating strategy avoids overupdating and underupdating the parameters. Finally, the proposed method is compared with other state-of-the-art algorithms on several classical videos. The experiment results illustrate that the proposed method performs well especially in case of illumination changes or pose variations and partial occlusion. Moreover, the algorithm realizes real-time object tracking.

  7. Models and Algorithms for Container Vessel Stowage Optimization

    DEFF Research Database (Denmark)

    Delgado-Ortegon, Alberto

    planning that includes features of stowage planning that have not been considered in previous work. For slot planning, a fast and accurate representative model to optimally stow vessel sections is introduced. The second SP approach serves as the optimization component of a commercial decision support tool...... used for interactive planning of container vessels. Expert's know-how formulated as user preferences is integrated into the heuristic optimization component and used to tackle complex constraints and optimize combinatorial objectives. According to our experimental evaluation, stowage plans computed...... by our heuristic are competitive enough with respect to those made by experts under the same conditions. The CCP evaluates how the stowage characteristics of containers with different features affect important performance measures used in liner shipping companies, e.g., vessel intake and cargo revenue...

  8. Level-1 pixel based tracking trigger algorithm for LHC upgrade

    CERN Document Server

    Moon, Chang-Seong

    2015-01-01

    The Pixel Detector is the innermost detector of the tracking system of the Compact Muon Solenoid (CMS) experiment at CERN Large Hadron Collider (LHC). It precisely determines the interaction point (primary vertex) of the events and the possible secondary vertexes due to heavy flavours ($b$ and $c$ quarks); it is part of the overall tracking system that allows reconstructing the tracks of the charged particles in the events and combined with the magnetic field to measure their impulsion. The pixel detector allows measuring the tracks in the region closest to the interaction point. The Level-1 (real-time) pixel based tracking trigger is a novel trigger system that is currently being studied for the LHC upgrade. An important goal is developing real-time track reconstruction algorithms able to cope with very high rates and high flux of data in a very harsh environment. The pixel detector has an especially crucial role in precisely identifying the primary vertex of the rare physics events from the large pile-up (P...

  9. Face pose tracking using the four-point algorithm

    Science.gov (United States)

    Fung, Ho Yin; Wong, Kin Hong; Yu, Ying Kin; Tsui, Kwan Pang; Kam, Ho Chuen

    2017-06-01

    In this paper, we have developed an algorithm to track the pose of a human face robustly and efficiently. Face pose estimation is very useful in many applications such as building virtual reality systems and creating an alternative input method for the disabled. Firstly, we have modified a face detection toolbox called DLib for the detection of a face in front of a camera. The detected face features are passed to a pose estimation method, known as the four-point algorithm, for pose computation. The theory applied and the technical problems encountered during system development are discussed in the paper. It is demonstrated that the system is able to track the pose of a face in real time using a consumer grade laptop computer.

  10. Vision-Based Object Tracking Algorithm With AR. Drone

    Directory of Open Access Journals (Sweden)

    It Nun Thiang

    2015-08-01

    Full Text Available This paper presents a simple and effective vision-based algorithm for autonomous object tracking of a low-cost AR.Drone quadrotor for moving ground and flying targets. The Open-CV is used for computer vision to estimate the position of the object considering the environmental lighting effect. This is also an off-board control as the visual tracking and control process are performed in the laptop with the help of Wi-Fi link. The information obtained from vision algorithm is used to control roll angle and pitch angle of the drone in the case using bottom camera and to control yaw angle and altitude of the drone when the front camera is used as vision sensor. The experimental results from real tests are presented.

  11. Comparison of vessel enhancement algorithms applied to time-of-flight MRA images for cerebrovascular segmentation.

    Science.gov (United States)

    Phellan, Renzo; Forkert, Nils D

    2017-11-01

    Vessel enhancement algorithms are often used as a preprocessing step for vessel segmentation in medical images to improve the overall segmentation accuracy. Each algorithm uses different characteristics to enhance vessels, such that the most suitable algorithm may vary for different applications. This paper presents a comparative analysis of the accuracy gains in vessel segmentation generated by the use of nine vessel enhancement algorithms: Multiscale vesselness using the formulas described by Erdt (MSE), Frangi (MSF), and Sato (MSS), optimally oriented flux (OOF), ranking orientations responses path operator (RORPO), the regularized Perona-Malik approach (RPM), vessel enhanced diffusion (VED), hybrid diffusion with continuous switch (HDCS), and the white top hat algorithm (WTH). The filters were evaluated and compared based on time-of-flight MRA datasets and corresponding manual segmentations from 5 healthy subjects and 10 patients with an arteriovenous malformation. Additionally, five synthetic angiographic datasets with corresponding ground truth segmentation were generated with three different noise levels (low, medium, and high) and also used for comparison. The parameters for each algorithm and subsequent segmentation were optimized using leave-one-out cross evaluation. The Dice coefficient, Matthews correlation coefficient, area under the ROC curve, number of connected components, and true positives were used for comparison. The results of this study suggest that vessel enhancement algorithms do not always lead to more accurate segmentation results compared to segmenting nonenhanced images directly. Multiscale vesselness algorithms, such as MSE, MSF, and MSS proved to be robust to noise, while diffusion-based filters, such as RPM, VED, and HDCS ranked in the top of the list in scenarios with medium or no noise. Filters that assume tubular-shapes, such as MSE, MSF, MSS, OOF, RORPO, and VED show a decrease in accuracy when considering patients with an AVM

  12. "Eztrack": A single-vehicle deterministic tracking algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Carrano, C J

    2007-12-20

    A variety of surveillance operations require the ability to track vehicles over a long period of time using sequences of images taken from a camera mounted on an airborne or similar platform. In order to be able to see and track a vehicle for any length of time, either a persistent surveillance imager is needed that can image wide fields of view over a long time-span or a highly maneuverable smaller field-of-view imager is needed that can follow the vehicle of interest. The algorithm described here was designed for the persistence surveillance case. In turns out that most vehicle tracking algorithms described in the literature[1,2,3,4] are designed for higher frame rates (> 5 FPS) and relatively short ground sampling distances (GSD) and resolutions ({approx} few cm to a couple tens of cm). But for our datasets, we are restricted to lower resolutions and GSD's ({ge}0.5 m) and limited frame-rates ({le}2.0 Hz). As a consequence, we designed our own simple approach in IDL which is a deterministic, motion-guided object tracker. The object tracking relies both on object features and path dynamics. The algorithm certainly has room for future improvements, but we have found it to be a useful tool in evaluating effects of frame-rate, resolution/GSD, and spectral content (eg. grayscale vs. color imaging ). A block diagram of the tracking approach is given in Figure 1. We describe each of the blocks of the diagram in the upcoming sections.

  13. Evolutionary algorithm for automatic detection of blood vessel shapes

    Science.gov (United States)

    Kutics, Andrea

    1996-04-01

    Automatic detection of blood vessel shapes locating in the skin has a great diagnostic importance. In this work, an evolutionary approach operating on morphological operator and operation structures is proposed for the determination of the shape and network of blood vessels located in upper skin layers. A population of individuals comprising morphological structures is generated. A two-dimensional queue like data representation of individuals is applied in order to provide an appropriate representation of the connectivity constraints originated in the two dimensional nature of the structuring elements. Two-dimensional crossover and mutation type manipulation operations are carried out on selected elements of the population. Unlike the usual techniques, in our approach no constraints are used for background and smoothness as no matched filter or linear operator is applied. Also no a priori knowledge of the vessel shape is necessary due to the evolutionary method. Unlike the usual imaging techniques, that mainly use angiograms as input, in this work infrared filtered images taken by CCD camera are applied to investigate the blood vessels of broad skin areas. The method is implemented parallel on a lattice network of transputers resulting in a significantly decreased processing time compared to the usual techniques.

  14. Path-tracking Algorithm for Aircraft Fuel Tank Inspection Robots

    OpenAIRE

    Niu Guochen; Wang Li; Gao Qingji; Hu Dandan

    2014-01-01

    A 3D path-tracking algorithm based on end- point approximation is proposed to implement the path traversal of robots designed to inspect aircraft fuel tanks. Kinematic models of single-joint segments and multiple- joint segments were created. First, each joint segment of the path was divided into many equal sections and the rotation angle was computed. The rotation angle was found for the plane determined by one divided point and the secondary terminal joint segment. Second, the shortest dist...

  15. Automatic seismic event tracking using a dynamic time warping algorithm

    Science.gov (United States)

    Jin, Song; Chen, ShuangQuan; Wei, Jianxin; Li, Xiang-Yang

    2017-10-01

    For seismic data interpretation, horizon picking based on seismic events in stacked or migrated seismic sections is essential for obtaining information on subsurface structures. This conventional work is time-consuming via manual implementation. In this paper, we develop an automatic seismic event tracking method of horizon interpretation using the dynamic time warping (DTW) algorithm. The proposed method consists of two steps: calculating local time shifts between adjacent traces through a pilot trace and then event tracking. In the method, the DTW algorithm is applied to calculate time shifts between two adjacent traces, and an improved multitrace DTW strategy is proposed to improve the robustness. One synthetic seismic trace is used to demonstrate the DTW algorithm, and a synthetic seismic section is used to verify the feasibility of the proposed method handling contaminated seismic data with noise. Finally, we apply the method to a 3D physical model dataset. The result indicates that the proposed method is quantitatively feasible for seismic event automatic tracking and is reasonably stable for noisy seismic section flattening, which also has the potential to extract seismic horizon slices effectively.

  16. Research on target tracking algorithm based on spatio-temporal context

    Science.gov (United States)

    Li, Baiping; Xu, Sanmei; Kang, Hongjuan

    2017-07-01

    In this paper, a novel target tracking algorithm based on spatio-temporal context is proposed. During the tracking process, the camera shaking or occlusion may lead to the failure of tracking. The proposed algorithm can solve this problem effectively. The method use the spatio-temporal context algorithm as the main research object. We get the first frame's target region via mouse. Then the spatio-temporal context algorithm is used to get the tracking targets of the sequence of frames. During this process a similarity measure function based on perceptual hash algorithm is used to judge the tracking results. If tracking failed, reset the initial value of Mean Shift algorithm for the subsequent target tracking. Experiment results show that the proposed algorithm can achieve real-time and stable tracking when camera shaking or target occlusion.

  17. Neural-network-based voice-tracking algorithm

    Science.gov (United States)

    Baker, Mary; Stevens, Charise; Chaparro, Brennen; Paschall, Dwayne

    2002-11-01

    A voice-tracking algorithm was developed and tested for the purposes of electronically separating the voice signals of simultaneous talkers. Many individuals suffer from hearing disorders that often inhibit their ability to focus on a single speaker in a multiple speaker environment (the cocktail party effect). Digital hearing aid technology makes it possible to implement complex algorithms for speech processing in both the time and frequency domains. In this work, an average magnitude difference function (AMDF) was performed on mixed voice signals in order to determine the fundamental frequencies present in the signals. A time prediction neural network was trained to recognize normal human voice inflection patterns, including rising, falling, rising-falling, and falling-rising patterns. The neural network was designed to track the fundamental frequency of a single talker based on the training procedure. The output of the neural network can be used to design an active filter for speaker segregation. Tests were done using audio mixing of two to three speakers uttering short phrases. The AMDF function accurately identified the fundamental frequencies present in the signal. The neural network was tested using a single speaker uttering a short sentence. The network accurately tracked the fundamental frequency of the speaker.

  18. VESSEL CENTERLINE TRACKING AND BOUNDARY SEGMENTATION IN CORONARY MRA WITH MINIMAL MANUAL INTERACTION.

    Science.gov (United States)

    Soleimanifard, Sahar; Schär, Michael; Hays, Allison G; Weiss, Robert G; Stuber, Matthias; Prince, Jerry L

    2012-01-01

    Magnetic resonance angiography (MRA) provides a noninvasive means to detect the presence, location and severity of atherosclerosis throughout the vascular system. In such studies, and especially those in the coronary arteries, the vessel luminal area is typically measured at multiple cross-sectional locations along the course of the artery. The advent of fast volumetric imaging techniques covering proximal to mid segments of coronary arteries necessitates automatic analysis tools requiring minimal manual interactions to robustly measure cross-sectional area along the three-dimensional track of the arteries in under-sampled and non-isotropic datasets. In this work, we present a modular approach based on level set methods to track the vessel centerline, segment the vessel boundaries, and measure transversal area using two user-selected endpoints in each coronary of interest. Arterial area and vessel length are measured using our method and compared to the standard Soap-Bubble reformatting and analysis tool in in-vivo non-contrast enhanced coronary MRA images.

  19. A FragTrack algorithm enhancement for total occlusion management in visual object tracking

    Science.gov (United States)

    Adamo, F.; Mazzeo, P. L.; Spagnolo, P.; Distante, C.

    2015-05-01

    In recent years, "FragTrack" has become one of the most cited real time algorithms for visual tracking of an object in a video sequence. However, this algorithm fails when the object model is not present in the image or it is completely occluded, and in long term video sequences. In these sequences, the target object appearance is considerably modified during the time and its comparison with the template established at the first frame is hard to compute. In this work we introduce improvements to the original FragTrack: the management of total object occlusions and the update of the object template. Basically, we use a voting map generated by a non-parametric kernel density estimation strategy that allows us to compute a probability distribution for the distances of the histograms between template and object patches. In order to automatically determine whether the target object is present or not in the current frame, an adaptive threshold is introduced. A Bayesian classifier establishes, frame by frame, the presence of template object in the current frame. The template is partially updated at every frame. We tested the algorithm on well-known benchmark sequences, in which the object is always present, and on video sequences showing total occlusion of the target object to demonstrate the effectiveness of the proposed method.

  20. Development of algorithm for single axis sun tracking system

    Science.gov (United States)

    Yi, Lim Zi; Singh, Balbir Singh Mahinder; Ching, Dennis Ling Chuan; Jin, Calvin Low Eu

    2016-11-01

    The output power from a solar panel depends on the amount of sunlight that is intercepted by the photovoltaic (PV) solar panel. The value of solar irradiance varies due to the change of position of sun and the local meteorological conditions. This causes the output power of a PV based solar electricity generating system (SEGS) to fluctuate as well. In this paper, the focus is on the integration of solar tracking system with performance analyzer system through the development of an algorithm for optimizing the performance of SEGS. The proposed algorithm displays real-time processed data that would enable users to understand the trend of the SEGS output for maintenance prediction and optimization purposes.

  1. A hybrid lung and vessel segmentation algorithm for computer aided detection of pulmonary embolism

    Science.gov (United States)

    Raghupathi, Laks; Lakare, Sarang

    2009-02-01

    Advances in multi-detector technology have made CT pulmonary angiography (CTPA) a popular radiological tool for pulmonary emboli (PE) detection. CTPA provide rich detail of lung anatomy and is a useful diagnostic aid in highlighting even very small PE. However analyzing hundreds of slices is laborious and time-consuming for the practicing radiologist which may also cause misdiagnosis due to the presence of various PE look-alike. Computer-aided diagnosis (CAD) can be a potential second reader in providing key diagnostic information. Since PE occurs only in vessel arteries, it is important to mark this region of interest (ROI) during CAD preprocessing. In this paper, we present a new lung and vessel segmentation algorithm for extracting contrast-enhanced vessel ROI in CTPA. Existing approaches to segmentation either provide only the larger lung area without highlighting the vessels or is computationally prohibitive. In this paper, we propose a hybrid lung and vessel segmentation which uses an initial lung ROI and determines the vessels through a series of refinement steps. We first identify a coarse vessel ROI by finding the "holes" from the lung ROI. We then use the initial ROI as seed-points for a region-growing process while carefully excluding regions which are not relevant. The vessel segmentation mask covers 99% of the 259 PE from a real-world set of 107 CTPA. Further, our algorithm increases the net sensitivity of a prototype CAD system by 5-9% across all PE categories in the training and validation data sets. The average run-time of algorithm was only 100 seconds on a standard workstation.

  2. Optimal design of high pressure hydrogen storage vessel using an adaptive genetic algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Xu, Ping [Institute of Applied Mechanics, Zhejiang University, Hangzhou 310027 (China); Zheng, Jinyang; Chen, Honggang; Liu, Pengfei [Institute of Chemical Machinery and Process Equipment, Zhejiang University, Hangzhou 310027 (China)

    2010-04-15

    The weight minimum optimization of composite hydrogen storage vessel under the burst pressure constraint is considered. An adaptive genetic algorithm is proposed to perform the optimal design of composite vessels. The proposed optimization algorithm considers the adaptive probabilities of crossover and mutation which change with the fitness values of individuals and proposes a penalty function to deal with the burst pressure constraint. The winding thickness and angles of composite layers are chosen as the design variables. Effects of the population size and the number of generations on the optimal results are explored. The results using the adaptive genetic algorithm are also compared with those using the simple genetic algorithm and the Monte Carlo optimization method. (author)

  3. An Improvement of a Fuzzy Logic-Controlled Maximum Power Point Tracking Algorithm for Photovoltic Applications

    Directory of Open Access Journals (Sweden)

    Woonki Na

    2017-03-01

    Full Text Available This paper presents an improved maximum power point tracking (MPPT algorithm using a fuzzy logic controller (FLC in order to extract potential maximum power from photovoltaic cells. The objectives of the proposed algorithm are to improve the tracking speed, and to simultaneously solve the inherent drawbacks such as slow tracking in the conventional perturb and observe (P and O algorithm. The performances of the conventional P and O algorithm and the proposed algorithm are compared by using MATLAB/Simulink in terms of the tracking speed and steady-state oscillations. Additionally, both algorithms were experimentally validated through a digital signal processor (DSP-based controlled-boost DC-DC converter. The experimental results show that the proposed algorithm performs with a shorter tracking time, smaller output power oscillation, and higher efficiency, compared with the conventional P and O algorithm.

  4. Two Algorithms for the Detection and Tracking of Moving Vehicle Targets in Aerial Infrared Image Sequences

    Directory of Open Access Journals (Sweden)

    Yutian Cao

    2015-12-01

    Full Text Available In this paper, by analyzing the characteristics of infrared moving targets, a Symmetric Frame Differencing Target Detection algorithm based on local clustering segmentation is proposed. In consideration of the high real-time performance and accuracy of traditional symmetric differencing, this novel algorithm uses local grayscale clustering to accomplish target detection after carrying out symmetric frame differencing to locate the regions of change. In addition, the mean shift tracking algorithm is also improved to solve the problem of missed targets caused by error convergence. As a result, a kernel-based mean shift target tracking algorithm based on detection updates is also proposed. This tracking algorithm makes use of the interaction between detection and tracking to correct the tracking errors in real time and to realize robust target tracking in complex scenes. In addition, the validity, robustness and stability of the proposed algorithms are all verified by experiments on mid-infrared aerial sequences with vehicles as targets.

  5. Application of the H∞ filter in high speed turn maneuvering target tracking algorithm

    Science.gov (United States)

    Lei, Zhenda; Ma, Chuncao; Sun, Hongwei; Han, Yu

    2016-04-01

    High speed, low flying and high Maneuvering, Good methods are needed in high speed Turn maneuvering tracking algorithm. An adaptive version of the H∞ filter which has a practical real-time implementations developed in the paper and it is demonstrated that it has superior worst case performance when compared with the standard Kaman filter to target tracking. when used in turn maneuvering tracking algorithm, the new filter yields improved worst-case performance in the case of model uncertainties. The simulation results indicate that the real-tine maneuvering target turn tracking algorithm can maintain track under severe correlates maneuvers.

  6. Threshold segmentation algorithm for automatic extraction of cerebral vessels from brain magnetic resonance angiography images.

    Science.gov (United States)

    Wang, Rui; Li, Chao; Wang, Jie; Wei, Xiaoer; Li, Yuehua; Zhu, Yuemin; Zhang, Su

    2015-02-15

    Cerebrovascular segmentation plays an important role in medical diagnosis. This study was conducted to develop a threshold segmentation algorithm for automatic extraction and volumetric quantification of cerebral vessels on brain magnetic resonance angiography (MRA) images. The MRA images of 10 individuals were acquired using a 3 Tesla MR scanner (Intera-achieva SMI-2.1, Philips Medical Systems). Otsu's method was used to divide the brain MRA images into two parts, namely, foreground and background regions. To extract the cerebral vessels, we performed the threshold segmentation algorithm on the foreground region by comparing two different statistical distributions. Automatically segmented vessels were compared with manually segmented vessels. Different similarity metrics were used to assess the changes in segmentation performance as a function of a weighted parameter w used in segmentation algorithm. Varying w from 2 to 100 resulted in a false positive rate ranging from 117% to 3.21%, and a false negative rate ranging from 8.23% to 28.97%. The Dice similarity coefficient (DSC), which reflected the segmentation accuracy, initially increased and then decreased as w increased. The suggested range of values for w is [10, 20] given that the maximum DSC (e.g., DSC=0.84) was obtained within this range. The performance of our method was validated by comparing with manual segmentation. The proposed threshold segmentation method can be used to accurately and efficiently extract cerebral vessels from brain MRA images. Threshold segmentation may be used for studies focusing on three-dimensional visualization and volumetric quantification of cerebral vessels. Copyright © 2014 Elsevier B.V. All rights reserved.

  7. Algorithms for High-Speed Noninvasive Eye-Tracking System

    Science.gov (United States)

    Talukder, Ashit; Morookian, John-Michael; Lambert, James

    2010-01-01

    Two image-data-processing algorithms are essential to the successful operation of a system of electronic hardware and software that noninvasively tracks the direction of a person s gaze in real time. The system was described in High-Speed Noninvasive Eye-Tracking System (NPO-30700) NASA Tech Briefs, Vol. 31, No. 8 (August 2007), page 51. To recapitulate from the cited article: Like prior commercial noninvasive eyetracking systems, this system is based on (1) illumination of an eye by a low-power infrared light-emitting diode (LED); (2) acquisition of video images of the pupil, iris, and cornea in the reflected infrared light; (3) digitization of the images; and (4) processing the digital image data to determine the direction of gaze from the centroids of the pupil and cornea in the images. Most of the prior commercial noninvasive eyetracking systems rely on standard video cameras, which operate at frame rates of about 30 Hz. Such systems are limited to slow, full-frame operation. The video camera in the present system includes a charge-coupled-device (CCD) image detector plus electronic circuitry capable of implementing an advanced control scheme that effects readout from a small region of interest (ROI), or subwindow, of the full image. Inasmuch as the image features of interest (the cornea and pupil) typically occupy a small part of the camera frame, this ROI capability can be exploited to determine the direction of gaze at a high frame rate by reading out from the ROI that contains the cornea and pupil (but not from the rest of the image) repeatedly. One of the present algorithms exploits the ROI capability. The algorithm takes horizontal row slices and takes advantage of the symmetry of the pupil and cornea circles and of the gray-scale contrasts of the pupil and cornea with respect to other parts of the eye. The algorithm determines which horizontal image slices contain the pupil and cornea, and, on each valid slice, the end coordinates of the pupil and cornea

  8. Multi-target Particle Filter Tracking Algorithm Based on Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Liu Hong-Xia

    2014-05-01

    Full Text Available In order to improve the multi-target tracking efficiency for wireless sensor networks and solve the problem of data transmission, analyzed existing particle filter tracking algorithm, ensure that one of the core technology for wireless sensor network performance. In this paper, from the basic theory of target tracking, in-depth analysis on the basis of the principle of particle filter, based on dynamic clustering, proposed the multi-target Kalman particle filter (MEPF algorithm, through the expansion of Calman filter (EKF to generate the proposal distribution, a reduction in the required number of particles to improve the particle filter accuracy at the same time, reduce the computational complexity of target tracking algorithm, thus reducing the energy consumption. Application results show that the MEPF in the proposed algorithm can achieve better tracking of target tracking and forecasting, in a small number of particles still has good tracking accuracy.

  9. Particle tracking with iterated Kalman filters and smoothers the PMHT algorithm

    CERN Document Server

    Strandlie, A

    1999-01-01

    We introduce the Probabilistic Multi-Hypothesis Tracking (PMHT) algorithm for particle tracking in high-energy physics detectors. This algorithm has been developed recently for tracking multiple targets in clutter, and it is based on maximum likelihood estimation with help of the EM algorithm. The resulting algorithm basically consists of running several iterated and coupled Kalman filters and smoothers in parallel. It is similar to the Elastic Arms algorithm, but it possesses the additional feature of being able to take process noise into account, as for instance multiple Coulomb scattering. Herein, we review its basic properties and derive a generalized version of the algorithm by including a deterministic annealing scheme. Further developments of the algorithm in order to improve the performance are also discussed. In particular, we propose to modify the hit-to-track assignment probabilities in order to obtain competition between hits in the same detector layer. Finally, we present results of an implementa...

  10. Computationally Efficient DOA Tracking Algorithm in Monostatic MIMO Radar with Automatic Association

    Directory of Open Access Journals (Sweden)

    Huaxin Yu

    2014-01-01

    Full Text Available We consider the problem of tracking the direction of arrivals (DOA of multiple moving targets in monostatic multiple-input multiple-output (MIMO radar. A low-complexity DOA tracking algorithm in monostatic MIMO radar is proposed. The proposed algorithm obtains DOA estimation via the difference between previous and current covariance matrix of the reduced-dimension transformation signal, and it reduces the computational complexity and realizes automatic association in DOA tracking. Error analysis and Cramér-Rao lower bound (CRLB of DOA tracking are derived in the paper. The proposed algorithm not only can be regarded as an extension of array-signal-processing DOA tracking algorithm in (Zhang et al. (2008, but also is an improved version of the DOA tracking algorithm in (Zhang et al. (2008. Furthermore, the proposed algorithm has better DOA tracking performance than the DOA tracking algorithm in (Zhang et al. (2008. The simulation results demonstrate effectiveness of the proposed algorithm. Our work provides the technical support for the practical application of MIMO radar.

  11. A combined object-tracking algorithm for omni-directional vision-based AGV navigation

    Science.gov (United States)

    Yuan, Wei; Sun, Jie; Cao, Zuo-Liang; Tian, Jing; Yang, Ming

    2010-03-01

    A combined object-tracking algorithm that realizes the realtime tracking of the selected object through the omni-directional vision with a fisheye lens is presented. The new method combines the modified continuously adaptive mean shift algorithm with the Kalman filter method. With the proposed method, the object-tracking problem when the object reappears after being sheltered completely or moving out of the field of view is solved. The experimental results perform well, and the algorithm proposed here improves the robustness and accuracy of the tracking in the omni-directional vision.

  12. Relative Vessel Motion Tracking using Sensor Fusion, Aruco Markers, and MRU Sensors

    Directory of Open Access Journals (Sweden)

    Sondre Sanden Tordal

    2017-04-01

    Full Text Available This paper presents a novel approach for estimating the relative motion between two moving offshore vessels. The method is based on a sensor fusion algorithm including a vision system and two motion reference units (MRUs. The vision system makes use of the open-source computer vision library OpenCV and a cube with Aruco markers placed onto each of the cube sides. The Extended Quaternion Kalman Filter (EQKF is used for bad pose rejection for the vision system. The presented sensor fusion algorithm is based on the Indirect Feedforward Kalman Filter for error estimation. The system is self-calibrating in the sense that the Aruco cube can be placed in an arbitrary location on the secondary vessel. Experimental 6-DOF results demonstrate the accuracy and efficiency of the proposed sensor fusion method compared with the internal joint sensors of two Stewart platforms and the industrial robot. The standard deviation error was found to be 31mm or better when the Arcuo cube was placed at three different locations.

  13. Computationally Efficient DOA Tracking Algorithm in Monostatic MIMO Radar with Automatic Association

    OpenAIRE

    Huaxin Yu; Xiaofei Zhang; Xueqiang Chen; Hailang Wu

    2014-01-01

    We consider the problem of tracking the direction of arrivals (DOA) of multiple moving targets in monostatic multiple-input multiple-output (MIMO) radar. A low-complexity DOA tracking algorithm in monostatic MIMO radar is proposed. The proposed algorithm obtains DOA estimation via the difference between previous and current covariance matrix of the reduced-dimension transformation signal, and it reduces the computational complexity and realizes automatic association in DOA tracking. Error ana...

  14. The declining impact of piracy on maritime transport in the Indian Ocean: Statistical analysis of 5-year vessel tracking data

    OpenAIRE

    Vespe, Michele; Greidanus, Harm; Alvarez, Marlene Alvarez

    2015-01-01

    The analysis of the declining impact of piracy on maritime routes and vessel behaviours in the Indian Ocean is here performed using Long Range Identification and Tracking (LRIT) reports. A 5-year archive of vessel position data covering the period characterized by the highest number of attacks and the subsequent decline provides a unique source for data-driven statistical analysis that highlights changes in routing and sailing speeds. The work, besides demonstrating the value of LRIT data for...

  15. An adaptive algorithm for separating and tracking multiple directional sources in linear arrays

    Science.gov (United States)

    Ko, C. C.; Chin, Francois; Foo, S. S.

    1992-03-01

    A new algorithm for spatially filtering out, enhancing, and tracking individual directional sources in an adaptive array is proposed and investigated. In this algorithm, the sources are separated by using an adaptive beamformer whose outputs are processed by employing the LMS algorithm to track distinct sources individually. From the LMS weights employed, the source locations can be estimated and whenever significant changes in these are detected, the beamformer is updated so that its outputs will be due to different sources in the steady state. With this algorithm, the problems of look direction errors in look-direction constrained arrays and of large signal power in power inversion arrays are eliminated, and the enhancement of multiple moving sources becomes a natural process. Furthermore, because the sources are individually tracked and the beamformer is only updated occasionally, the algorithm possesses fast tracking behavior, and its implementation complexity is comparable to that of beamformer-based adaptive arrays using the LMS algorithm.

  16. A Cost-Effective Tracking Algorithm for Hypersonic Glide Vehicle Maneuver Based on Modified Aerodynamic Model

    Directory of Open Access Journals (Sweden)

    Yu Fan

    2016-10-01

    Full Text Available In order to defend the hypersonic glide vehicle (HGV, a cost-effective single-model tracking algorithm using Cubature Kalman filter (CKF is proposed in this paper based on modified aerodynamic model (MAM as process equation and radar measurement model as measurement equation. In the existing aerodynamic model, the two control variables attack angle and bank angle cannot be measured by the existing radar equipment and their control laws cannot be known by defenders. To establish the process equation, the MAM for HGV tracking is proposed by using additive white noise to model the rates of change of the two control variables. For the ease of comparison several multiple model algorithms based on CKF are presented, including interacting multiple model (IMM algorithm, adaptive grid interacting multiple model (AGIMM algorithm and hybrid grid multiple model (HGMM algorithm. The performances of these algorithms are compared and analyzed according to the simulation results. The simulation results indicate that the proposed tracking algorithm based on modified aerodynamic model has the best tracking performance with the best accuracy and least computational cost among all tracking algorithms in this paper. The proposed algorithm is cost-effective for HGV tracking.

  17. IMPLEMENTATION OF OBJECT TRACKING ALGORITHMS ON THE BASIS OF CUDA TECHNOLOGY

    Directory of Open Access Journals (Sweden)

    B. A. Zalesky

    2014-01-01

    Full Text Available A fast version of correlation algorithm to track objects on video-sequences made by a nonstabilized camcorder is presented. The algorithm is based on comparison of local correlations of the object image and regions of video-frames. The algorithm is implemented in programming technology CUDA. Application of CUDA allowed to attain real time execution of the algorithm. To improve its precision and stability, a robust version of the Kalman filter has been incorporated into the flowchart. Tests showed applicability of the algorithm to practical object tracking.

  18. Algorithm of search and track of static and moving large-scale objects

    Directory of Open Access Journals (Sweden)

    Kalyaev Anatoly

    2017-01-01

    Full Text Available We suggest an algorithm for processing of a sequence, which contains images of search and track of static and moving large-scale objects. The possible software implementation of the algorithm, based on multithread CUDA processing, is suggested. Experimental analysis of the suggested algorithm implementation is performed.

  19. An Applied Research of Decision Tree Algorithm in Track and Field Equipment Training

    Directory of Open Access Journals (Sweden)

    Liu Shaoqing

    2015-01-01

    Full Text Available This paper has conducted a study on the applications of track and field equipment training based on ID3 algorithm of decision tree model. For the selection of the elements used by decision tree, this paper can be divided into track training equipment, field events training equipment and auxiliary training equipment according to the properties of track and field equipment. The decision tree that regards track training equipment as root nodes has been obtained under the conditions of lowering computation cost through the selection of data as well as the application and optimization of ID3 algorithm model.

  20. The research of moving objects behavior detection and tracking algorithm in aerial video

    Science.gov (United States)

    Yang, Le-le; Li, Xin; Yang, Xiao-ping; Li, Dong-hui

    2015-12-01

    The article focuses on the research of moving target detection and tracking algorithm in Aerial monitoring. Study includes moving target detection, moving target behavioral analysis and Target Auto tracking. In moving target detection, the paper considering the characteristics of background subtraction and frame difference method, using background reconstruction method to accurately locate moving targets; in the analysis of the behavior of the moving object, using matlab technique shown in the binary image detection area, analyzing whether the moving objects invasion and invasion direction; In Auto Tracking moving target, A video tracking algorithm that used the prediction of object centroids based on Kalman filtering was proposed.

  1. Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks

    DEFF Research Database (Denmark)

    Huang, Zengfeng; Yi, Ke; Zhang, Qin

    2011-01-01

    $-approximation of their sum $n=\\sum_i n_i$ continuously at all times, using minimum communication. While the deterministic communication complexity of the problem is $\\Theta(k/\\eps \\cdot \\log N)$, where $N$ is the final value of $n$ when the tracking finishes, we show that with randomization, the communication cost can......We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the {\\em count-tracking} problem, where there are $k$ players, each holding a counter $n_i$ that gets incremented over time, and the goal is to track an $\\eps...

  2. Randomized algorithms for tracking distributed count, frequencies, and ranks

    DEFF Research Database (Denmark)

    Zengfeng, Huang; Ke, Yi; Zhang, Qin

    2012-01-01

    of their sum n=∑ini continuously at all times, using minimum communication. While the deterministic communication complexity of the problem is θ(k/ε • log N), where N is the final value of n when the tracking finishes, we show that with randomization, the communication cost can be reduced to θ(√k/ε • log N......We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k players, each holding a counter ni that gets incremented over time, and the goal is to track an ∑-approximation...

  3. Automatic face detection and tracking based on Adaboost with camshift algorithm

    Science.gov (United States)

    Lin, Hui; Long, JianFeng

    2011-10-01

    With the development of information technology, video surveillance is widely used in security monitoring and identity recognition. For most of pure face tracking algorithms are hard to specify the initial location and scale of face automatically, this paper proposes a fast and robust method to detect and track face by combining adaboost with camshift algorithm. At first, the location and scale of face is specified by adaboost algorithm based on Haar-like features and it will be conveyed to the initial search window automatically. Then, we apply camshift algorithm to track face. The experimental results based on OpenCV software yield good results, even in some special circumstances, such as light changing and face rapid movement. Besides, by drawing out the tracking trajectory of face movement, some abnormal behavior events can be analyzed.

  4. An Improved Wake Vortex Tracking Algorithm for Multiple Aircraft

    Science.gov (United States)

    Switzer, George F.; Proctor, Fred H.; Ahmad, Nashat N.; LimonDuparcmeur, Fanny M.

    2010-01-01

    The accurate tracking of vortex evolution from Large Eddy Simulation (LES) data is a complex and computationally intensive problem. The vortex tracking requires the analysis of very large three-dimensional and time-varying datasets. The complexity of the problem is further compounded by the fact that these vortices are embedded in a background turbulence field, and they may interact with the ground surface. Another level of complication can arise, if vortices from multiple aircrafts are simulated. This paper presents a new technique for post-processing LES data to obtain wake vortex tracks and wake intensities. The new approach isolates vortices by defining "regions of interest" (ROI) around each vortex and has the ability to identify vortex pairs from multiple aircraft. The paper describes the new methodology for tracking wake vortices and presents application of the technique for single and multiple aircraft.

  5. A novel vehicle tracking algorithm based on mean shift and active contour model in complex environment

    Science.gov (United States)

    Cai, Lei; Wang, Lin; Li, Bo; Zhang, Libao; Lv, Wen

    2017-06-01

    Vehicle tracking technology is currently one of the most active research topics in machine vision. It is an important part of intelligent transportation system. However, in theory and technology, it still faces many challenges including real-time and robustness. In video surveillance, the targets need to be detected in real-time and to be calculated accurate position for judging the motives. The contents of video sequence images and the target motion are complex, so the objects can't be expressed by a unified mathematical model. Object-tracking is defined as locating the interest moving target in each frame of a piece of video. The current tracking technology can achieve reliable results in simple environment over the target with easy identified characteristics. However, in more complex environment, it is easy to lose the target because of the mismatch between the target appearance and its dynamic model. Moreover, the target usually has a complex shape, but the tradition target tracking algorithm usually represents the tracking results by simple geometric such as rectangle or circle, so it cannot provide accurate information for the subsequent upper application. This paper combines a traditional object-tracking technology, Mean-Shift algorithm, with a kind of image segmentation algorithm, Active-Contour model, to get the outlines of objects while the tracking process and automatically handle topology changes. Meanwhile, the outline information is used to aid tracking algorithm to improve it.

  6. Multi-sensor fusion using an adaptive multi-hypothesis tracking algorithm

    NARCIS (Netherlands)

    Kester, L.J.H.M.

    2003-01-01

    The purpose of a tracking algorithm is to associate data measured by one or more (moving) sensors to moving objects in the environment. The state of these objects that can be estimated with the tracking process depends on the type of data that is provided by these sensors. It is discussed how the

  7. Invariant mass determination using the output from a specialized electron track reconstruction algorithm

    OpenAIRE

    Gjersdal, Håvard

    2008-01-01

    The Gaussian sum filter is a track reconstruction algorithm specialized on dealing with the non-Gaussian radiative energy loss of electrons. This thesis deals with invariant mass determination from the non-Gaussian track estimates produced by the Gaussian sum filter.

  8. Visual Tracking Based on an Improved Online Multiple Instance Learning Algorithm.

    Science.gov (United States)

    Wang, Li Jia; Zhang, Hua

    2016-01-01

    An improved online multiple instance learning (IMIL) for a visual tracking algorithm is proposed. In the IMIL algorithm, the importance of each instance contributing to a bag probability is with respect to their probabilities. A selection strategy based on an inner product is presented to choose weak classifier from a classifier pool, which avoids computing instance probabilities and bag probability M times. Furthermore, a feedback strategy is presented to update weak classifiers. In the feedback update strategy, different weights are assigned to the tracking result and template according to the maximum classifier score. Finally, the presented algorithm is compared with other state-of-the-art algorithms. The experimental results demonstrate that the proposed tracking algorithm runs in real-time and is robust to occlusion and appearance changes.

  9. Skeletonization algorithm-based blood vessel quantification using in vivo 3D photoacoustic imaging

    Science.gov (United States)

    Meiburger, K. M.; Nam, S. Y.; Chung, E.; Suggs, L. J.; Emelianov, S. Y.; Molinari, F.

    2016-11-01

    Blood vessels are the only system to provide nutrients and oxygen to every part of the body. Many diseases can have significant effects on blood vessel formation, so that the vascular network can be a cue to assess malicious tumor and ischemic tissues. Various imaging techniques can visualize blood vessel structure, but their applications are often constrained by either expensive costs, contrast agents, ionizing radiations, or a combination of the above. Photoacoustic imaging combines the high-contrast and spectroscopic-based specificity of optical imaging with the high spatial resolution of ultrasound imaging, and image contrast depends on optical absorption. This enables the detection of light absorbing chromophores such as hemoglobin with a greater penetration depth compared to purely optical techniques. We present here a skeletonization algorithm for vessel architectural analysis using non-invasive photoacoustic 3D images acquired without the administration of any exogenous contrast agents. 3D photoacoustic images were acquired on rats (n  =  4) in two different time points: before and after a burn surgery. A skeletonization technique based on the application of a vesselness filter and medial axis extraction is proposed to extract the vessel structure from the image data and six vascular parameters (number of vascular trees (NT), vascular density (VD), number of branches (NB), 2D distance metric (DM), inflection count metric (ICM), and sum of angles metric (SOAM)) were calculated from the skeleton. The parameters were compared (1) in locations with and without the burn wound on the same day and (2) in the same anatomic location before (control) and after the burn surgery. Four out of the six descriptors were statistically different (VD, NB, DM, ICM, p  <  0.05) when comparing two anatomic locations on the same day and when considering the same anatomic location at two separate times (i.e. before and after burn surgery). The study demonstrates an

  10. Real time tracking with a silicon telescope prototype using the "artificial retina" algorithm

    Science.gov (United States)

    Abba, A.; Bedeschi, F.; Caponio, F.; Cenci, R.; Citterio, M.; Coelli, S.; Fu, J.; Geraci, A.; Grizzuti, M.; Lusardi, N.; Marino, P.; Monti, M.; Morello, M. J.; Neri, N.; Ninci, D.; Petruzzo, M.; Piucci, A.; Punzi, G.; Ristori, L.; Spinella, F.; Stracka, S.; Tonelli, D.; Walsh, J.

    2016-07-01

    We present the first prototype of a silicon tracker using the artificial retina algorithm for fast track finding. The algorithm is inspired by the neurobiological mechanism of recognition of edges in mammals visual cortex. It is based on extensive parallelization and is implemented on commercial FPGAs allowing us to reconstruct real time tracks with offline-like quality and < 1 μs latencies. The practical device consists of a telescope with 8 single-sided silicon strip sensors and custom DAQ boards equipped with Xilinx Kintex 7 FPGAs that perform the readout of the sensors and the track reconstruction in real time.

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

  12. A Planning Algorithm of a Gimballed EO/IR Sensor for Multi Target Tracking

    OpenAIRE

    Skoglar, Per

    2009-01-01

    This report proposes an algorithm for planning the aiming direction of a vision sensor with limited field-of-view for tracking of multiple targets. The sensor is mounted in an actuated gimbal on an unmanned aerial vehicle (UAV). Dynamic constraints of the gimbal are included implicitly and a genetic algorithm is used to solve the optimization problem.

  13. Parallel Algorithms for Online Track Finding for the \\bar{{\\rm{P}}}ANDA Experiment at FAIR

    Science.gov (United States)

    Bianchi, L.; Herten, A.; Ritman, J.; Stockmanns, T.; PANDA Collaboration

    2017-10-01

    \\bar{{{P}}}ANDA is a future hadron and nuclear physics experiment at the FAIR facility in construction in Darmstadt, Germany. Unlike the majority of current experiments, \\bar{{{P}}}ANDA’s strategy for data acquisition is based on online event reconstruction from free-streaming data, performed in real time entirely by software algorithms using global detector information. This paper reports on the status of the development of algorithms for the reconstruction of charged particle tracks, targeted towards online data processing applications, designed for execution on data-parallel processors such as GPUs (Graphic Processing Units). Two parallel algorithms for track finding, derived from the Circle Hough algorithm, are being developed to extend the parallelism to all stages of the algorithm. The concepts of the algorithms are described, along with preliminary results and considerations about their implementations and performance.

  14. Kalman Filter Predictor and Initialization Algorithm for PRI Tracking

    National Research Council Canada - National Science Library

    Hock, Melinda

    1998-01-01

    .... The algorithm uses a Kalman filter for prediction combined with a preprocessing routine to determine the period of the stagger sequence and to construct an uncorrupted data set for Kalman filter initialization...

  15. The research on algorithms for optoelectronic tracking servo control systems

    Science.gov (United States)

    Zhu, Qi-Hai; Zhao, Chang-Ming; Zhu, Zheng; Li, Kun

    2016-10-01

    The photoelectric servo control system based on PC controllers is mainly used to control the speed and position of the load. This paper analyzed the mathematical modeling and the system identification of the servo system. In the aspect of the control algorithm, the IP regulator, the fuzzy PID, the Active Disturbance Rejection Control (ADRC) and the adaptive algorithms were compared and analyzed. The PI-P control algorithm was proposed in this paper, which not only has the advantages of the PI regulator that can be quickly saturated, but also overcomes the shortcomings of the IP regulator. The control system has a good starting performance and the anti-load ability in a wide range. Experimental results show that the system has good performance under the guarantee of the PI-P control algorithm.

  16. Multisensor Processing Algorithms for Underwater Dipole Localization and Tracking Using MEMS Artificial Lateral-Line Sensors

    Directory of Open Access Journals (Sweden)

    Jones Douglas L

    2006-01-01

    Full Text Available An engineered artificial lateral-line system has been recently developed, consisting of a 16-element array of finely spaced MEMS hot-wire flow sensors. This represents a new class of underwater flow sensing instruments and necessitates the development of rapid, efficient, and robust signal processing algorithms. In this paper, we report on the development and implementation of a set of algorithms that assist in the localization and tracking of vibrational dipole sources underwater. Using these algorithms, accurate tracking of the trajectory of a moving dipole source has been demonstrated successfully.

  17. IMPLEMENTATION OF IMAGE PROCESSING ALGORITHMS AND GLVQ TO TRACK AN OBJECT USING AR.DRONE CAMERA

    Directory of Open Access Journals (Sweden)

    Muhammad Nanda Kurniawan

    2014-08-01

    Full Text Available Abstract In this research, Parrot AR.Drone as an Unmanned Aerial Vehicle (UAV was used to track an object from above. Development of this system utilized some functions from OpenCV library and Robot Operating System (ROS. Techniques that were implemented in the system are image processing al-gorithm (Centroid-Contour Distance (CCD, feature extraction algorithm (Principal Component Analysis (PCA and an artificial neural network algorithm (Generalized Learning Vector Quantization (GLVQ. The final result of this research is a program for AR.Drone to track a moving object on the floor in fast response time that is under 1 second.

  18. IMPLEMENTATION OF IMAGE PROCESSING ALGORITHMS AND GLVQ TO TRACK AN OBJECT USING AR.DRONE CAMERA

    OpenAIRE

    Muhammad Nanda Kurniawan; Didit Widiyanto

    2014-01-01

    Abstract In this research, Parrot AR.Drone as an Unmanned Aerial Vehicle (UAV) was used to track an object from above. Development of this system utilized some functions from OpenCV library and Robot Operating System (ROS). Techniques that were implemented in the system are image processing al-gorithm (Centroid-Contour Distance (CCD)), feature extraction algorithm (Principal Component Analysis (PCA)) and an artificial neural network algorithm (Generalized Learning Vector Quantization (GLV...

  19. Implementation of Image Processing Algorithms and Glvq to Track an Object Using Ar.drone Camera

    OpenAIRE

    Kurniawan, Muhammad Nanda; Widiyanto, Didit

    2014-01-01

    In this research, Parrot AR.Drone as an Unmanned Aerial Vehicle (UAV) was used to track an object from above. Development of this system utilized some functions from OpenCV library and Robot Operating System (ROS). Techniques that were implemented in the system are image processing al-gorithm (Centroid-Contour Distance (CCD)), feature extraction algorithm (Principal Component Analysis (PCA)) and an artificial neural network algorithm (Generalized Learning Vector Quantization (GLVQ)). The fina...

  20. Spacecraft VLBI and Doppler tracking : Algorithms and implementation

    NARCIS (Netherlands)

    Duev, D.A.; Molera Calvés, G.; Pogrebenko, S.V.; Gurvits, L.I.; Cimó, G.; Bocanegra Bahamon, T.

    2012-01-01

    Aims. We present the results of several multi-station Very Long Baseline Interferometry (VLBI) experiments conducted with the ESA spacecraft Venus Express as a target. To determine the true capabilities of VLBI tracking for future planetary missions in the solar system, it is necessary to

  1. Online Tracking Algorithms on GPUs for the P̅ANDA Experiment at FAIR

    Science.gov (United States)

    Bianchi, L.; Herten, A.; Ritman, J.; Stockmanns, T.; Adinetz, A.; Kraus, J.; Pleiter, D.

    2015-12-01

    P̅ANDA is a future hadron and nuclear physics experiment at the FAIR facility in construction in Darmstadt, Germany. In contrast to the majority of current experiments, PANDA's strategy for data acquisition is based on event reconstruction from free-streaming data, performed in real time entirely by software algorithms using global detector information. This paper reports the status of the development of algorithms for the reconstruction of charged particle tracks, optimized online data processing applications, using General-Purpose Graphic Processing Units (GPU). Two algorithms for trackfinding, the Triplet Finder and the Circle Hough, are described, and details of their GPU implementations are highlighted. Average track reconstruction times of less than 100 ns are obtained running the Triplet Finder on state-of- the-art GPU cards. In addition, a proof-of-concept system for the dispatch of data to tracking algorithms using Message Queues is presented.

  2. An efficient Lagrangean relaxation-based object tracking algorithm in wireless sensor networks.

    Science.gov (United States)

    Lin, Frank Yeong-Sung; Lee, Cheng-Ta

    2010-01-01

    In this paper we propose an energy-efficient object tracking algorithm in wireless sensor networks (WSNs). Such sensor networks have to be designed to achieve energy-efficient object tracking for any given arbitrary topology. We consider in particular the bi-directional moving objects with given frequencies for each pair of sensor nodes and link transmission cost. This problem is formulated as a 0/1 integer-programming problem. A Lagrangean relaxation-based (LR-based) heuristic algorithm is proposed for solving the optimization problem. Experimental results showed that the proposed algorithm achieves near optimization in energy-efficient object tracking. Furthermore, the algorithm is very efficient and scalable in terms of the solution time.

  3. Artificial Neural Network In Maximum Power Point Tracking Algorithm Of Photovoltaic Systems

    Directory of Open Access Journals (Sweden)

    Modestas Pikutis

    2014-05-01

    Full Text Available Scientists are looking for ways to improve the efficiency of solar cells all the time. The efficiency of solar cells which are available to the general public is up to 20%. Part of the solar energy is unused and a capacity of solar power plant is significantly reduced – if slow controller or controller which cannot stay at maximum power point of solar modules is used. Various algorithms of maximum power point tracking were created, but mostly algorithms are slow or make mistakes. In the literature more and more oftenartificial neural networks (ANN in maximum power point tracking process are mentioned, in order to improve performance of the controller. Self-learner artificial neural network and IncCond algorithm were used for maximum power point tracking in created solar power plant model. The algorithm for control was created. Solar power plant model is implemented in Matlab/Simulink environment.

  4. Lane Tracking with Omnidirectional Cameras: Algorithms and Evaluation

    Directory of Open Access Journals (Sweden)

    Cheng ShinkoYuanhsien

    2007-01-01

    Full Text Available With a panoramic view of the scene, a single omnidirectional camera can monitor the 360-degree surround of the vehicle or monitor the interior and exterior of the vehicle at the same time. We investigate problems associated with integrating driver assistance functionalities that have been designed for rectilinear cameras with a single omnidirectional camera instead. Specifically, omnidirectional cameras have been shown effective in determining head gaze orientation from within a vehicle. We examine the issues involved in integrating lane tracking functions using the same omnidirectional camera, which provide a view of both the driver and the road ahead of the vehicle. We present analysis on the impact of the omnidirectional camera's reduced image resolution on lane tracking accuracy, as a consequence of gaining the expansive view. And to do so, we present Omni-VioLET, a modified implementation of the vision-based lane estimation and tracking system (VioLET, and conduct a systematic performance evaluation of both lane-trackers operating on monocular rectilinear images and omnidirectional images. We are able to show a performance comparison of the lane tracking from Omni-VioLET and Recti-VioLET with ground truth using images captured along the same freeway road in a specified course. The results are surprising: with 1/10th the number of pixels representing the same space and about 1/3rd the horizontal image resolution as a rectilinear image of the same road, the omnidirectional camera implementation results in only three times the amount the mean absolute error in tracking the left lane boundary position.

  5. Lane Tracking with Omnidirectional Cameras: Algorithms and Evaluation

    Directory of Open Access Journals (Sweden)

    Shinko Yuanhsien Cheng

    2007-09-01

    Full Text Available With a panoramic view of the scene, a single omnidirectional camera can monitor the 360-degree surround of the vehicle or monitor the interior and exterior of the vehicle at the same time. We investigate problems associated with integrating driver assistance functionalities that have been designed for rectilinear cameras with a single omnidirectional camera instead. Specifically, omnidirectional cameras have been shown effective in determining head gaze orientation from within a vehicle. We examine the issues involved in integrating lane tracking functions using the same omnidirectional camera, which provide a view of both the driver and the road ahead of the vehicle. We present analysis on the impact of the omnidirectional camera's reduced image resolution on lane tracking accuracy, as a consequence of gaining the expansive view. And to do so, we present Omni-VioLET, a modified implementation of the vision-based lane estimation and tracking system (VioLET, and conduct a systematic performance evaluation of both lane-trackers operating on monocular rectilinear images and omnidirectional images. We are able to show a performance comparison of the lane tracking from Omni-VioLET and Recti-VioLET with ground truth using images captured along the same freeway road in a specified course. The results are surprising: with 1/10th the number of pixels representing the same space and about 1/3rd the horizontal image resolution as a rectilinear image of the same road, the omnidirectional camera implementation results in only three times the amount the mean absolute error in tracking the left lane boundary position.

  6. Simulation on Vessel Intelligent Collision Avoidance Based on Artificial Fish Swarm Algorithm

    Directory of Open Access Journals (Sweden)

    Li Weifeng

    2016-10-01

    Full Text Available TAs the rapid development of the ship equipments and navigation technology, vessel intelligent collision avoidance theory was researched world widely. Meantime, more and more ship intelligent collision avoidance products are put into use. It not only makes the ship much safer, but also lighten the officers work intensity and improve the ship’s economy. The paper based on the International Regulation for Preventing Collision at sea and ship domain theories, with the ship proceeding distance when collision avoidance as the objective function, through the artificial fish swarm algorithm to optimize the collision avoidance path, and finally simulates overtaking situation, crossing situation and head-on situation three classic meeting situation of ships on the sea by VC++ computer language. Calculation and simulation results are basically consistent with the actual situation which certifies that its validity.

  7. A novel validation algorithm allows for automated cell tracking and the extraction of biologically meaningful parameters.

    Directory of Open Access Journals (Sweden)

    Daniel H Rapoport

    Full Text Available Automated microscopy is currently the only method to non-invasively and label-free observe complex multi-cellular processes, such as cell migration, cell cycle, and cell differentiation. Extracting biological information from a time-series of micrographs requires each cell to be recognized and followed through sequential microscopic snapshots. Although recent attempts to automatize this process resulted in ever improving cell detection rates, manual identification of identical cells is still the most reliable technique. However, its tedious and subjective nature prevented tracking from becoming a standardized tool for the investigation of cell cultures. Here, we present a novel method to accomplish automated cell tracking with a reliability comparable to manual tracking. Previously, automated cell tracking could not rival the reliability of manual tracking because, in contrast to the human way of solving this task, none of the algorithms had an independent quality control mechanism; they missed validation. Thus, instead of trying to improve the cell detection or tracking rates, we proceeded from the idea to automatically inspect the tracking results and accept only those of high trustworthiness, while rejecting all other results. This validation algorithm works independently of the quality of cell detection and tracking through a systematic search for tracking errors. It is based only on very general assumptions about the spatiotemporal contiguity of cell paths. While traditional tracking often aims to yield genealogic information about single cells, the natural outcome of a validated cell tracking algorithm turns out to be a set of complete, but often unconnected cell paths, i.e. records of cells from mitosis to mitosis. This is a consequence of the fact that the validation algorithm takes complete paths as the unit of rejection/acceptance. The resulting set of complete paths can be used to automatically extract important biological parameters

  8. Space debris tracking based on fuzzy running Gaussian average adaptive particle filter track-before-detect algorithm

    Science.gov (United States)

    Torteeka, Peerapong; Gao, Peng-Qi; Shen, Ming; Guo, Xiao-Zhang; Yang, Da-Tao; Yu, Huan-Huan; Zhou, Wei-Ping; Zhao, You

    2017-02-01

    Although tracking with a passive optical telescope is a powerful technique for space debris observation, it is limited by its sensitivity to dynamic background noise. Traditionally, in the field of astronomy, static background subtraction based on a median image technique has been used to extract moving space objects prior to the tracking operation, as this is computationally efficient. The main disadvantage of this technique is that it is not robust to variable illumination conditions. In this article, we propose an approach for tracking small and dim space debris in the context of a dynamic background via one of the optical telescopes that is part of the space surveillance network project, named the Asia-Pacific ground-based Optical Space Observation System or APOSOS. The approach combines a fuzzy running Gaussian average for robust moving-object extraction with dim-target tracking using a particle-filter-based track-before-detect method. The performance of the proposed algorithm is experimentally evaluated, and the results show that the scheme achieves a satisfactory level of accuracy for space debris tracking.

  9. Simulation of video sequences for an accurate evaluation of tracking algorithms on complex scenes

    Science.gov (United States)

    Dubreu, Christine; Manzanera, Antoine; Bohain, Eric

    2008-04-01

    As target tracking is arousing more and more interest, the necessity to reliably assess tracking algorithms in any conditions is becoming essential. The evaluation of such algorithms requires a database of sequences representative of the whole range of conditions in which the tracking system is likely to operate, together with its associated ground truth. However, building such a database with real sequences, and collecting the associated ground truth appears to be hardly possible and very time-consuming. Therefore, more and more often, synthetic sequences are generated by complex and heavy simulation platforms to evaluate the performance of tracking algorithms. Some methods have also been proposed using simple synthetic sequences generated without such complex simulation platforms. These sequences are generated from a finite number of discriminating parameters, and are statistically representative, as regards these parameters, of real sequences. They are very simple and not photorealistic, but can be reliably used for low-level tracking algorithms evaluation in any operating conditions. The aim of this paper is to assess the reliability of these non-photorealistic synthetic sequences for evaluation of tracking systems on complex-textured objects, and to show how the number of parameters can be increased to synthesize more elaborated scenes and deal with more complex dynamics, including occlusions and three-dimensional deformations.

  10. An Improved Fast Compressive Tracking Algorithm Based on Online Random Forest Classifier

    Directory of Open Access Journals (Sweden)

    Xiong Jintao

    2016-01-01

    Full Text Available The fast compressive tracking (FCT algorithm is a simple and efficient algorithm, which is proposed in recent years. But, it is difficult to deal with the factors such as occlusion, appearance changes, pose variation, etc in processing. The reasons are that, Firstly, even if the naive Bayes classifier is fast in training, it is not robust concerning the noise. Secondly, the parameters are required to vary with the unique environment for accurate tracking. In this paper, we propose an improved fast compressive tracking algorithm based on online random forest (FCT-ORF for robust visual tracking. Firstly, we combine ideas with the adaptive compressive sensing theory regarding the weighted random projection to exploit both local and discriminative information of the object. The second reason is the online random forest classifier for online tracking which is demonstrated with more robust to the noise adaptively and high computational efficiency. The experimental results show that the algorithm we have proposed has a better performance in the field of occlusion, appearance changes, and pose variation than the fast compressive tracking algorithm’s contribution.

  11. Lightning Jump Algorithm and Relation to Thunderstorm Cell Tracking, GLM Proxy and Other Meteorological Measurements

    Science.gov (United States)

    Schultz, Christopher J.; Carey, Lawrence D.; Cecil, Daniel J.; Bateman, Monte

    2012-01-01

    The lightning jump algorithm has a robust history in correlating upward trends in lightning to severe and hazardous weather occurrence. The algorithm uses the correlation between the physical principles that govern an updraft's ability to produce microphysical and kinematic conditions conducive for electrification and its role in the development of severe weather conditions. Recent work has demonstrated that the lightning jump algorithm concept holds significant promise in the operational realm, aiding in the identification of thunderstorms that have potential to produce severe or hazardous weather. However, a large amount of work still needs to be completed in spite of these positive results. The total lightning jump algorithm is not a stand-alone concept that can be used independent of other meteorological measurements, parameters, and techniques. For example, the algorithm is highly dependent upon thunderstorm tracking to build lightning histories on convective cells. Current tracking methods show that thunderstorm cell tracking is most reliable and cell histories are most accurate when radar information is incorporated with lightning data. In the absence of radar data, the cell tracking is a bit less reliable but the value added by the lightning information is much greater. For optimal application, the algorithm should be integrated with other measurements that assess storm scale properties (e.g., satellite, radar). Therefore, the recent focus of this research effort has been assessing the lightning jump's relation to thunderstorm tracking, meteorological parameters, and its potential uses in operational meteorology. Furthermore, the algorithm must be tailored for the optically-based GOES-R Geostationary Lightning Mapper (GLM), as what has been observed using Very High Frequency Lightning Mapping Array (VHF LMA) measurements will not exactly translate to what will be observed by GLM due to resolution and other instrument differences. Herein, we present some of

  12. A ridge tracking algorithm and error estimate for efficient computation of Lagrangian coherent structures

    Science.gov (United States)

    Lipinski, Doug; Mohseni, Kamran

    2010-03-01

    A ridge tracking algorithm for the computation and extraction of Lagrangian coherent structures (LCS) is developed. This algorithm takes advantage of the spatial coherence of LCS by tracking the ridges which form LCS to avoid unnecessary computations away from the ridges. We also make use of the temporal coherence of LCS by approximating the time dependent motion of the LCS with passive tracer particles. To justify this approximation, we provide an estimate of the difference between the motion of the LCS and that of tracer particles which begin on the LCS. In addition to the speedup in computational time, the ridge tracking algorithm uses less memory and results in smaller output files than the standard LCS algorithm. Finally, we apply our ridge tracking algorithm to two test cases, an analytically defined double gyre as well as the more complicated example of the numerical simulation of a swimming jellyfish. In our test cases, we find up to a 35 times speedup when compared with the standard LCS algorithm.

  13. Enhanced object-based tracking algorithm for convective rain storms and cells

    Science.gov (United States)

    Muñoz, Carlos; Wang, Li-Pen; Willems, Patrick

    2018-03-01

    This paper proposes a new object-based storm tracking algorithm, based upon TITAN (Thunderstorm Identification, Tracking, Analysis and Nowcasting). TITAN is a widely-used convective storm tracking algorithm but has limitations in handling small-scale yet high-intensity storm entities due to its single-threshold identification approach. It also has difficulties to effectively track fast-moving storms because of the employed matching approach that largely relies on the overlapping areas between successive storm entities. To address these deficiencies, a number of modifications are proposed and tested in this paper. These include a two-stage multi-threshold storm identification, a new formulation for characterizing storm's physical features, and an enhanced matching technique in synergy with an optical-flow storm field tracker, as well as, according to these modifications, a more complex merging and splitting scheme. High-resolution (5-min and 529-m) radar reflectivity data for 18 storm events over Belgium are used to calibrate and evaluate the algorithm. The performance of the proposed algorithm is compared with that of the original TITAN. The results suggest that the proposed algorithm can better isolate and match convective rainfall entities, as well as to provide more reliable and detailed motion estimates. Furthermore, the improvement is found to be more significant for higher rainfall intensities. The new algorithm has the potential to serve as a basis for further applications, such as storm nowcasting and long-term stochastic spatial and temporal rainfall generation.

  14. The new approach for infrared target tracking based on the particle filter algorithm

    Science.gov (United States)

    Sun, Hang; Han, Hong-xia

    2011-08-01

    Target tracking on the complex background in the infrared image sequence is hot research field. It provides the important basis in some fields such as video monitoring, precision, and video compression human-computer interaction. As a typical algorithms in the target tracking framework based on filtering and data connection, the particle filter with non-parameter estimation characteristic have ability to deal with nonlinear and non-Gaussian problems so it were widely used. There are various forms of density in the particle filter algorithm to make it valid when target occlusion occurred or recover tracking back from failure in track procedure, but in order to capture the change of the state space, it need a certain amount of particles to ensure samples is enough, and this number will increase in accompany with dimension and increase exponentially, this led to the increased amount of calculation is presented. In this paper particle filter algorithm and the Mean shift will be combined. Aiming at deficiencies of the classic mean shift Tracking algorithm easily trapped into local minima and Unable to get global optimal under the complex background. From these two perspectives that "adaptive multiple information fusion" and "with particle filter framework combining", we expand the classic Mean Shift tracking framework .Based on the previous perspective, we proposed an improved Mean Shift infrared target tracking algorithm based on multiple information fusion. In the analysis of the infrared characteristics of target basis, Algorithm firstly extracted target gray and edge character and Proposed to guide the above two characteristics by the moving of the target information thus we can get new sports guide grayscale characteristics and motion guide border feature. Then proposes a new adaptive fusion mechanism, used these two new information adaptive to integrate into the Mean Shift tracking framework. Finally we designed a kind of automatic target model updating strategy

  15. GPU-Based Tracking Algorithms for the ATLAS High-Level Trigger

    CERN Document Server

    Emeliyanov, D; The ATLAS collaboration

    2012-01-01

    Results on the performance and viability of data-parallel algorithms on Graphics Processing Units (GPUs) in the ATLAS Level 2 trigger system are presented. We describe the existing trigger data preparation and track reconstruction algorithms, motivation for their optimization, GPU-parallelized versions of these algorithms, and a "client-server" solution for hybrid CPU/GPU event processing used for integration of the GPU-oriented algorithms into existing ATLAS trigger software. The resulting speed-up of event processing times obtained with high-luminosity simulated data is presented and discussed.

  16. An Extended Kalman Filter-Based Attitude Tracking Algorithm for Star Sensors

    Science.gov (United States)

    Li, Jian; Wei, Xinguo; Zhang, Guangjun

    2017-01-01

    Efficiency and reliability are key issues when a star sensor operates in tracking mode. In the case of high attitude dynamics, the performance of existing attitude tracking algorithms degenerates rapidly. In this paper an extended Kalman filtering-based attitude tracking algorithm is presented. The star sensor is modeled as a nonlinear stochastic system with the state estimate providing the three degree-of-freedom attitude quaternion and angular velocity. The star positions in the star image are predicted and measured to estimate the optimal attitude. Furthermore, all the cataloged stars observed in the sensor field-of-view according the predicted image motion are accessed using a catalog partition table to speed up the tracking, called star mapping. Software simulation and night-sky experiment are performed to validate the efficiency and reliability of the proposed method. PMID:28825684

  17. An Extended Kalman Filter-Based Attitude Tracking Algorithm for Star Sensors.

    Science.gov (United States)

    Li, Jian; Wei, Xinguo; Zhang, Guangjun

    2017-08-21

    Efficiency and reliability are key issues when a star sensor operates in tracking mode. In the case of high attitude dynamics, the performance of existing attitude tracking algorithms degenerates rapidly. In this paper an extended Kalman filtering-based attitude tracking algorithm is presented. The star sensor is modeled as a nonlinear stochastic system with the state estimate providing the three degree-of-freedom attitude quaternion and angular velocity. The star positions in the star image are predicted and measured to estimate the optimal attitude. Furthermore, all the cataloged stars observed in the sensor field-of-view according the predicted image motion are accessed using a catalog partition table to speed up the tracking, called star mapping. Software simulation and night-sky experiment are performed to validate the efficiency and reliability of the proposed method.

  18. Tracking Positioning Algorithm for Direction of Arrival Based on Direction Lock Loop

    Directory of Open Access Journals (Sweden)

    Xiu-Zhi Cheng

    2015-06-01

    Full Text Available In order to solve the problem of poor real-time performance, low accuracy and high computational complexity in the traditional process of locating and tracking of Direction of Arrival (DOA of moving targets, this paper proposes a DOA algorithm based on the Direction Lock Loop (DILL which adopts Lock Loop structure to realize the estimation and location of DOA and can adjust the direction automatically along with the changes of a signal’s angular variation to track the position of the signal. Meanwhile, to reduce the influence of nonlinearity and noise on its performance, the UKF filter is designed for eliminating interference of the estimated target signal to improve accuracy of the signal tracking and stability of the system. Simulation results prove that the algorithm can not only get a high resolution DOA estimate signal, but can also locate and track multiple mobile targets effectively with enhanced accuracy, efficiency and stability.

  19. A parallelization scheme of the periodic signals tracking algorithm for isochronous mass spectrometry on GPUs

    Science.gov (United States)

    Chen, R. J.; Wang, M.; Yan, X. L.; Yang, Q.; Lam, Y. H.; Yang, L.; Zhang, Y. H.

    2017-12-01

    The periodic signals tracking algorithm has been used to determine the revolution times of ions stored in storage rings in isochronous mass spectrometry (IMS) experiments. It has been a challenge to perform real-time data analysis by using the periodic signals tracking algorithm in the IMS experiments. In this paper, a parallelization scheme of the periodic signals tracking algorithm is introduced and a new program is developed. The computing time of data analysis can be reduced by a factor of ∼71 and of ∼346 by using our new program on Tesla C1060 GPU and Tesla K20c GPU, compared to using old program on Xeon E5540 CPU. We succeed in performing real-time data analysis for the IMS experiments by using the new program on Tesla K20c GPU.

  20. A hand tracking algorithm with particle filter and improved GVF snake model

    Science.gov (United States)

    Sun, Yi-qi; Wu, Ai-guo; Dong, Na; Shao, Yi-zhe

    2017-07-01

    To solve the problem that the accurate information of hand cannot be obtained by particle filter, a hand tracking algorithm based on particle filter combined with skin-color adaptive gradient vector flow (GVF) snake model is proposed. Adaptive GVF and skin color adaptive external guidance force are introduced to the traditional GVF snake model, guiding the curve to quickly converge to the deep concave region of hand contour and obtaining the complex hand contour accurately. This algorithm realizes a real-time correction of the particle filter parameters, avoiding the particle drift phenomenon. Experimental results show that the proposed algorithm can reduce the root mean square error of the hand tracking by 53%, and improve the accuracy of hand tracking in the case of complex and moving background, even with a large range of occlusion.

  1. Multi-User Identification-Based Eye-Tracking Algorithm Using Position Estimation

    Directory of Open Access Journals (Sweden)

    Suk-Ju Kang

    2016-12-01

    Full Text Available This paper proposes a new multi-user eye-tracking algorithm using position estimation. Conventional eye-tracking algorithms are typically suitable only for a single user, and thereby cannot be used for a multi-user system. Even though they can be used to track the eyes of multiple users, their detection accuracy is low and they cannot identify multiple users individually. The proposed algorithm solves these problems and enhances the detection accuracy. Specifically, the proposed algorithm adopts a classifier to detect faces for the red, green, and blue (RGB and depth images. Then, it calculates features based on the histogram of the oriented gradient for the detected facial region to identify multiple users, and selects the template that best matches the users from a pre-determined face database. Finally, the proposed algorithm extracts the final eye positions based on anatomical proportions. Simulation results show that the proposed algorithm improved the average F1 score by up to 0.490, compared with benchmark algorithms.

  2. The implementation of an automated tracking algorithm for the track detection of migratory anticyclones affecting the Mediterranean

    Science.gov (United States)

    Hatzaki, Maria; Flocas, Elena A.; Simmonds, Ian; Kouroutzoglou, John; Keay, Kevin; Rudeva, Irina

    2013-04-01

    Migratory cyclones and anticyclones mainly account for the short-term weather variations in extra-tropical regions. By contrast to cyclones that have drawn major scientific attention due to their direct link to active weather and precipitation, climatological studies on anticyclones are limited, even though they also are associated with extreme weather phenomena and play an important role in global and regional climate. This is especially true for the Mediterranean, a region particularly vulnerable to climate change, and the little research which has been done is essentially confined to the manual analysis of synoptic charts. For the construction of a comprehensive climatology of migratory anticyclonic systems in the Mediterranean using an objective methodology, the Melbourne University automatic tracking algorithm is applied, based to the ERA-Interim reanalysis mean sea level pressure database. The algorithm's reliability in accurately capturing the weather patterns and synoptic climatology of the transient activity has been widely proven. This algorithm has been extensively applied for cyclone studies worldwide and it has been also successfully applied for the Mediterranean, though its use for anticyclone tracking is limited to the Southern Hemisphere. In this study the performance of the tracking algorithm under different data resolutions and different choices of parameter settings in the scheme is examined. Our focus is on the appropriate modification of the algorithm in order to efficiently capture the individual characteristics of the anticyclonic tracks in the Mediterranean, a closed basin with complex topography. We show that the number of the detected anticyclonic centers and the resulting tracks largely depend upon the data resolution and the search radius. We also find that different scale anticyclones and secondary centers that lie within larger anticyclone structures can be adequately represented; this is important, since the extensions of major

  3. 3D head pose estimation and tracking using particle filtering and ICP algorithm

    KAUST Repository

    Ben Ghorbel, Mahdi

    2010-01-01

    This paper addresses the issue of 3D head pose estimation and tracking. Existing approaches generally need huge database, training procedure, manual initialization or use face feature extraction manually extracted. We propose a framework for estimating the 3D head pose in its fine level and tracking it continuously across multiple Degrees of Freedom (DOF) based on ICP and particle filtering. We propose to approach the problem, using 3D computational techniques, by aligning a face model to the 3D dense estimation computed by a stereo vision method, and propose a particle filter algorithm to refine and track the posteriori estimate of the position of the face. This work comes with two contributions: the first concerns the alignment part where we propose an extended ICP algorithm using an anisotropic scale transformation. The second contribution concerns the tracking part. We propose the use of the particle filtering algorithm and propose to constrain the search space using ICP algorithm in the propagation step. The results show that the system is able to fit and track the head properly, and keeps accurate the results on new individuals without a manual adaptation or training. © Springer-Verlag Berlin Heidelberg 2010.

  4. Carrier tracking algorithm based on joint acquisition of frequency locked loop and phase locked loop

    Directory of Open Access Journals (Sweden)

    Gao Kang

    2017-01-01

    Full Text Available Aiming at the problem of frequency step in the frequency lock loop (FLL - phase lock loop (PLL carrier tracking algorithm’s conversion state, presenting an improved algorithm: PLL and FLL joint acquisition to replace the single FLL acquires frequency, and deduce the loop state transition threshold. The simulation results show that the improved algorithm is more stable in the conversion process, and the loop performance is optimized. When the SNR is -10dB, and has the acceleration rate, the tracking loop does not have a frequency step at the time of conversion, achieving the design purpose.

  5. Path Tracking for Unmanned Ground Vehicle Navigation: Implementation and Adaptation of the Pure Pursuit Algorithm

    Science.gov (United States)

    2005-12-01

    robotic path tracking for Ackerman steered vehicles and presents results of implementation and adaptation of the Pure Pursuit algorithm at Defence R&D...Pursuit is useful for a wide variety of robotic applications. iv DRDC Suffield TM 2005-224 Future Work: The stability of the algorithm still...pour la défense Canada – Suffield : 1. Comme dispositif de poursuite de parcours visant à poursuivre une ligne droite entre les points de

  6. Through-Wall Multiple Targets Vital Signs Tracking Based on VMD Algorithm

    Directory of Open Access Journals (Sweden)

    Jiaming Yan

    2016-08-01

    Full Text Available Targets located at the same distance are easily neglected in most through-wall multiple targets detecting applications which use the single-input single-output (SISO ultra-wideband (UWB radar system. In this paper, a novel multiple targets vital signs tracking algorithm for through-wall detection using SISO UWB radar has been proposed. Taking advantage of the high-resolution decomposition of the Variational Mode Decomposition (VMD based algorithm, the respiration signals of different targets can be decomposed into different sub-signals, and then, we can track the time-varying respiration signals accurately when human targets located in the same distance. Intensive evaluation has been conducted to show the effectiveness of our scheme with a 0.15 m thick concrete brick wall. Constant, piecewise-constant and time-varying vital signs could be separated and tracked successfully with the proposed VMD based algorithm for two targets, even up to three targets. For the multiple targets’ vital signs tracking issues like urban search and rescue missions, our algorithm has superior capability in most detection applications.

  7. Tracking Problem Solving by Multivariate Pattern Analysis and Hidden Markov Model Algorithms

    Science.gov (United States)

    Anderson, John R.

    2012-01-01

    Multivariate pattern analysis can be combined with Hidden Markov Model algorithms to track the second-by-second thinking as people solve complex problems. Two applications of this methodology are illustrated with a data set taken from children as they interacted with an intelligent tutoring system for algebra. The first "mind reading" application…

  8. A stand-alone track reconstruction algorithm for the scintillating fibre tracker at the LHCb upgrade

    CERN Multimedia

    Quagliani, Renato

    2017-01-01

    The LHCb upgrade detector project foresees the presence of a scintillating fiber tracker (SciFi) to be used during the LHC Run III, starting in 2020. The instantaneous luminosity will be increased up to $2\\times10^{33}$, five times larger than in Run II and a full software event reconstruction will be performed at the full bunch crossing rate by the trigger. The new running conditions, and the tighter timing constraints in the software trigger, represent a big challenge for track reconstruction. This poster presents the design and performance of a novel algorithm that has been developed to reconstruct track segments using solely hits from the SciFi. This algorithm is crucial for the reconstruction of tracks originating from long-lived particles such as $K_{S}^{0}$ and $\\Lambda$ and allows to greatly enhance the physics potential and capabilities of the LHCb upgrade when compared to its previous implementation.

  9. Calibration of muon reconstruction algorithms using an external muon tracking system at the Sudbury Neutrino Observatory

    Energy Technology Data Exchange (ETDEWEB)

    Sonley, T.J. [Laboratory for Nuclear Science, Massachusetts Institute of Technology, Cambridge, MA 02139 (United States); Department of Physics, Queen' s University, Kingston, Ontario, Canada K7L 3N6 (Canada); Abruzzio, R. [Laboratory for Nuclear Science, Massachusetts Institute of Technology, Cambridge, MA 02139 (United States); Chan, Y.D.; Currat, C.A. [Institute for Nuclear and Particle Astrophysics and Nuclear Science Division, Lawrence Berkeley National Laboratory, Berkeley, CA 94720 (United States); Duncan, F.A. [SNOLAB, Sudbury, ON, P3Y 1M3 (Canada); Department of Physics, Queen' s University, Kingston, Ontario, K7L 3N6 (Canada); Farine, J. [Department of Physics and Astronomy, Laurentian University, Sudbury, Ontario, P3E 2C6 (Canada); Ford, R.J. [SNOLAB, Sudbury, ON, P3Y 1M3 (Canada); Formaggio, J.A., E-mail: josephf@mit.edu [Laboratory for Nuclear Science, Massachusetts Institute of Technology, Cambridge, MA 02139 (United States); Center for Experimental Nuclear Physics and Astrophysics, and Department of Physics, University of Washington, Seattle, WA 98195 (United States); Gagnon, N. [Institute for Nuclear and Particle Astrophysics and Nuclear Science Division, Lawrence Berkeley National Laboratory, Berkeley, CA 94720 (United States); Department of Physics, Queen' s University, Kingston, Ontario, K7L 3N6 (Canada); Center for Experimental Nuclear Physics and Astrophysics, and Department of Physics, University of Washington, Seattle, WA 98195 (United States); Los Alamos National Laboratory, Los Alamos, NM 87545 (United States); Hallin, A.L. [Department of Physics, Queen' s University, Kingston, Ontario, K7L 3N6 (Canada); Department of Physics, University of Alberta, Edmonton, Alberta, T6G 2R3 (Canada)

    2011-08-21

    To help constrain the algorithms used in reconstructing high-energy muon events incident on the Sudbury Neutrino Observatory (SNO), a muon tracking system was installed. The system consisted of four planes of wire chambers, which were triggered by scintillator panels. The system was integrated with SNO's main data acquisition system and took data for a total of 95 live days. Using cosmic-ray events reconstructed in both the wire chambers and in SNO's water Cherenkov detector, the external muon tracking system was able to constrain the uncertainty on the muon direction to better than 0.6{sup o}. - Highlights: > This paper describes a novel technique for calibrating tracking algorithms. > The experimental accuracy achieved by this system was better than 1{sup o}. > The principle behind the technique can be used in future underground experiments.

  10. Use of radar detectors to track attendance of albatrosses at fishing vessels.

    Science.gov (United States)

    Weimerskirch, H; Filippi, D P; Collet, J; Waugh, S M; Patrick, S C

    2018-02-01

    Despite international waters covering over 60% of the world's oceans, understanding of how fisheries in these regions shape ecosystem processes is surprisingly poor. Seabirds forage at fishing vessels, which has potentially deleterious effects for their population, but the extent of overlap and behavior in relation to ships is poorly known. Using novel biologging devices, which detect radar emissions and record the position of boats and seabirds, we measured the true extent of the overlap between seabirds and fishing vessels and generated estimates of the intensity of fishing and distribution of vessels in international waters. During breeding, wandering albatrosses (Diomedea exulans) from the Crozet Islands patrolled an area of over 10 million km2 at distances up to 2500 km from the colony. Up to 79.5% of loggers attached to birds detected vessels. The extent of overlap between albatrosses and fisheries has widespread implications for bycatch risk in seabirds and reveals the areas of intense fishing throughout the ocean. We suggest that seabirds equipped with radar detectors are excellent monitors of the presence of vessels in the Southern Ocean and offer a new way to monitor the presence of illegal fisheries and to better understand the impact of fisheries on seabirds. © 2017 The Authors. Conservation Biology published by Wiley Periodicals, Inc. on behalf of Society for Conservation Biology.

  11. Track-Before-Detect Algorithm for Weak Extended Target Based on Particle Filter under Clutter Environment

    Directory of Open Access Journals (Sweden)

    Wu Sunyong

    2017-06-01

    Full Text Available The Track-Before-Detect (TBD algorithm based on the particle filter is proposed for weak extended target detection and tracking in low signal to clutter noise radio. The rod-shaped object is analyzed by dividing the cell on range and azimuth under the Weibull clutter. On the basis of a point target, the likelihood function and particle weights can be obtained by the target spread function. In the TBD algorithm, the binary target variable and the target shape parameters is added to the state vector and the scattering points in the sample collection is given based on the particle filter, which can detect and estimate the target state and the shape parameters under the clutter environment. Simulation results show that the stability of the algorithm is very good.

  12. Modeling optical pattern recognition algorithms for object tracking based on nonlinear equivalent models and subtraction of frames

    Science.gov (United States)

    Krasilenko, Vladimir G.; Nikolskyy, Aleksandr I.; Lazarev, Alexander A.

    2015-12-01

    We have proposed and discussed optical pattern recognition algorithms for object tracking based on nonlinear equivalent models and subtraction of frames. Experimental results of suggested algorithms in Mathcad and LabVIEW are shown. Application of equivalent functions and difference of frames gives good results for recognition and tracking moving objects.

  13. Development and performance of track reconstruction algorithms at the energy frontier with the ATLAS detector

    Science.gov (United States)

    Gagnon, Louis-Guillaume; ATLAS Collaboration

    2017-10-01

    ATLAS track reconstruction software is continuously evolving to match the demands from the increasing instantaneous luminosity of the LHC, as well as the increased center-of-mass energy. These conditions result in a higher abundance of events with dense track environments, such as the core of jets or boosted tau leptons undergoing three-prong decays. These environments are characterised by charged particle separations on the order of the ATLAS inner detector sensor dimensions and are created by the decay of boosted objects. Significant upgrades were made to the track reconstruction software to cope with the expected conditions during LHC Run 2. In particular, new algorithms targeting dense environments were developed. These changes lead to a substantial reduction of reconstruction time while at the same time improving physics performance. The employed methods are presented and physics performance studies are shown, including a measurement of the fraction of lost tracks in jets with high transverse momentum.

  14. Development and performance of track reconstruction algorithms at the energy frontier with the ATLAS detector

    CERN Document Server

    AUTHOR|(INSPIRE)INSPIRE-00441787; The ATLAS collaboration

    2017-01-01

    ATLAS track reconstruction software is continuously evolving to match the demands from the increasing instantaneous luminosity of the LHC, as well as the increased center-of-mass energy. These conditions result in a higher abundance of events with dense track environments, such as the core of jets or boosted tau leptons undergoing three-prong decays. These environments are characterised by charged particle separations on the order of the ATLAS inner detector sensor dimensions and are created by the decay of boosted objects. Significant upgrades were made to the track reconstruction software to cope with the expected conditions during LHC Run 2. In particular, new algorithms targeting dense environments were developed. These changes lead to a substantial reduction of reconstruction time while at the same time improving physics performance. The employed methods are presented and physics performance studies are shown, including a measurement of the fraction of lost tracks in jets with high transverse momentum.

  15. An Algorithm to Guide Recipient Vessel Selection in Cases of Free Functional Muscle Transfer for Facial Reanimation

    Directory of Open Access Journals (Sweden)

    Francis P Henry

    2014-11-01

    Full Text Available BackgroundThe aim of this study was to review the recipient vessels used in our cases of facial reanimation with free functional muscle transfer and to identify patient variables that may predict when the facial vessels are absent. From this we present a protocol for vessel selection in cases when the facial artery and/or vein are absent.MethodsPatients were identified from November 2006 to October 2013. Data was collected on patient demographics, facial palsy aetiology, history of previous facial surgery/trauma and flap/recipient vessels used. A standard operative approach was adopted and performed by a single surgeon.ResultsEighty-seven eligible patients were identified for inclusion amongst which 98 hemifaces were operated upon. The facial artery and vein were the most commonly used recipient vessels (90% and 83% of patients, respectively. Commonly used alternative vessels were the transverse facial vein and superficial temporal artery. Those with congenital facial palsy were significantly more likely to lack a suitable facial vein (P=0.03 and those with a history of previous facial surgery or trauma were significantly more likely to have an absent facial artery and vein (P<0.05.ConclusionsOur algorithm can help to guide vessel selection cases of facial reanimation with free functional muscle transfer. Amongst patients with congenital facial palsy or in those with a previous history of facial surgery or trauma, the facial vessels are more likely to be absent and so the surgeon should then look towards the transverse facial vein and superficial temporal artery as alternative recipient structures.

  16. Human Vision-Motivated Algorithm Allows Consistent Retinal Vessel Classification Based on Local Color Contrast for Advancing General Diagnostic Exams.

    Science.gov (United States)

    Ivanov, Iliya V; Leitritz, Martin A; Norrenberg, Lars A; Völker, Michael; Dynowski, Marek; Ueffing, Marius; Dietter, Johannes

    2016-02-01

    Abnormalities of blood vessel anatomy, morphology, and ratio can serve as important diagnostic markers for retinal diseases such as AMD or diabetic retinopathy. Large cohort studies demand automated and quantitative image analysis of vascular abnormalities. Therefore, we developed an analytical software tool to enable automated standardized classification of blood vessels supporting clinical reading. A dataset of 61 images was collected from a total of 33 women and 8 men with a median age of 38 years. The pupils were not dilated, and images were taken after dark adaption. In contrast to current methods in which classification is based on vessel profile intensity averages, and similar to human vision, local color contrast was chosen as a discriminator to allow artery vein discrimination and arterial-venous ratio (AVR) calculation without vessel tracking. With 83% ± 1 standard error of the mean for our dataset, we achieved best classification for weighted lightness information from a combination of the red, green, and blue channels. Tested on an independent dataset, our method reached 89% correct classification, which, when benchmarked against conventional ophthalmologic classification, shows significantly improved classification scores. Our study demonstrates that vessel classification based on local color contrast can cope with inter- or intraimage lightness variability and allows consistent AVR calculation. We offer an open-source implementation of this method upon request, which can be integrated into existing tool sets and applied to general diagnostic exams.

  17. Accuracy Refinement Algorithm for Mobile Target Location Tracking by Radio Signal Strength Indication Approach

    Science.gov (United States)

    Lau, Erin-Ee-Lin; Chung, Wan-Young

    A novel RSSI (Received Signal Strength Indication) refinement algorithm is proposed to enhance the resolution for indoor and outdoor real-time location tracking system. The proposed refinement algorithm is implemented in two separate phases. During the first phase, called the pre-processing step, RSSI values at different static locations are collected and processed to build a calibrated model for each reference node. Different measurement campaigns pertinent to each parameter in the model are implemented to analyze the sensitivity of RSSI. The propagation models constructed for each reference nodes are needed by the second phase. During the next phase, called the runtime process, real-time tracking is performed. Smoothing algorithm is proposed to minimize the dynamic fluctuation of radio signal received from each reference node when the mobile target is moving. Filtered RSSI values are converted to distances using formula calibrated in the first phase. Finally, an iterative trilateration algorithm is used for position estimation. Experiments relevant to the optimization algorithm are carried out in both indoor and outdoor environments and the results validated the feasibility of proposed algorithm in reducing the dynamic fluctuation for more accurate position estimation.

  18. A Robust Vision-based Runway Detection and Tracking Algorithm for Automatic UAV Landing

    KAUST Repository

    Abu Jbara, Khaled F.

    2015-05-01

    This work presents a novel real-time algorithm for runway detection and tracking applied to the automatic takeoff and landing of Unmanned Aerial Vehicles (UAVs). The algorithm is based on a combination of segmentation based region competition and the minimization of a specific energy function to detect and identify the runway edges from streaming video data. The resulting video-based runway position estimates are updated using a Kalman Filter, which can integrate other sensory information such as position and attitude angle estimates to allow a more robust tracking of the runway under turbulence. We illustrate the performance of the proposed lane detection and tracking scheme on various experimental UAV flights conducted by the Saudi Aerospace Research Center. Results show an accurate tracking of the runway edges during the landing phase under various lighting conditions. Also, it suggests that such positional estimates would greatly improve the positional accuracy of the UAV during takeoff and landing phases. The robustness of the proposed algorithm is further validated using Hardware in the Loop simulations with diverse takeoff and landing videos generated using a commercial flight simulator.

  19. An evaluation of the potential of GPUs to accelerate tracking algorithms for the ATLAS trigger

    CERN Document Server

    Baines, JTM; The ATLAS collaboration; Emeliyanov, D; Howard, JR; Kama, S; Washbrook, AJ; Wynne, BM

    2014-01-01

    The potential of GPUs has been evaluated as a possible way to accelerate trigger algorithms for the ATLAS experiment located at the Large Hadron Collider (LHC). During LHC Run-1 ATLAS employed a three-level trigger system to progressively reduce the LHC collision rate of 20 MHz to a storage rate of about 600 Hz for offline processing. Reconstruction of charged particles trajectories through the Inner Detector (ID) was performed at the second (L2) and third (EF) trigger levels. The ID contains pixel, silicon strip (SCT) and straw-tube technologies. Prior to tracking, data-preparation algorithms processed the ID raw data producing measurements of the track position at each detector layer. The data-preparation and tracking consumed almost three-quarters of the total L2 CPU resources during 2012 data-taking. Detailed performance studies of a CUDA™ implementation of the L2 pixel and SCT data-preparation and tracking algorithms running on a Nvidia® Tesla C2050 GPU have shown a speed-up by a factor of 12 for the ...

  20. Single-Cell Tracking with PET using a Novel Trajectory Reconstruction Algorithm

    Science.gov (United States)

    Lee, Keum Sil; Kim, Tae Jin

    2015-01-01

    Virtually all biomedical applications of positron emission tomography (PET) use images to represent the distribution of a radiotracer. However, PET is increasingly used in cell tracking applications, for which the “imaging” paradigm may not be optimal. Here we investigate an alternative approach, which consists in reconstructing the time-varying position of individual radiolabeled cells directly from PET measurements. As a proof of concept, we formulate a new algorithm for reconstructing the trajectory of one single moving cell directly from list-mode PET data. We model the trajectory as a 3D B-spline function of the temporal variable and use non-linear optimization to minimize the mean-square distance between the trajectory and the recorded list-mode coincidence events. Using Monte Carlo simulations (GATE), we show that this new algorithm can track a single source moving within a small-animal PET system with <3 mm accuracy provided that the activity of the cell [Bq] is greater than four times its velocity [mm/s]. The algorithm outperforms conventional ML-EM as well as the “minimum distance” method used for positron emission particle tracking (PEPT). The new method was also successfully validated using experimentally acquired PET data. In conclusion, we demonstrated the feasibility of a new method for tracking a single moving cell directly from PET list-mode data, at the whole-body level, for physiologically relevant activities and velocities. PMID:25423651

  1. Integration of an on-axis general sun-tracking formula in the algorithm of an open-loop sun-tracking system.

    Science.gov (United States)

    Chong, Kok-Keong; Wong, Chee-Woon; Siaw, Fei-Lu; Yew, Tiong-Keat; Ng, See-Seng; Liang, Meng-Suan; Lim, Yun-Seng; Lau, Sing-Liong

    2009-01-01

    A novel on-axis general sun-tracking formula has been integrated in the algorithm of an open-loop sun-tracking system in order to track the sun accurately and cost effectively. Sun-tracking errors due to installation defects of the 25 m(2) prototype solar concentrator have been analyzed from recorded solar images with the use of a CCD camera. With the recorded data, misaligned angles from ideal azimuth-elevation axes have been determined and corrected by a straightforward changing of the parameters' values in the general formula of the tracking algorithm to improve the tracking accuracy to 2.99 mrad, which falls below the encoder resolution limit of 4.13 mrad.

  2. Integration of an On-Axis General Sun-Tracking Formula in the Algorithm of an Open-Loop Sun-Tracking System

    Directory of Open Access Journals (Sweden)

    Yun-Seng Lim

    2009-09-01

    Full Text Available A novel on-axis general sun-tracking formula has been integrated in the algorithm of an open-loop sun-tracking system in order to track the sun accurately and cost effectively. Sun-tracking errors due to installation defects of the 25 m2 prototype solar concentrator have been analyzed from recorded solar images with the use of a CCD camera. With the recorded data, misaligned angles from ideal azimuth-elevation axes have been determined and corrected by a straightforward changing of the parameters’ values in the general formula of the tracking algorithm to improve the tracking accuracy to 2.99 mrad, which falls below the encoder resolution limit of 4.13 mrad.

  3. Fuzzy Tracking and Control Algorithm for an SSVEP-Based BCI System

    Directory of Open Access Journals (Sweden)

    Yeou-Jiunn Chen

    2016-09-01

    Full Text Available Subjects with amyotrophic lateral sclerosis (ALS consistently experience decreasing quality of life because of this distinctive disease. Thus, a practical brain-computer interface (BCI application can effectively help subjects with ALS to participate in communication or entertainment. In this study, a fuzzy tracking and control algorithm is proposed for developing a BCI remote control system. To represent the characteristics of the measured electroencephalography (EEG signals after visual stimulation, a fast Fourier transform is applied to extract the EEG features. A self-developed fuzzy tracking algorithm quickly traces the changes of EEG signals. The accuracy and stability of a BCI system can be greatly improved by using a fuzzy control algorithm. Fifteen subjects were asked to attend a performance test of this BCI system. The canonical correlation analysis (CCA was adopted to compare the proposed approach, and the average recognition rates are 96.97% and 94.49% for proposed approach and CCA, respectively. The experimental results showed that the proposed approach is preferable to CCA. Overall, the proposed fuzzy tracking and control algorithm applied in the BCI system can profoundly help subjects with ALS to control air swimmer drone vehicles for entertainment purposes.

  4. A fully-automatic locally adaptive thresholding algorithm for blood vessel segmentation in 3D digital subtraction angiography.

    Science.gov (United States)

    Boegel, Marco; Hoelter, Philip; Redel, Thomas; Maier, Andreas; Hornegger, Joachim; Doerfler, Arnd

    2015-01-01

    Subarachnoid hemorrhage due to a ruptured cerebral aneurysm is still a devastating disease. Planning of endovascular aneurysm therapy is increasingly based on hemodynamic simulations necessitating reliable vessel segmentation and accurate assessment of vessel diameters. In this work, we propose a fully-automatic, locally adaptive, gradient-based thresholding algorithm. Our approach consists of two steps. First, we estimate the parameters of a global thresholding algorithm using an iterative process. Then, a locally adaptive version of the approach is applied using the estimated parameters. We evaluated both methods on 8 clinical 3D DSA cases. Additionally, we propose a way to select a reference segmentation based on 2D DSA measurements. For large vessels such as the internal carotid artery, our results show very high sensitivity (97.4%), precision (98.7%) and Dice-coefficient (98.0%) with our reference segmentation. Similar results (sensitivity: 95.7%, precision: 88.9% and Dice-coefficient: 90.7%) are achieved for smaller vessels of approximately 1mm diameter.

  5. Efficient Parallel Algorithm for Statistical Ion Track Simulations in Crystalline Materials

    CERN Document Server

    Jeon, Byoungseon

    2008-01-01

    We present an efficient parallel algorithm for statistical Molecular Dynamics simulations of ion tracks in solids. The method is based on the Rare Event Enhanced Domain following Molecular Dynamics (REED-MD) algorithm, which has been successfully applied to studies of, e.g., ion implantation into crystalline semiconductor wafers. We discuss the strategies for parallelizing the method, and we settle on a host-client type polling scheme in which a multiple of asynchronous processors are continuously fed to the host, which, in turn, distributes the resulting feed-back information to the clients. This real-time feed-back consists of, e.g., cumulative damage information or statistics updates necessary for the cloning in the rare event algorithm. We finally demonstrate the algorithm for radiation effects in a nuclear oxide fuel, and we show the balanced parallel approach with high parallel efficiency in multiple processor configurations.

  6. A new tracking algorithm for multiple colloidal particles close to contact

    Science.gov (United States)

    Yücel, Harun; Turan Okumuşoğlu, Nazmi

    2017-11-01

    In this paper, we propose a new algorithm based on radial symmetry center method to track colloidal particles close to contact, where the optical images of the particles start to overlap in digital video microscopy. This overlapping effect is important to observe the pair interaction potential in colloidal studies and it appears as additional interaction in the measurement of the interaction with conventional tracking analysis. The proposed algorithm in this work is simple, fast and applicable for not only two particles but also three and more particles without any modification. The algorithm uses gradient vectors of the particle intensity distribution, which allows us to use a part of the symmetric intensity distribution in the calculation of the actual particle position. In this study, simulations are performed to see the performance of the proposed algorithm for two and three particles, where the simulation images are generated by using fitted curve to experimental particle image for different sized particles. As a result, the algorithm yields the maximum error smaller than 2 nm for 5.53 μm silica particles in contact condition.

  7. GPU-Based Tracking Algorithms for the ATLAS High-Level Trigger

    CERN Document Server

    Emeliyanov, D; The ATLAS collaboration

    2012-01-01

    GPU-accelerated event processing is one of the possible options for the ATLAS High-Level Trigger (HLT) upgrade for higher LHC luminosity. This poster presents data preparation and track finding algorithms specifically designed to run on a GPU using a “client-server” solution for hybrid CPU/GPU event processing and integration of the GPU algorithms into existing ATLAS HLT software. The resulting speed-up of event processing times obtained with high-luminosity simulated data is presented and discussed.

  8. Eye-Tracking Verification of the Strategy Used to Analyse Algorithms Expressed in a Flowchart and Pseudocode

    Science.gov (United States)

    Andrzejewska, Magdalena; Stolinska, Anna; Blasiak, Wladyslaw; Peczkowski, Pawel; Rosiek, Roman; Rozek, Bozena; Sajka, Miroslawa; Wcislo, Dariusz

    2016-01-01

    The results of qualitative and quantitative investigations conducted with individuals who learned algorithms in school are presented in this article. In these investigations, eye-tracking technology was used to follow the process of solving algorithmic problems. The algorithmic problems were presented in two comparable variants: in a pseudocode…

  9. An Improved Interacting Multiple Model Filtering Algorithm Based on the Cubature Kalman Filter for Maneuvering Target Tracking.

    Science.gov (United States)

    Zhu, Wei; Wang, Wei; Yuan, Gannan

    2016-06-01

    In order to improve the tracking accuracy, model estimation accuracy and quick response of multiple model maneuvering target tracking, the interacting multiple models five degree cubature Kalman filter (IMM5CKF) is proposed in this paper. In the proposed algorithm, the interacting multiple models (IMM) algorithm processes all the models through a Markov Chain to simultaneously enhance the model tracking accuracy of target tracking. Then a five degree cubature Kalman filter (5CKF) evaluates the surface integral by a higher but deterministic odd ordered spherical cubature rule to improve the tracking accuracy and the model switch sensitivity of the IMM algorithm. Finally, the simulation results demonstrate that the proposed algorithm exhibits quick and smooth switching when disposing different maneuver models, and it also performs better than the interacting multiple models cubature Kalman filter (IMMCKF), interacting multiple models unscented Kalman filter (IMMUKF), 5CKF and the optimal mode transition matrix IMM (OMTM-IMM).

  10. On the Impact of Localization and Density Control Algorithms in Target Tracking Applications forWireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Joel J. P. C. Rodrigues

    2012-05-01

    Full Text Available Target tracking is an important application of wireless sensor networks. The networks’ ability to locate and track an object is directed linked to the nodes’ ability to locate themselves. Consequently, localization systems are essential for target tracking applications. In addition, sensor networks are often deployed in remote or hostile environments. Therefore, density control algorithms are used to increase network lifetime while maintaining its sensing capabilities. In this work, we analyze the impact of localization algorithms (RPE and DPE and density control algorithms (GAF, A3 and OGDC on target tracking applications. We adapt the density control algorithms to address the k-coverage problem. In addition, we analyze the impact of network density, residual integration with density control, and k-coverage on both target tracking accuracy and network lifetime. Our results show that DPE is a better choice for target tracking applications than RPE. Moreover, among the evaluated density control algorithms, OGDC is the best option among the three. Although the choice of the density control algorithm has little impact on the tracking precision, OGDC outperforms GAF and A3 in terms of tracking time.

  11. Single Maneuvering Target Tracking in Clutter Based on Multiple Model Algorithm with Gaussian Mixture Reduction

    Directory of Open Access Journals (Sweden)

    Ji Zhang

    2013-10-01

    Full Text Available The measurement origin uncertainty and target (dynamic or/and measurement model uncertainty are two fundamental problems in maneuvering target tracking in clutter. The multiple hypothesis tracker (MHT and multiple model (MM algorithm are two well-known methods dealing with these two problems, respectively. In this work, we address the problem of single maneuvering target tracking in clutter by combing MHT and MM based on the Gaussian mixture reduction (GMR. Different ways of combinations of MHT and MM for this purpose were available in previous studies, but in heuristic manners. The GMR is adopted because it provides a theoretically appealing way to reduce the exponentially increasing numbers of measurement association possibilities and target model trajectories. The superior performance of our method, comparing with the existing IMM+PDA and IMM+MHT algorithms, is demonstrated by the results of Monte Carlo simulation.

  12. "Mtrack 1.0": A multi-vehicle, deterministic tracking algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Carrano, C J

    2008-05-22

    As overhead persistent surveillance sensors become more capable at acquiring wide-field image sequences for longer time-spans, the need to exploit such data becomes ever greater. A desirable use of such sensors is to be able to track all the observable vehicles while they persist in the imagery. Typically, this imagery is characterized by lower resolutions (e.g. >= 0.5 m/pixel ) and lower frame rates (e.g. {approx} few Hz). We describe our initial implementation of a multiple-vehicle tracking algorithm for overhead persistent surveillance imagery. Subsequent reports will then present results of applying this tracker to specific persistent surveillance imagery as well as algorithm improvements and extensions for dealing with wider-field imagery.

  13. A generic sun-tracking algorithm for on-axis solar collector in mobile platforms

    Science.gov (United States)

    Lai, An-Chow; Chong, Kok-Keong; Lim, Boon-Han; Ho, Ming-Cheng; Yap, See-Hao; Heng, Chun-Kit; Lee, Jer-Vui; King, Yeong-Jin

    2015-04-01

    This paper proposes a novel dynamic sun-tracking algorithm which allows accurate tracking of the sun for both non-concentrated and concentrated photovoltaic systems located on mobile platforms to maximize solar energy extraction. The proposed algorithm takes not only the date, time, and geographical information, but also the dynamic changes of coordinates of the mobile platforms into account to calculate the sun position angle relative to ideal azimuth-elevation axes in real time using general sun-tracking formulas derived by Chong and Wong. The algorithm acquires data from open-loop sensors, i.e. global position system (GPS) and digital compass, which are readily available in many off-the-shelf portable gadgets, such as smart phone, to instantly capture the dynamic changes of coordinates of mobile platforms. Our experiments found that a highly accurate GPS is not necessary as the coordinate changes of practical mobile platforms are not fast enough to produce significant differences in the calculation of the incident angle. On the contrary, it is critical to accurately identify the quadrant and angle where the mobile platforms are moving toward in real time, which can be resolved by using digital compass. In our implementation, a noise filtering mechanism is found necessary to remove unexpected spikes in the readings of the digital compass to ensure stability in motor actuations and effectiveness in continuous tracking. Filtering mechanisms being studied include simple moving average and linear regression; the results showed that a compound function of simple moving average and linear regression produces a better outcome. Meanwhile, we found that a sampling interval is useful to avoid excessive motor actuations and power consumption while not sacrificing the accuracy of sun-tracking.

  14. A Novel Global MPP Tracking of Photovoltaic System based on Whale Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Santhan Kumar Cherukuri

    2016-11-01

    Full Text Available To harvest maximum amount of solar energy and to attain higher efficiency, photovoltaic generation (PVG systems are to be operated at their maximum power  point (MPP under both variable climatic and partial shaded condition (PSC. From literature most of conventional MPP tracking (MPPT methods are able to guarantee MPP successfully under uniform shading condition but fails to get global MPP as they may trap at local MPP under PSC, which adversely deteriorates the efficiency of Photovoltaic Generation (PVG system. In this paper a novel MPPT based on Whale Optimization Algorithm (WOA is proposed to analyze analytic modeling of PV system considering both series and shunt resistances for MPP tracking under PSC. The proposed algorithm is tested on 6S, 3S2P and 2S3P Photovoltaic array configurations for different shading patterns and results are presented. To compare the performance, GWO and PSO MPPT algorithms are also simulated and results are also presented.  From the results it is noticed that proposed MPPT method is superior to other MPPT methods with reference to accuracy and tracking speed. Article History: Received July 23rd 2016; Received in revised form September 15th 2016; Accepted October 1st 2016; Available online How to Cite This Article: Kumar, C.H.S and Rao, R.S. (2016 A Novel Global MPP Tracking of Photovoltaic System based on Whale Optimization Algorithm. Int. Journal of Renewable Energy Development, 5(3, 225-232. http://dx.doi.org/10.14710/ijred.5.3.225-232

  15. PTM Along Track Algorithm to Maintain Spacing During Same Direction Pair-Wise Trajectory Management Operations

    Science.gov (United States)

    Carreno, Victor A.

    2015-01-01

    Pair-wise Trajectory Management (PTM) is a cockpit based delegated responsibility separation standard. When an air traffic service provider gives a PTM clearance to an aircraft and the flight crew accepts the clearance, the flight crew will maintain spacing and separation from a designated aircraft. A PTM along track algorithm will receive state information from the designated aircraft and from the own ship to produce speed guidance for the flight crew to maintain spacing and separation

  16. Development and performance of track reconstruction algorithms at the energy frontier with the ATLAS detector

    CERN Document Server

    Gagnon, Louis-Guillaume; The ATLAS collaboration

    2016-01-01

    ATLAS track reconstruction code is continuously evolving to match the demands from the increasing instantaneous luminosity of LHC, as well as the increased centre-of-mass energy. With the increase in energy, events with dense environments, e.g. the cores of jets or boosted tau leptons, become much more abundant. These environments are characterised by charged particle separations on the order of ATLAS inner detector sensor dimensions and are created by the decay of boosted objects. Significant upgrades were made to the track reconstruction code to cope with the expected conditions during LHC Run 2. In particular, new algorithms targeting dense environments were developed. These changes lead to a substantial reduction of reconstruction time while at the same time improving physics performance. The employed methods are presented. In addition, physics performance studies are shown, e.g. a measurement of the fraction of lost tracks in jets with high transverse momentum.

  17. Proportional-Type Performance Recovery DC-Link Voltage Tracking Algorithm for Permanent Magnet Synchronous Generators

    Directory of Open Access Journals (Sweden)

    Seok-Kyoon Kim

    2017-09-01

    Full Text Available This study proposes a disturbance observer-based proportional-type DC-link voltage tracking algorithm for permanent magnet synchronous generators (PMSGs. The proposed technique feedbacks the only proportional term of the tracking errors, and it contains the nominal static and dynamic feed-forward compensators coming from the first-order disturbance observers. It is rigorously proved that the proposed method ensures the performance recovery and offset-free properties without the use of the integrators of the tracking errors. A wind power generation system has been simulated to verify the efficacy of the proposed method using the PSIM (PowerSIM software with the DLL (Dynamic Link Library block.

  18. A Radar Multi-target Tracking Algorithm Based on Gaussian Mixture PHD Filter under Doppler Blind Zone

    Directory of Open Access Journals (Sweden)

    Wei Qiang

    2017-02-01

    Full Text Available Due to the Doppler Blind Zone (DBZ, the target tracking of Doppler radar becomes more and more complicated. In this paper, a multi-target tracking algorithm based on Gaussian Mixture Probability Hypothesis Density (GM-PHD for DBZ is proposed. The algorithm introduces the Minimum Detectable Velocity (MDV information to the traditional detection probability model to update the GM-PHD and the updated equation of the GM-PHD is deduced. The simulation results show that, compared to the traditional GM-PHD with the only Doppler measurement, the proposed algorithm improves greatly the radar tracking performance of moving target under the condition of minor MDV.

  19. An evolutionary computation based algorithm for calculating solar differential rotation by automatic tracking of coronal bright points

    Science.gov (United States)

    Shahamatnia, Ehsan; Dorotovič, Ivan; Fonseca, Jose M.; Ribeiro, Rita A.

    2016-03-01

    Developing specialized software tools is essential to support studies of solar activity evolution. With new space missions such as Solar Dynamics Observatory (SDO), solar images are being produced in unprecedented volumes. To capitalize on that huge data availability, the scientific community needs a new generation of software tools for automatic and efficient data processing. In this paper a prototype of a modular framework for solar feature detection, characterization, and tracking is presented. To develop an efficient system capable of automatic solar feature tracking and measuring, a hybrid approach combining specialized image processing, evolutionary optimization, and soft computing algorithms is being followed. The specialized hybrid algorithm for tracking solar features allows automatic feature tracking while gathering characterization details about the tracked features. The hybrid algorithm takes advantages of the snake model, a specialized image processing algorithm widely used in applications such as boundary delineation, image segmentation, and object tracking. Further, it exploits the flexibility and efficiency of Particle Swarm Optimization (PSO), a stochastic population based optimization algorithm. PSO has been used successfully in a wide range of applications including combinatorial optimization, control, clustering, robotics, scheduling, and image processing and video analysis applications. The proposed tool, denoted PSO-Snake model, was already successfully tested in other works for tracking sunspots and coronal bright points. In this work, we discuss the application of the PSO-Snake algorithm for calculating the sidereal rotational angular velocity of the solar corona. To validate the results we compare them with published manual results performed by an expert.

  20. Fixed-point auto-landing algorithm for UAV based on point tracking

    Science.gov (United States)

    Shao, Zhiyu; Nie, Zhengang; Feng, Yuan; Feng, Shunshan

    2009-12-01

    A new automatic fixed-point landing algorithm for UAV using the instantaneous speed obtained by image sensors and computer vision method is proposed. In the proposed scheme, once the specified land pad for landing is captured, the UAV will switch from auto-seeking mode to landing mode. In the landing mode, the feature point of the prospective zone is extracted and then being tracked. The noise in the motion parameter introduced by the feature point mismatching is reduced by fast iterative least square algorithm, and the accurate instantaneous speed of UAV is obtained. The simulation results show that the proposed algorithm efficiently improve the accuracy of the estimation of instantaneous velocity for the fixed-point landing system of UAV.

  1. Code Tracking Algorithms for Mitigating Multipath Effects in Fading Channels for Satellite-Based Positioning

    Directory of Open Access Journals (Sweden)

    Markku Renfors

    2007-12-01

    Full Text Available The ever-increasing public interest in location and positioning services has originated a demand for higher performance global navigation satellite systems (GNSSs. In order to achieve this incremental performance, the estimation of line-of-sight (LOS delay with high accuracy is a prerequisite for all GNSSs. The delay lock loops (DLLs and their enhanced variants (i.e., feedback code tracking loops are the structures of choice for the commercial GNSS receivers, but their performance in severe multipath scenarios is still rather limited. In addition, the new satellite positioning system proposals specify the use of a new modulation, the binary offset carrier (BOC modulation, which triggers a new challenge in the code tracking stage. Therefore, in order to meet this emerging challenge and to improve the accuracy of the delay estimation in severe multipath scenarios, this paper analyzes feedback as well as feedforward code tracking algorithms and proposes the peak tracking (PT methods, which are combinations of both feedback and feedforward structures and utilize the inherent advantages of both structures. We propose and analyze here two variants of PT algorithm: PT with second-order differentiation (Diff2, and PT with Teager Kaiser (TK operator, which will be denoted herein as PT(Diff2 and PT(TK, respectively. In addition to the proposal of the PT methods, the authors propose also an improved early-late-slope (IELS multipath elimination technique which is shown to provide very good mean-time-to-lose-lock (MTLL performance. An implementation of a noncoherent multipath estimating delay locked loop (MEDLL structure is also presented. We also incorporate here an extensive review of the existing feedback and feedforward delay estimation algorithms for direct sequence code division multiple access (DS-CDMA signals in satellite fading channels, by taking into account the impact of binary phase shift keying (BPSK as well as the newly proposed BOC modulation

  2. Code Tracking Algorithms for Mitigating Multipath Effects in Fading Channels for Satellite-Based Positioning

    Science.gov (United States)

    Bhuiyan, Mohammad Zahidul H.; Lohan, Elena Simona; Renfors, Markku

    2007-12-01

    The ever-increasing public interest in location and positioning services has originated a demand for higher performance global navigation satellite systems (GNSSs). In order to achieve this incremental performance, the estimation of line-of-sight (LOS) delay with high accuracy is a prerequisite for all GNSSs. The delay lock loops (DLLs) and their enhanced variants (i.e., feedback code tracking loops) are the structures of choice for the commercial GNSS receivers, but their performance in severe multipath scenarios is still rather limited. In addition, the new satellite positioning system proposals specify the use of a new modulation, the binary offset carrier (BOC) modulation, which triggers a new challenge in the code tracking stage. Therefore, in order to meet this emerging challenge and to improve the accuracy of the delay estimation in severe multipath scenarios, this paper analyzes feedback as well as feedforward code tracking algorithms and proposes the peak tracking (PT) methods, which are combinations of both feedback and feedforward structures and utilize the inherent advantages of both structures. We propose and analyze here two variants of PT algorithm: PT with second-order differentiation (Diff2), and PT with Teager Kaiser (TK) operator, which will be denoted herein as PT(Diff2) and PT(TK), respectively. In addition to the proposal of the PT methods, the authors propose also an improved early-late-slope (IELS) multipath elimination technique which is shown to provide very good mean-time-to-lose-lock (MTLL) performance. An implementation of a noncoherent multipath estimating delay locked loop (MEDLL) structure is also presented. We also incorporate here an extensive review of the existing feedback and feedforward delay estimation algorithms for direct sequence code division multiple access (DS-CDMA) signals in satellite fading channels, by taking into account the impact of binary phase shift keying (BPSK) as well as the newly proposed BOC modulation

  3. Strain estimation by a Fourier Series-based extrema tracking algorithm for elastography.

    Science.gov (United States)

    Wang, Wenxia; Hu, Danfeng; Wang, Jiajun; Zou, Wei

    2015-09-01

    In this paper, a new strain estimator using extrema tracking based on Fourier Series expansion (ETBFS) is proposed for ultrasonic elastography. In this method, the extremum is determined by solving an equation constructed by obtaining the first order derivative of the Fourier Series expansion and setting it to zero. Unlike other tracking algorithms, the ETBFS method can locate the extrema of radio frequency (RF) signals exactly between two adjacent sampling points and achieve a sub-sample accuracy without additional explicit interpolation. The correspondence between the located extrema in the pre- and post-compressed RF signal segments are constructed with a fine matching technique, with which the displacements and strains are estimated. Experimental results on a finite-element-modeling (FEM) simulation phantom show that the new proposed method can provide a more accurate displacement estimation than the standard cross-correlation (CC)-based method and the scale-invariant keypoints tracking (SIKT) algorithm. Moreover, performance analysis in terms of elastographic signal-to-noise ratio (SNRe), elastographic contrast-to-noise ratio (CNRe) and the real-versus-estimated strain error (RESE) also indicate that the dynamic range of the strain filter and its sensitivity can be improved with this new method. Copyright © 2015 Elsevier B.V. All rights reserved.

  4. "Mtrack 2.0": An ultra-scale tracking algorithm for low-resolution overhead imagery

    Energy Technology Data Exchange (ETDEWEB)

    Carrano, C J

    2008-09-26

    Overhead persistent surveillance systems are becoming more capable at acquiring wide-field image sequences for long time-spans. The need to exploit this data is becoming ever greater. The ability to track a single vehicle of interest or to track all the observable vehicles, which may number in the thousands, over large, cluttered regions while they persist in the imagery is very desirable. Typically, this imagery has many thousands of pixels on a side and is characterized by lower resolutions (e.g. {approx}0.5 meters/pixel to {approx}2.0 meters/pixel) and lower frame rates (e.g. {approx} sub-Hz to several Hz). We describe our ultra-scale capable implementation of a multiple-vehicle tracking algorithm for overhead persistent surveillance imagery. This work builds upon an earlier report, where now the algorithm has been modified for improved performance and has been substantially improved to handle much larger datasets in a much shorter time.

  5. A parallelizable real-time motion tracking algorithm with applications to ultrasonic strain imaging

    Energy Technology Data Exchange (ETDEWEB)

    Jiang, J; Hall, T J [Department of Medical Physics, University of Wisconsin-Madison, 1300 University Avenue, 1530 MSC, Madison, WI 53706 (United States)

    2007-07-07

    Ultrasound-based mechanical strain imaging systems utilize signals from conventional diagnostic ultrasound systems to image tissue elasticity contrast that provides new diagnostically valuable information. Previous works (Hall et al 2003 Ultrasound Med. Biol. 29 427, Zhu and Hall 2002 Ultrason. Imaging 24 161) demonstrated that uniaxial deformation with minimal elevation motion is preferred for breast strain imaging and real-time strain image feedback to operators is important to accomplish this goal. The work reported here enhances the real-time speckle tracking algorithm with two significant modifications. One fundamental change is that the proposed algorithm is a column-based algorithm (a column is defined by a line of data parallel to the ultrasound beam direction, i.e. an A-line), as opposed to a row-based algorithm (a row is defined by a line of data perpendicular to the ultrasound beam direction). Then, displacement estimates from its adjacent columns provide good guidance for motion tracking in a significantly reduced search region to reduce computational cost. Consequently, the process of displacement estimation can be naturally split into at least two separated tasks, computed in parallel, propagating outward from the center of the region of interest (ROI). The proposed algorithm has been implemented and optimized in a Windows (registered) system as a stand-alone ANSI C++ program. Results of preliminary tests, using numerical and tissue-mimicking phantoms, and in vivo tissue data, suggest that high contrast strain images can be consistently obtained with frame rates (10 frames s{sup -1}) that exceed our previous methods.

  6. Context-specific selection of algorithms for recursive feature tracking in endoscopic image using a new methodology.

    Science.gov (United States)

    Selka, F; Nicolau, S; Agnus, V; Bessaid, A; Marescaux, J; Soler, L

    2015-03-01

    In minimally invasive surgery, the tracking of deformable tissue is a critical component for image-guided applications. Deformation of the tissue can be recovered by tracking features using tissue surface information (texture, color,...). Recent work in this field has shown success in acquiring tissue motion. However, the performance evaluation of detection and tracking algorithms on such images are still difficult and are not standardized. This is mainly due to the lack of ground truth data on real data. Moreover, in order to avoid supplementary techniques to remove outliers, no quantitative work has been undertaken to evaluate the benefit of a pre-process based on image filtering, which can improve feature tracking robustness. In this paper, we propose a methodology to validate detection and feature tracking algorithms, using a trick based on forward-backward tracking that provides an artificial ground truth data. We describe a clear and complete methodology to evaluate and compare different detection and tracking algorithms. In addition, we extend our framework to propose a strategy to identify the best combinations from a set of detector, tracker and pre-process algorithms, according to the live intra-operative data. Experimental results have been performed on in vivo datasets and show that pre-process can have a strong influence on tracking performance and that our strategy to find the best combinations is relevant for a reasonable computation cost. Copyright © 2014 Elsevier Ltd. All rights reserved.

  7. Moving Object Tracking and Avoidance Algorithm for Differential Driving AGV Based on Laser Measurement Technology

    Directory of Open Access Journals (Sweden)

    Pandu Sandi Pratama

    2012-12-01

    Full Text Available This paper proposed an algorithm to track the obstacle position and avoid the moving objects for differential driving Automatic Guided Vehicles (AGV system in industrial environment. This algorithm has several abilities such as: to detect the moving objects, to predict the velocity and direction of moving objects, to predict the collision possibility and to plan the avoidance maneuver. For sensing the local environment and positioning, the laser measurement system LMS-151 and laser navigation system NAV-200 are applied. Based on the measurement results of the sensors, the stationary and moving obstacles are detected and the collision possibility is calculated. The velocity and direction of the obstacle are predicted using Kalman filter algorithm. Collision possibility, time, and position can be calculated by comparing the AGV movement and obstacle prediction result obtained by Kalman filter. Finally the avoidance maneuver using the well known tangent Bug algorithm is decided based on the calculation data. The effectiveness of proposed algorithm is verified using simulation and experiment. Several examples of experiment conditions are presented using stationary obstacle, and moving obstacles. The simulation and experiment results show that the AGV can detect and avoid the obstacles successfully in all experimental condition. [Keywords— Obstacle avoidance, AGV, differential drive, laser measurement system, laser navigation system].

  8. Dynamic Analysis of the High Speed Train and Slab Track Nonlinear Coupling System with the Cross Iteration Algorithm

    OpenAIRE

    Xiaoyan Lei; Shenhua Wu; Bin Zhang

    2016-01-01

    A model for dynamic analysis of the vehicle-track nonlinear coupling system is established by the finite element method. The whole system is divided into two subsystems: the vehicle subsystem and the track subsystem. Coupling of the two subsystems is achieved by equilibrium conditions for wheel-to-rail nonlinear contact forces and geometrical compatibility conditions. To solve the nonlinear dynamics equations for the vehicle-track coupling system, a cross iteration algorithm and a relaxation ...

  9. Affinity Propagation Based Measurement Partition Algorithm for Multiple Extended Target Tracking

    Directory of Open Access Journals (Sweden)

    Yang Jin-long

    2015-08-01

    Full Text Available It is difficult to accurately and rapidly partition measurement sets of multiple extended targets in cluttered environment. Hence the affinity propagation method is introduced and a novel measurement partition algorithm is proposed. First, the measurement set is preprocessed by using density analysis to remove clutters from the measurements. Second, the number and location of the extended targets is determined via competition among the measurements. Finally, state estimates are obtained by using the probability hypothesis density filter. Simulations show that the proposed algorithm offers good performance in measurement partitioning of extended target tracking with clutter disturbance. Compared with the distance partition and K-means++ methods, the proposed method effectively minimizes the computation time and retrieves the number of targets iteratively.

  10. Experimental investigation of a moving averaging algorithm for motion perpendicular to the leaf travel direction in dynamic MLC target tracking

    Energy Technology Data Exchange (ETDEWEB)

    Yoon, Jai-Woong; Sawant, Amit; Suh, Yelin; Cho, Byung-Chul; Suh, Tae-Suk; Keall, Paul [Department of Biomedical Engineering, College of Medicine, Catholic University of Korea, Seoul, Korea 131-700 and Research Institute of Biomedical Engineering, Catholic University of Korea, Seoul, 131-700 (Korea, Republic of); Department of Radiation Oncology, Stanford University, Stanford, California 94305 (United States); Department of Radiation Oncology, Stanford University, Stanford, California 94305 (United States) and Department of Radiation Oncology, Asan Medical Center, Seoul, 138-736 (Korea, Republic of); Department of Biomedical Engineering, College of Medicine, Catholic University of Korea, Seoul, 131-700 and Research Institute of Biomedical Engineering, Catholic University of Korea, Seoul, 131-700 (Korea, Republic of); Department of Radiation Oncology, Stanford University, Stanford, California 94305 (United States) and Radiation Physics Laboratory, Sydney Medical School, University of Sydney, 2006 (Australia)

    2011-07-15

    Purpose: In dynamic multileaf collimator (MLC) motion tracking with complex intensity-modulated radiation therapy (IMRT) fields, target motion perpendicular to the MLC leaf travel direction can cause beam holds, which increase beam delivery time by up to a factor of 4. As a means to balance delivery efficiency and accuracy, a moving average algorithm was incorporated into a dynamic MLC motion tracking system (i.e., moving average tracking) to account for target motion perpendicular to the MLC leaf travel direction. The experimental investigation of the moving average algorithm compared with real-time tracking and no compensation beam delivery is described. Methods: The properties of the moving average algorithm were measured and compared with those of real-time tracking (dynamic MLC motion tracking accounting for both target motion parallel and perpendicular to the leaf travel direction) and no compensation beam delivery. The algorithm was investigated using a synthetic motion trace with a baseline drift and four patient-measured 3D tumor motion traces representing regular and irregular motions with varying baseline drifts. Each motion trace was reproduced by a moving platform. The delivery efficiency, geometric accuracy, and dosimetric accuracy were evaluated for conformal, step-and-shoot IMRT, and dynamic sliding window IMRT treatment plans using the synthetic and patient motion traces. The dosimetric accuracy was quantified via a {gamma}-test with a 3%/3 mm criterion. Results: The delivery efficiency ranged from 89 to 100% for moving average tracking, 26%-100% for real-time tracking, and 100% (by definition) for no compensation. The root-mean-square geometric error ranged from 3.2 to 4.0 mm for moving average tracking, 0.7-1.1 mm for real-time tracking, and 3.7-7.2 mm for no compensation. The percentage of dosimetric points failing the {gamma}-test ranged from 4 to 30% for moving average tracking, 0%-23% for real-time tracking, and 10%-47% for no compensation

  11. A Region Tracking-Based Vehicle Detection Algorithm in Nighttime Traffic Scenes

    Directory of Open Access Journals (Sweden)

    Jianqiang Wang

    2013-12-01

    Full Text Available The preceding vehicles detection technique in nighttime traffic scenes is an important part of the advanced driver assistance system (ADAS. This paper proposes a region tracking-based vehicle detection algorithm via the image processing technique. First, the brightness of the taillights during nighttime is used as the typical feature, and we use the existing global detection algorithm to detect and pair the taillights. When the vehicle is detected, a time series analysis model is introduced to predict vehicle positions and the possible region (PR of the vehicle in the next frame. Then, the vehicle is only detected in the PR. This could reduce the detection time and avoid the false pairing between the bright spots in the PR and the bright spots out of the PR. Additionally, we present a thresholds updating method to make the thresholds adaptive. Finally, experimental studies are provided to demonstrate the application and substantiate the superiority of the proposed algorithm. The results show that the proposed algorithm can simultaneously reduce both the false negative detection rate and the false positive detection rate.

  12. Designs and Algorithms to Map Eye Tracking Data with Dynamic Multielement Moving Objects

    Science.gov (United States)

    Mandal, Saptarshi

    2016-01-01

    Design concepts and algorithms were developed to address the eye tracking analysis issues that arise when (1) participants interrogate dynamic multielement objects that can overlap on the display and (2) visual angle error of the eye trackers is incapable of providing exact eye fixation coordinates. These issues were addressed by (1) developing dynamic areas of interests (AOIs) in the form of either convex or rectangular shapes to represent the moving and shape-changing multielement objects, (2) introducing the concept of AOI gap tolerance (AGT) that controls the size of the AOIs to address the overlapping and visual angle error issues, and (3) finding a near optimal AGT value. The approach was tested in the context of air traffic control (ATC) operations where air traffic controller specialists (ATCSs) interrogated multiple moving aircraft on a radar display to detect and control the aircraft for the purpose of maintaining safe and expeditious air transportation. In addition, we show how eye tracking analysis results can differ based on how we define dynamic AOIs to determine eye fixations on moving objects. The results serve as a framework to more accurately analyze eye tracking data and to better support the analysis of human performance. PMID:27725830

  13. Designs and Algorithms to Map Eye Tracking Data with Dynamic Multielement Moving Objects

    Directory of Open Access Journals (Sweden)

    Ziho Kang

    2016-01-01

    Full Text Available Design concepts and algorithms were developed to address the eye tracking analysis issues that arise when (1 participants interrogate dynamic multielement objects that can overlap on the display and (2 visual angle error of the eye trackers is incapable of providing exact eye fixation coordinates. These issues were addressed by (1 developing dynamic areas of interests (AOIs in the form of either convex or rectangular shapes to represent the moving and shape-changing multielement objects, (2 introducing the concept of AOI gap tolerance (AGT that controls the size of the AOIs to address the overlapping and visual angle error issues, and (3 finding a near optimal AGT value. The approach was tested in the context of air traffic control (ATC operations where air traffic controller specialists (ATCSs interrogated multiple moving aircraft on a radar display to detect and control the aircraft for the purpose of maintaining safe and expeditious air transportation. In addition, we show how eye tracking analysis results can differ based on how we define dynamic AOIs to determine eye fixations on moving objects. The results serve as a framework to more accurately analyze eye tracking data and to better support the analysis of human performance.

  14. Mechanics of swimming of multi-body bacterial swarmers using non-labeled cell tracking algorithm

    Science.gov (United States)

    Phuyal, Kiran; Kim, Min Jun

    2013-01-01

    To better understand the survival strategy of bacterial swarmers and the mechanical advantages offered by the linear chain (head-tail) attachment of the multiple bacterial bodies in an individual swarmer cell at low Reynolds number, a non-labeled cell tracking algorithm was used to quantify the mechanics of multi-body flagellated bacteria, Serratia marcescens, swimming in a motility buffer that originally exhibited the swarming motility. Swarming is a type of bacterial motility that is characterized by the collective coordinated motion of differentiated swarmer cells on a two-dimensional surface such as agar. In this study, the bacterial swarmers with multiple cell bodies (2, 3, and 4) were extracted from the swarm plate, and then tracked individually after resuspending in the motility medium. Their motion was investigated and compared with individual undifferentiated swimming bacterial cells. The swarmers when released into the motility buffer swam actively without tumbles. Their speeds, orientations, and the diffusive properties were studied by tracking the individual cell trajectories over a short distance in two-dimensional field when the cells are swimming at a constant depth in a bulk aqueous environment. At short time scales, the ballistic trajectory was dominant for both multi-body swarmers and undifferentiated cells.

  15. Application of an Image Tracking Algorithm in Fire Ant Motion Experiment

    Directory of Open Access Journals (Sweden)

    Lichuan Gui

    2009-04-01

    Full Text Available An image tracking algorithm, which was originally used with the particle image velocimetry (PIV to determine velocities of buoyant solid particles in water, is modified and applied in the presented work to detect motion of fire ant on a planar surface. A group of fire ant workers are put to the bottom of a tub and excited with vibration of selected frequency and intensity. The moving fire ants are captured with an image system that successively acquires image frames of high digital resolution. The background noise in the imaging recordings is extracted by averaging hundreds of frames and removed from each frame. The individual fire ant images are identified with a recursive digital filter, and then they are tracked between frames according to the size, brightness, shape, and orientation angle of the ant image. The speed of an individual ant is determined with the displacement of its images and the time interval between frames. The trail of the individual fire ant is determined with the image tracking results, and a statistical analysis is conducted for all the fire ants in the group. The purpose of the experiment is to investigate the response of fire ants to the substrate vibration. Test results indicate that the fire ants move faster after being excited, but the number of active ones are not increased even after a strong excitation.

  16. Error analysis and algorithm implementation for an improved optical-electric tracking device based on MEMS

    Science.gov (United States)

    Sun, Hong; Wu, Qian-zhong

    2013-09-01

    In order to improve the precision of optical-electric tracking device, proposing a kind of improved optical-electric tracking device based on MEMS, in allusion to the tracking error of gyroscope senor and the random drift, According to the principles of time series analysis of random sequence, establish AR model of gyro random error based on Kalman filter algorithm, then the output signals of gyro are multiple filtered with Kalman filter. And use ARM as micro controller servo motor is controlled by fuzzy PID full closed loop control algorithm, and add advanced correction and feed-forward links to improve response lag of angle input, Free-forward can make output perfectly follow input. The function of lead compensation link is to shorten the response of input signals, so as to reduce errors. Use the wireless video monitor module and remote monitoring software (Visual Basic 6.0) to monitor servo motor state in real time, the video monitor module gathers video signals, and the wireless video module will sent these signals to upper computer, so that show the motor running state in the window of Visual Basic 6.0. At the same time, take a detailed analysis to the main error source. Through the quantitative analysis of the errors from bandwidth and gyro sensor, it makes the proportion of each error in the whole error more intuitive, consequently, decrease the error of the system. Through the simulation and experiment results shows the system has good following characteristic, and it is very valuable for engineering application.

  17. TANGO-New tracking AlGOrithm for gamma-rays

    Energy Technology Data Exchange (ETDEWEB)

    Tashenov, S., E-mail: tashenov@fysik.su.s [Royal Institute of Technology (KTH), AlbaNova University Center, Roslagstullsbacken 21, SE-10691 Stockholm (Sweden); Stockholm University, AlbaNova University Center, Roslagstullsbacken 21, SE-10691 Stockholm (Sweden); GSI Helmholtzzentrum fuer Schwerionenforschung GmbH (GSI), Planckstrasse 1, 64291 Darmstadt (Germany); Gerl, J. [GSI Helmholtzzentrum fuer Schwerionenforschung GmbH (GSI), Planckstrasse 1, 64291 Darmstadt (Germany)

    2010-10-21

    For spectroscopy, polarimetry and imaging purposes a new {gamma}-ray tracking algorithm has been developed featuring identification of Compton escape events. The rejection of these events results in a significant increase of the Peak/Total ratio. The initial photon energy is restored for these events. Although the energy resolution in the spectrum reconstructed from the escape events is lower than the one from the full-energy events, the Monte-Carlo simulations show that the combined spectrum has an increased detector full-energy efficiency of up to 130% compared to its intrinsic full-energy efficiency. The assumed geometrical origin of the photons is verified event-by-event. This enables separation of photons emitted from a target and from background sources. A linear polarization analysis of the {gamma}-lines can be performed. The efficiency of the algorithm and the Peak/Total ratio depending on the detector properties is discussed along with the proposed optimization schemes. The influence of the intrinsic properties of the scattering process like Compton profile and electron recoiling is discussed as well. The described algorithm deals with single photon events with energies of {approx}100keV up to a few MeV.

  18. TANGO—New tracking AlGOrithm for gamma-rays

    Science.gov (United States)

    Tashenov, S.; Gerl, J.

    2010-10-01

    For spectroscopy, polarimetry and imaging purposes a new γ-ray tracking algorithm has been developed featuring identification of Compton escape events. The rejection of these events results in a significant increase of the Peak/Total ratio. The initial photon energy is restored for these events. Although the energy resolution in the spectrum reconstructed from the escape events is lower than the one from the full-energy events, the Monte-Carlo simulations show that the combined spectrum has an increased detector full-energy efficiency of up to 130% compared to its intrinsic full-energy efficiency. The assumed geometrical origin of the photons is verified event-by-event. This enables separation of photons emitted from a target and from background sources. A linear polarization analysis of the γ-lines can be performed. The efficiency of the algorithm and the Peak/Total ratio depending on the detector properties is discussed along with the proposed optimization schemes. The influence of the intrinsic properties of the scattering process like Compton profile and electron recoiling is discussed as well. The described algorithm deals with single photon events with energies of ≈100 keV up to a few MeV.

  19. Improved KLT Algorithm for High-Precision Wavelength Tracking of Optical Fiber Bragg Grating Sensors

    Directory of Open Access Journals (Sweden)

    Daniele Tosi

    2017-01-01

    Full Text Available Fiber Bragg Gratings (FBGs are among the most popular optical fiber sensors. FBGs are well suited for direct detection of temperature and strain and can be functionalized for pressure, humidity, and refractive index sensing. Commercial setups for FBG interrogation are based on white-light sources and spectrometer detectors, which are capable of decoding the spectrum of an FBG array. Low-cost spectrometers record the spectrum on a coarse wavelength grid (typically 78–156 pm, whereas wavelength shifts of 1 pm or lower are required by most of the applications. Several algorithms have been presented for detection of small wavelength shift, even with coarse wavelength sampling; most notably, the Karhunen-Loeve Transform (KLT was demonstrated. In this paper, an improved algorithm based on KLT is proposed, which is capable of further expanding the performances. Simulations show that, reproducing a commercial spectrometer with 156 pm grid, the algorithm estimates wavelength shift with accuracy well below 1 pm. In typical signal-to-noise ratio (SNR conditions, the root mean square error is 22–220 fm, while the accuracy is 0.22 pm, despite the coarse sampling. Results have been also validated through experimental characterization. The proposed method allows achieving exceptional accuracy in wavelength tracking, beating the picometer level resolution proposed in most commercial and research software, and, due to fast operation (>5 kHz, is compatible also with structural health monitoring and acoustics.

  20. A Cubature-Principle-Assisted IMM-Adaptive UKF Algorithm for Maneuvering Target Tracking Caused by Sensor Faults

    Directory of Open Access Journals (Sweden)

    Huan Zhou

    2017-09-01

    Full Text Available Aimed at solving the problem of decreased filtering precision while maneuvering target tracking caused by non-Gaussian distribution and sensor faults, we developed an efficient interacting multiple model-unscented Kalman filter (IMM-UKF algorithm. By dividing the IMM-UKF into two links, the algorithm introduces the cubature principle to approximate the probability density of the random variable, after the interaction, by considering the external link of IMM-UKF, which constitutes the cubature-principle-assisted IMM method (CPIMM for solving the non-Gaussian problem, and leads to an adaptive matrix to balance the contribution of the state. The algorithm provides filtering solutions by considering the internal link of IMM-UKF, which is called a new adaptive UKF algorithm (NAUKF to address sensor faults. The proposed CPIMM-NAUKF is evaluated in a numerical simulation and two practical experiments including one navigation experiment and one maneuvering target tracking experiment. The simulation and experiment results show that the proposed CPIMM-NAUKF has greater filtering precision and faster convergence than the existing IMM-UKF. The proposed algorithm achieves a very good tracking performance, and will be effective and applicable in the field of maneuvering target tracking.

  1. Performance Evaluation of Block Acquisition and Tracking Algorithms Using an Open Source GPS Receiver Platform

    Science.gov (United States)

    Ramachandran, Ganesh K.; Akopian, David; Heckler, Gregory W.; Winternitz, Luke B.

    2011-01-01

    Location technologies have many applications in wireless communications, military and space missions, etc. US Global Positioning System (GPS) and other existing and emerging Global Navigation Satellite Systems (GNSS) are expected to provide accurate location information to enable such applications. While GNSS systems perform very well in strong signal conditions, their operation in many urban, indoor, and space applications is not robust or even impossible due to weak signals and strong distortions. The search for less costly, faster and more sensitive receivers is still in progress. As the research community addresses more and more complicated phenomena there exists a demand on flexible multimode reference receivers, associated SDKs, and development platforms which may accelerate and facilitate the research. One of such concepts is the software GPS/GNSS receiver (GPS SDR) which permits a facilitated access to algorithmic libraries and a possibility to integrate more advanced algorithms without hardware and essential software updates. The GNU-SDR and GPS-SDR open source receiver platforms are such popular examples. This paper evaluates the performance of recently proposed block-corelator techniques for acquisition and tracking of GPS signals using open source GPS-SDR platform.

  2. Review of the maximum power point tracking algorithms for stand-alone photovoltaic systems

    Energy Technology Data Exchange (ETDEWEB)

    Salas, V.; Olias, E.; Barrado, A.; Lazaro, A. [Departamento de Tecnologia Electronica/Grupo de Sistemas Electronicos de Potencia, Universidad Carlos III de Madrid, Avda. de la Universidad, 30-28911 Leganes, Madrid (Spain)

    2006-07-06

    A survey of the algorithms for seeking the maximum power point (MPP) is proposed. As has been shown, there are many ways of distinguishing and grouping methods that seek the MPP from a photovoltaic (PV) generator. However, in this article they are grouped as either direct or nondirect methods. The indirect methods ('quasi seeks') have the particular feature that the MPP is estimated from the measures of the PV generator's voltage and current PV, the irradiance, or using empiric data, by mathematical expressions of numerical approximations. Therefore, the estimation is carried out for a specific PV generator installed in the system. Thus, they do not obtain the maximum power for any irradiance or temperature and none of them are able to obtain the MPP exactly. Subsequently, they are known as 'quasi seeks'. Nevertheless, the direct methods ('true seeking methods') can also be distinguished. They offer the advantage that they obtain the actual maximum power from the measures of the PV generator's voltage and current PV. In that case, they are suitable for any irradiance and temperature. All algorithms, direct and indirect, can be included in some of the DC/DC converters, Maximum power point trackings (MPPTs), for the stand-alone systems. (author)

  3. Predicting Human Mobility Patterns in Marine Ecosystems: Entropy and Home Range Calculations Based on High-Resolution Fishing Vessel Tracking Data

    Science.gov (United States)

    Murawski, S. A.

    2016-02-01

    A number of recent studies have developed metrics of human mobility patterns based on georeferenced cell phone records. The studies generally indicate a high degree of predictability in human location and relatively narrow home ranges for most people. In marine ecosystems there are a number of important uses for such calculations including marine spatial planning and predicting the impacts of marine management options such as establishing marine protected areas (MPAs). In this study we use individual fishing vessel satellite tracking (VMS) records ( 30 million records) obtained from commercial reef fish fishing vessels in the Gulf of Mexico during 2006-2014. This period witnessed the establishment of a variety of new regulations including individual fishing quotas (IFQs) for snapper, grouper, and tilefish, establishment of spatial-area closures, and the temporary closure of as much as 85,000 nautical miles of productive fishing grounds associated with the Deepwater Horizon oil spill accident. Vessel positions were obtained, with a location frequency of one hour. From these VMS data we calculated three measures of entropy (degree of repeatability in spatial use), as well as calculated the axis of gyration (home range) for each vessel in the data set. These calculations were related to a variety of descriptor variables including vessel size, distance from home port to predominant fishing grounds, revenue generated on fishing trips, and fishing regulations. The applicability of these calculations to marine resource management applications is discussed.

  4. Tmax Determined Using a Bayesian Estimation Deconvolution Algorithm Applied to Bolus Tracking Perfusion Imaging: A Digital Phantom Validation Study.

    Science.gov (United States)

    Uwano, Ikuko; Sasaki, Makoto; Kudo, Kohsuke; Boutelier, Timothé; Kameda, Hiroyuki; Mori, Futoshi; Yamashita, Fumio

    2017-01-10

    The Bayesian estimation algorithm improves the precision of bolus tracking perfusion imaging. However, this algorithm cannot directly calculate Tmax, the time scale widely used to identify ischemic penumbra, because Tmax is a non-physiological, artificial index that reflects the tracer arrival delay (TD) and other parameters. We calculated Tmax from the TD and mean transit time (MTT) obtained by the Bayesian algorithm and determined its accuracy in comparison with Tmax obtained by singular value decomposition (SVD) algorithms. The TD and MTT maps were generated by the Bayesian algorithm applied to digital phantoms with time-concentration curves that reflected a range of values for various perfusion metrics using a global arterial input function. Tmax was calculated from the TD and MTT using constants obtained by a linear least-squares fit to Tmax obtained from the two SVD algorithms that showed the best benchmarks in a previous study. Correlations between the Tmax values obtained by the Bayesian and SVD methods were examined. The Bayesian algorithm yielded accurate TD and MTT values relative to the true values of the digital phantom. Tmax calculated from the TD and MTT values with the least-squares fit constants showed excellent correlation (Pearson's correlation coefficient = 0.99) and agreement (intraclass correlation coefficient = 0.99) with Tmax obtained from SVD algorithms. Quantitative analyses of Tmax values calculated from Bayesian-estimation algorithm-derived TD and MTT from a digital phantom correlated and agreed well with Tmax values determined using SVD algorithms.

  5. A New Filtering and Smoothing Algorithm for Railway Track Surveying Based on Landmark and IMU/Odometer

    Directory of Open Access Journals (Sweden)

    Qingan Jiang

    2017-06-01

    Full Text Available High-accuracy railway track surveying is essential for railway construction and maintenance. The traditional approaches based on total station equipment are not efficient enough since high precision surveying frequently needs static measurements. This paper proposes a new filtering and smoothing algorithm based on the IMU/odometer and landmarks integration for the railway track surveying. In order to overcome the difficulty of estimating too many error parameters with too few landmark observations, a new model with completely observable error states is established by combining error terms of the system. Based on covariance analysis, the analytical relationship between the railway track surveying accuracy requirements and equivalent gyro drifts including bias instability and random walk noise are established. Experiment results show that the accuracy of the new filtering and smoothing algorithm for railway track surveying can reach 1 mm (1σ when using a Ring Laser Gyroscope (RLG-based Inertial Measurement Unit (IMU with gyro bias instability of 0.03°/h and random walk noise of 0.005 °h while control points of the track control network (CPIII position observations are provided by the optical total station in about every 60 m interval. The proposed approach can satisfy at the same time the demands of high accuracy and work efficiency for railway track surveying.

  6. A New Filtering and Smoothing Algorithm for Railway Track Surveying Based on Landmark and IMU/Odometer.

    Science.gov (United States)

    Jiang, Qingan; Wu, Wenqi; Jiang, Mingming; Li, Yun

    2017-06-19

    High-accuracy railway track surveying is essential for railway construction and maintenance. The traditional approaches based on total station equipment are not efficient enough since high precision surveying frequently needs static measurements. This paper proposes a new filtering and smoothing algorithm based on the IMU/odometer and landmarks integration for the railway track surveying. In order to overcome the difficulty of estimating too many error parameters with too few landmark observations, a new model with completely observable error states is established by combining error terms of the system. Based on covariance analysis, the analytical relationship between the railway track surveying accuracy requirements and equivalent gyro drifts including bias instability and random walk noise are established. Experiment results show that the accuracy of the new filtering and smoothing algorithm for railway track surveying can reach 1 mm (1σ) when using a Ring Laser Gyroscope (RLG)-based Inertial Measurement Unit (IMU) with gyro bias instability of 0.03°/h and random walk noise of 0.005 °h while control points of the track control network (CPIII) position observations are provided by the optical total station in about every 60 m interval. The proposed approach can satisfy at the same time the demands of high accuracy and work efficiency for railway track surveying.

  7. The sensitivity of characteristics of cyclone activity to identification procedures in tracking algorithms

    Directory of Open Access Journals (Sweden)

    Irina Rudeva

    2014-12-01

    Full Text Available The IMILAST project (‘Intercomparison of Mid-Latitude Storm Diagnostics’ was set up to compare low-level cyclone climatologies derived from a number of objective identification algorithms. This paper is a contribution to that effort where we determine the sensitivity of three key aspects of Northern Hemisphere cyclone behaviour [namely the number of cyclones, their intensity (defined here in terms of the central pressure and their deepening rates] to specific features in the automatic cyclone identification. The sensitivity is assessed with respect to three such features which may be thought to influence the ultimate climatology produced (namely performance in areas of complicated orography, time of the detection of a cyclone, and the representation of rapidly propagating cyclones. We make use of 13 tracking methods in this analysis. We find that the filtering of cyclones in regions where the topography exceeds 1500 m can significantly change the total number of cyclones detected by a scheme, but has little impact on the cyclone intensity distribution. More dramatically, late identification of cyclones (simulated by the truncation of the first 12 hours of cyclone life cycle leads to a large reduction in cyclone numbers over the both continents and oceans (up to 80 and 40%, respectively. Finally, the potential splitting of the trajectories at times of the fastest propagation has a negligible climatological effect on geographical distribution of cyclone numbers. Overall, it has been found that the averaged deepening rates and averaged cyclone central pressure are rather insensitive to the specifics of the tracking procedure, being more sensitive to the data set used (as shown in previous studies and the geographical location of a cyclone.

  8. Phase accumulation tracking algorithm for effective index retrieval of fishnet metamaterials and other resonant guided wave networks

    Science.gov (United States)

    Feigenbaum, Eyal; Hiszpanski, Anna M.

    2017-07-01

    A phase accumulation tracking (PAT) algorithm is proposed and demonstrated for the retrieval of the effective index of fishnet metamaterials (FMMs) in order to avoid the multi-branch uncertainty problem. This algorithm tracks the phase and amplitude of the dominant propagation mode across the FMM slab. The suggested PAT algorithm applies to resonant guided wave networks having only one mode that carries the light between the two slab ends, where the FMM is one example of this metamaterials sub-class. The effective index is a net effect of positive and negative accumulated phase in the alternating FMM metal and dielectric layers, with a negative effective index occurring when negative phase accumulation dominates.

  9. Simultaneous multi-vehicle detection and tracking framework with pavement constraints based on machine learning and particle filter algorithm

    Science.gov (United States)

    Wang, Ke; Huang, Zhi; Zhong, Zhihua

    2014-11-01

    Due to the large variations of environment with ever-changing background and vehicles with different shapes, colors and appearances, to implement a real-time on-board vehicle recognition system with high adaptability, efficiency and robustness in complicated environments, remains challenging. This paper introduces a simultaneous detection and tracking framework for robust on-board vehicle recognition based on monocular vision technology. The framework utilizes a novel layered machine learning and particle filter to build a multi-vehicle detection and tracking system. In the vehicle detection stage, a layered machine learning method is presented, which combines coarse-search and fine-search to obtain the target using the AdaBoost-based training algorithm. The pavement segmentation method based on characteristic similarity is proposed to estimate the most likely pavement area. Efficiency and accuracy are enhanced by restricting vehicle detection within the downsized area of pavement. In vehicle tracking stage, a multi-objective tracking algorithm based on target state management and particle filter is proposed. The proposed system is evaluated by roadway video captured in a variety of traffics, illumination, and weather conditions. The evaluating results show that, under conditions of proper illumination and clear vehicle appearance, the proposed system achieves 91.2% detection rate and 2.6% false detection rate. Experiments compared to typical algorithms show that, the presented algorithm reduces the false detection rate nearly by half at the cost of decreasing 2.7%-8.6% detection rate. This paper proposes a multi-vehicle detection and tracking system, which is promising for implementation in an on-board vehicle recognition system with high precision, strong robustness and low computational cost.

  10. Dynamic Analysis of the High Speed Train and Slab Track Nonlinear Coupling System with the Cross Iteration Algorithm

    Directory of Open Access Journals (Sweden)

    Xiaoyan Lei

    2016-01-01

    Full Text Available A model for dynamic analysis of the vehicle-track nonlinear coupling system is established by the finite element method. The whole system is divided into two subsystems: the vehicle subsystem and the track subsystem. Coupling of the two subsystems is achieved by equilibrium conditions for wheel-to-rail nonlinear contact forces and geometrical compatibility conditions. To solve the nonlinear dynamics equations for the vehicle-track coupling system, a cross iteration algorithm and a relaxation technique are presented. Examples of vibration analysis of the vehicle and slab track coupling system induced by China’s high speed train CRH3 are given. In the computation, the influences of linear and nonlinear wheel-to-rail contact models and different train speeds are considered. It is found that the cross iteration algorithm and the relaxation technique have the following advantages: simple programming; fast convergence; shorter computation time; and greater accuracy. The analyzed dynamic responses for the vehicle and the track with the wheel-to-rail linear contact model are greater than those with the wheel-to-rail nonlinear contact model, where the increasing range of the displacement and the acceleration is about 10%, and the increasing range of the wheel-to-rail contact force is less than 5%.

  11. Developing an eye-tracking algorithm as a potential tool for early diagnosis of autism spectrum disorder in children.

    Directory of Open Access Journals (Sweden)

    Natalia I Vargas-Cuentas

    Full Text Available Autism spectrum disorder (ASD currently affects nearly 1 in 160 children worldwide. In over two-thirds of evaluations, no validated diagnostics are used and gold standard diagnostic tools are used in less than 5% of evaluations. Currently, the diagnosis of ASD requires lengthy and expensive tests, in addition to clinical confirmation. Therefore, fast, cheap, portable, and easy-to-administer screening instruments for ASD are required. Several studies have shown that children with ASD have a lower preference for social scenes compared with children without ASD. Based on this, eye-tracking and measurement of gaze preference for social scenes has been used as a screening tool for ASD. Currently available eye-tracking software requires intensive calibration, training, or holding of the head to prevent interference with gaze recognition limiting its use in children with ASD.In this study, we designed a simple eye-tracking algorithm that does not require calibration or head holding, as a platform for future validation of a cost-effective ASD potential screening instrument. This system operates on a portable and inexpensive tablet to measure gaze preference of children for social compared to abstract scenes. A child watches a one-minute stimulus video composed of a social scene projected on the left side and an abstract scene projected on the right side of the tablet's screen. We designed five stimulus videos by changing the social/abstract scenes. Every child observed all the five videos in random order. We developed an eye-tracking algorithm that calculates the child's gaze preference for the social and abstract scenes, estimated as the percentage of the accumulated time that the child observes the left or right side of the screen, respectively. Twenty-three children without a prior history of ASD and 8 children with a clinical diagnosis of ASD were evaluated. The recorded video of the child´s eye movement was analyzed both manually by an observer

  12. Automated Storm Tracking and the Lightning Jump Algorithm Using GOES-R Geostationary Lightning Mapper (GLM) Proxy Data

    Science.gov (United States)

    Schultz, Elise; Schultz, Christopher Joseph; Carey, Lawrence D.; Cecil, Daniel J.; Bateman, Monte

    2016-01-01

    This study develops a fully automated lightning jump system encompassing objective storm tracking, Geostationary Lightning Mapper proxy data, and the lightning jump algorithm (LJA), which are important elements in the transition of the LJA concept from a research to an operational based algorithm. Storm cluster tracking is based on a product created from the combination of a radar parameter (vertically integrated liquid, VIL), and lightning information (flash rate density). Evaluations showed that the spatial scale of tracked features or storm clusters had a large impact on the lightning jump system performance, where increasing spatial scale size resulted in decreased dynamic range of the system's performance. This framework will also serve as a means to refine the LJA itself to enhance its operational applicability. Parameters within the system are isolated and the system's performance is evaluated with adjustments to parameter sensitivity. The system's performance is evaluated using the probability of detection (POD) and false alarm ratio (FAR) statistics. Of the algorithm parameters tested, sigma-level (metric of lightning jump strength) and flash rate threshold influenced the system's performance the most. Finally, verification methodologies are investigated. It is discovered that minor changes in verification methodology can dramatically impact the evaluation of the lightning jump system.

  13. Technical Note: A novel leaf sequencing optimization algorithm which considers previous underdose and overdose events for MLC tracking radiotherapy

    Energy Technology Data Exchange (ETDEWEB)

    Wisotzky, Eric, E-mail: eric.wisotzky@charite.de, E-mail: eric.wisotzky@ipk.fraunhofer.de; O’Brien, Ricky; Keall, Paul J., E-mail: paul.keall@sydney.edu.au [Radiation Physics Laboratory, Sydney Medical School, University of Sydney, Sydney, NSW 2006 (Australia)

    2016-01-15

    Purpose: Multileaf collimator (MLC) tracking radiotherapy is complex as the beam pattern needs to be modified due to the planned intensity modulation as well as the real-time target motion. The target motion cannot be planned; therefore, the modified beam pattern differs from the original plan and the MLC sequence needs to be recomputed online. Current MLC tracking algorithms use a greedy heuristic in that they optimize for a given time, but ignore past errors. To overcome this problem, the authors have developed and improved an algorithm that minimizes large underdose and overdose regions. Additionally, previous underdose and overdose events are taken into account to avoid regions with high quantity of dose events. Methods: The authors improved the existing MLC motion control algorithm by introducing a cumulative underdose/overdose map. This map represents the actual projection of the planned tumor shape and logs occurring dose events at each specific regions. These events have an impact on the dose cost calculation and reduce recurrence of dose events at each region. The authors studied the improvement of the new temporal optimization algorithm in terms of the L1-norm minimization of the sum of overdose and underdose compared to not accounting for previous dose events. For evaluation, the authors simulated the delivery of 5 conformal and 14 intensity-modulated radiotherapy (IMRT)-plans with 7 3D patient measured tumor motion traces. Results: Simulations with conformal shapes showed an improvement of L1-norm up to 8.5% after 100 MLC modification steps. Experiments showed comparable improvements with the same type of treatment plans. Conclusions: A novel leaf sequencing optimization algorithm which considers previous dose events for MLC tracking radiotherapy has been developed and investigated. Reductions in underdose/overdose are observed for conformal and IMRT delivery.

  14. A highly scalable particle tracking algorithm using partitioned global address space (PGAS) programming for extreme-scale turbulence simulations

    Science.gov (United States)

    Buaria, D.; Yeung, P. K.

    2017-12-01

    A new parallel algorithm utilizing a partitioned global address space (PGAS) programming model to achieve high scalability is reported for particle tracking in direct numerical simulations of turbulent fluid flow. The work is motivated by the desire to obtain Lagrangian information necessary for the study of turbulent dispersion at the largest problem sizes feasible on current and next-generation multi-petaflop supercomputers. A large population of fluid particles is distributed among parallel processes dynamically, based on instantaneous particle positions such that all of the interpolation information needed for each particle is available either locally on its host process or neighboring processes holding adjacent sub-domains of the velocity field. With cubic splines as the preferred interpolation method, the new algorithm is designed to minimize the need for communication, by transferring between adjacent processes only those spline coefficients determined to be necessary for specific particles. This transfer is implemented very efficiently as a one-sided communication, using Co-Array Fortran (CAF) features which facilitate small data movements between different local partitions of a large global array. The cost of monitoring transfer of particle properties between adjacent processes for particles migrating across sub-domain boundaries is found to be small. Detailed benchmarks are obtained on the Cray petascale supercomputer Blue Waters at the University of Illinois, Urbana-Champaign. For operations on the particles in a 81923 simulation (0.55 trillion grid points) on 262,144 Cray XE6 cores, the new algorithm is found to be orders of magnitude faster relative to a prior algorithm in which each particle is tracked by the same parallel process at all times. This large speedup reduces the additional cost of tracking of order 300 million particles to just over 50% of the cost of computing the Eulerian velocity field at this scale. Improving support of PGAS models on

  15. A Novel Sensor Selection and Power Allocation Algorithm for Multiple-Target Tracking in an LPI Radar Network

    Directory of Open Access Journals (Sweden)

    Ji She

    2016-12-01

    Full Text Available Radar networks are proven to have numerous advantages over traditional monostatic and bistatic radar. With recent developments, radar networks have become an attractive platform due to their low probability of intercept (LPI performance for target tracking. In this paper, a joint sensor selection and power allocation algorithm for multiple-target tracking in a radar network based on LPI is proposed. It is found that this algorithm can minimize the total transmitted power of a radar network on the basis of a predetermined mutual information (MI threshold between the target impulse response and the reflected signal. The MI is required by the radar network system to estimate target parameters, and it can be calculated predictively with the estimation of target state. The optimization problem of sensor selection and power allocation, which contains two variables, is non-convex and it can be solved by separating power allocation problem from sensor selection problem. To be specific, the optimization problem of power allocation can be solved by using the bisection method for each sensor selection scheme. Also, the optimization problem of sensor selection can be solved by a lower complexity algorithm based on the allocated powers. According to the simulation results, it can be found that the proposed algorithm can effectively reduce the total transmitted power of a radar network, which can be conducive to improving LPI performance.

  16. A Novel Sensor Selection and Power Allocation Algorithm for Multiple-Target Tracking in an LPI Radar Network.

    Science.gov (United States)

    She, Ji; Wang, Fei; Zhou, Jianjiang

    2016-12-21

    Radar networks are proven to have numerous advantages over traditional monostatic and bistatic radar. With recent developments, radar networks have become an attractive platform due to their low probability of intercept (LPI) performance for target tracking. In this paper, a joint sensor selection and power allocation algorithm for multiple-target tracking in a radar network based on LPI is proposed. It is found that this algorithm can minimize the total transmitted power of a radar network on the basis of a predetermined mutual information (MI) threshold between the target impulse response and the reflected signal. The MI is required by the radar network system to estimate target parameters, and it can be calculated predictively with the estimation of target state. The optimization problem of sensor selection and power allocation, which contains two variables, is non-convex and it can be solved by separating power allocation problem from sensor selection problem. To be specific, the optimization problem of power allocation can be solved by using the bisection method for each sensor selection scheme. Also, the optimization problem of sensor selection can be solved by a lower complexity algorithm based on the allocated powers. According to the simulation results, it can be found that the proposed algorithm can effectively reduce the total transmitted power of a radar network, which can be conducive to improving LPI performance.

  17. Application of a novel particle tracking algorithm in the flow visualization of an artificial abdominal aortic aneurysm.

    Science.gov (United States)

    Zhang, Yang; Wang, Yuan; He, Wenbo; Yang, Bin

    2014-01-01

    A novel Particle Tracking Velocimetry (PTV) algorithm based on Voronoi Diagram (VD) is proposed and briefed as VD-PTV. The robustness of VD-PTV for pulsatile flow is verified through a test that includes a widely used artificial flow and a classic reference algorithm. The proposed algorithm is then applied to visualize the flow in an artificial abdominal aortic aneurysm included in a pulsatile circulation system that simulates the aortic blood flow in human body. Results show that, large particles tend to gather at the upstream boundary because of the backflow eddies that follow the pulsation. This qualitative description, together with VD-PTV, has laid a foundation for future works that demand high-level quantification.

  18. Development of hybrid particle tracking algorithms and their applications in airflow measurement within an aircraft cabin mock-up

    Science.gov (United States)

    Yan, Wei

    Obtaining reliable experimental airflow data within an indoor environment is a challenging task and critical in studying and solving indoor air quality problems. The Hybrid Particle Tracking Velocimetry (HPTV) system is aimed at fulfilling this need. It was developed based on existing Particle Tracking Velocimety (PTV) and Volumetric Particle Tracking Velocimetry (VPTV) techniques. The HPTV system requires three charge-coupled device (CCD) cameras to view the illuminated flow field and capture the trajectories of the seeded particles. By adopting the hybrid spatial matching and object tracking algorithms, this system can acquire the 3-Dimensional velocity components within a large volume with relatively high spatial and temporal resolution. Synthetic images were employed to validate the performance of three components of the system: image processing, camera calibration and 3D velocity reconstruction. These three components are also the main error sources. The accuracy of the whole algorithm was analyzed and discussed through a back projection approach. The results showed that the algorithms performed effectively and accurately. The reconstructed 3D trajectories and streaks agreed well with the simulated streamline of the particles. As an overall testing and application of the system, HPTV was applied to measure the airflow pattern within a full-scale, five-row section of a Boeing 767-300 aircraft cabin mockup. A complete experimental procedure was developed and strictly followed throughout the experiment. Both global flow field at the whole cabin scale and the local flow field at the breathing zone of one passenger were studied. Each test case was also simulated numerically using a commercial computational fluid dynamic (CFD) package. Through comparison between the results from the numerical simulation and the experimental measurement, the potential model validation capability of the system was demonstrated. Possible reasons explaining the difference between

  19. Numerical methods and inversion algorithms in reservoir simulation based on front tracking

    Energy Technology Data Exchange (ETDEWEB)

    Haugse, Vidar

    1999-04-01

    This thesis uses front tracking to analyse laboratory experiments on multiphase flow in porous media. New methods for parameter estimation for two- and three-phase relative permeability experiments have been developed. Up scaling of heterogeneous and stochastic porous media is analysed. Numerical methods based on front tracking is developed and analysed. Such methods are efficient for problems involving steep changes in the physical quantities. Multi-dimensional problems are solved by combining front tracking with dimensional splitting. A method for adaptive grid refinement is developed.

  20. Passive Infrared (PIR)-Based Indoor Position Tracking for Smart Homes Using Accessibility Maps and A-Star Algorithm.

    Science.gov (United States)

    Yang, Dan; Xu, Bin; Rao, Kaiyou; Sheng, Weihua

    2018-01-24

    Indoor occupants' positions are significant for smart home service systems, which usually consist of robot service(s), appliance control and other intelligent applications. In this paper, an innovative localization method is proposed for tracking humans' position in indoor environments based on passive infrared (PIR) sensors using an accessibility map and an A-star algorithm, aiming at providing intelligent services. First the accessibility map reflecting the visiting habits of the occupants is established through the integral training with indoor environments and other prior knowledge. Then the PIR sensors, which placement depends on the training results in the accessibility map, get the rough location information. For more precise positioning, the A-start algorithm is used to refine the localization, fused with the accessibility map and the PIR sensor data. Experiments were conducted in a mock apartment testbed. The ground truth data was obtained from an Opti-track system. The results demonstrate that the proposed method is able to track persons in a smart home environment and provide a solution for home robot localization.

  1. Improvements to the ShipIR/NTCS adaptive track gate algorithm and 3D flare particle model

    Science.gov (United States)

    Ramaswamy, Srinivasan; Vaitekunas, David A.; Gunter, Willem H.; February, Faith J.

    2017-05-01

    A key component in any image-based tracking system is the adaptive tracking algorithm used to segment the image into potential targets, rank-and-select the best candidate target, and gate the selected target to further improve tracker performance. Similarly, a key component in any soft-kill response to an incoming guided missile is the flare/chaff decoy used to distract or seduce the seeker homing system away from the naval platform. This paper describes the recent improvements to the naval threat countermeasure simulator (NTCS) of the NATO-standard ship signature model (ShipIR). Efforts to analyse and match the 3D flare particle model against actual IR measurements of the Chemring TALOS IR round resulted in further refinement of the 3D flare particle distribution. The changes in the flare model characteristics were significant enough to require an overhaul to the adaptive track gate (ATG) algorithm in the way it detects the presence of flare decoys and reacquires the target after flare separation. A series of test scenarios are used to demonstrate the impact of the new flare and ATG on IR tactics simulation.

  2. Hardware Demonstrator of a Level-1 Track Finding Algorithm with FPGAs for the Phase II CMS Experiment

    CERN Document Server

    AUTHOR|(CDS)2090481

    2016-01-01

    At the HL-LHC, proton bunches collide every 25\\,ns, producing an average of 140 pp interactions per bunch crossing. To operate in such an environment, the CMS experiment will need a Level-1 (L1) hardware trigger, able to identify interesting events within a latency of 12.5\\,$\\mu$s. This novel L1 trigger will make use of data coming from the silicon tracker to constrain the trigger rate. Goal of this new \\textit{track trigger} will be to build L1 tracks from the tracker information. The architecture that will be implemented in future to process tracker data is still under discussion. One possibility is to adopt a system entirely based on FPGA electronic. The proposed track finding algorithm is based on the Hough transform method. The algorithm has been tested using simulated pp collision data and it is currently being demonstrated in hardware, using the ``MP7'', which is a $\\mu$TCA board with a powerful FPGA capable of handling data rates approaching 1 Tb/s. Two different implementations of the Hough tran...

  3. A Comparison of Evolutionary Algorithms for Tracking Time-Varying Recursive Systems

    Directory of Open Access Journals (Sweden)

    White Michael S

    2003-01-01

    Full Text Available A comparison is made of the behaviour of some evolutionary algorithms in time-varying adaptive recursive filter systems. Simulations show that an algorithm including random immigrants outperforms a more conventional algorithm using the breeder genetic algorithm as the mutation operator when the time variation is discontinuous, but neither algorithm performs well when the time variation is rapid but smooth. To meet this deficit, a new hybrid algorithm which uses a hill climber as an additional genetic operator, applied for several steps at each generation, is introduced. A comparison is made of the effect of applying the hill climbing operator a few times to all members of the population or a larger number of times solely to the best individual; it is found that applying to the whole population yields the better results, substantially improved compared with those obtained using earlier methods.

  4. Advanced algorithms for mobile robot motion planning and tracking in structured static environments using particle swarm optimization

    Directory of Open Access Journals (Sweden)

    Ćosić Aleksandar

    2012-01-01

    Full Text Available An approach to intelligent robot motion planning and tracking in known and static environments is presented in this paper. This complex problem is divided into several simpler problems. The first is generation of a collision free path from starting to destination point, which is solved using a particle swarm optimization (PSO algorithm. The second is interpolation of the obtained collision-free path, which is solved using a radial basis function neural network (RBFNN, and trajectory generation, based on the interpolated path. The last is a trajectory tracking problem, which is solved using a proportional-integral (PI controller. Due to uncertainties, obstacle avoidance is still not ensured, so an additional fuzzy controller is introduced, which corrects the control action of the PI controller. The proposed solution can be used even in dynamic environments, where obstacles change their position in time. Simulation studies were realized to validate and illustrate this approach.

  5. Enhanced Algorithms for EO/IR Electronic Stabilization, Clutter Suppression, and Track-Before-Detect for Multiple Low Observable Targets

    Science.gov (United States)

    Tartakovsky, A.; Brown, A.; Brown, J.

    The paper describes the development and evaluation of a suite of advanced algorithms which provide significantly-improved capabilities for finding, fixing, and tracking multiple ballistic and flying low observable objects in highly stressing cluttered environments. The algorithms have been developed for use in satellite-based staring and scanning optical surveillance suites for applications including theatre and intercontinental ballistic missile early warning, trajectory prediction, and multi-sensor track handoff for midcourse discrimination and intercept. The functions performed by the algorithms include electronic sensor motion compensation providing sub-pixel stabilization (to 1/100 of a pixel), as well as advanced temporal-spatial clutter estimation and suppression to below sensor noise levels, followed by statistical background modeling and Bayesian multiple-target track-before-detect filtering. The multiple-target tracking is performed in physical world coordinates to allow for multi-sensor fusion, trajectory prediction, and intercept. Output of detected object cues and data visualization are also provided. The algorithms are designed to handle a wide variety of real-world challenges. Imaged scenes may be highly complex and infinitely varied -- the scene background may contain significant celestial, earth limb, or terrestrial clutter. For example, when viewing combined earth limb and terrestrial scenes, a combination of stationary and non-stationary clutter may be present, including cloud formations, varying atmospheric transmittance and reflectance of sunlight and other celestial light sources, aurora, glint off sea surfaces, and varied natural and man-made terrain features. The targets of interest may also appear to be dim, relative to the scene background, rendering much of the existing deployed software useless for optical target detection and tracking. Additionally, it may be necessary to detect and track a large number of objects in the threat cloud

  6. Modified particle filtering algorithm for single acoustic vector sensor DOA tracking.

    Science.gov (United States)

    Li, Xinbo; Sun, Haixin; Jiang, Liangxu; Shi, Yaowu; Wu, Yue

    2015-10-16

    The conventional direction of arrival (DOA) estimation algorithm with static sources assumption usually estimates the source angles of two adjacent moments independently and the correlation of the moments is not considered. In this article, we focus on the DOA estimation of moving sources and a modified particle filtering (MPF) algorithm is proposed with state space model of single acoustic vector sensor. Although the particle filtering (PF) algorithm has been introduced for acoustic vector sensor applications, it is not suitable for the case that one dimension angle of source is estimated with large deviation, the two dimension angles (pitch angle and azimuth angle) cannot be simultaneously employed to update the state through resampling processing of PF algorithm. To solve the problems mentioned above, the MPF algorithm is proposed in which the state estimation of previous moment is introduced to the particle sampling of present moment to improve the importance function. Moreover, the independent relationship of pitch angle and azimuth angle is considered and the two dimension angles are sampled and evaluated, respectively. Then, the MUSIC spectrum function is used as the "likehood" function of the MPF algorithm, and the modified PF-MUSIC (MPF-MUSIC) algorithm is proposed to improve the root mean square error (RMSE) and the probability of convergence. The theoretical analysis and the simulation results validate the effectiveness and feasibility of the two proposed algorithms.

  7. Modified Particle Filtering Algorithm for Single Acoustic Vector Sensor DOA Tracking

    Directory of Open Access Journals (Sweden)

    Xinbo Li

    2015-10-01

    Full Text Available The conventional direction of arrival (DOA estimation algorithm with static sources assumption usually estimates the source angles of two adjacent moments independently and the correlation of the moments is not considered. In this article, we focus on the DOA estimation of moving sources and a modified particle filtering (MPF algorithm is proposed with state space model of single acoustic vector sensor. Although the particle filtering (PF algorithm has been introduced for acoustic vector sensor applications, it is not suitable for the case that one dimension angle of source is estimated with large deviation, the two dimension angles (pitch angle and azimuth angle cannot be simultaneously employed to update the state through resampling processing of PF algorithm. To solve the problems mentioned above, the MPF algorithm is proposed in which the state estimation of previous moment is introduced to the particle sampling of present moment to improve the importance function. Moreover, the independent relationship of pitch angle and azimuth angle is considered and the two dimension angles are sampled and evaluated, respectively. Then, the MUSIC spectrum function is used as the “likehood” function of the MPF algorithm, and the modified PF-MUSIC (MPF-MUSIC algorithm is proposed to improve the root mean square error (RMSE and the probability of convergence. The theoretical analysis and the simulation results validate the effectiveness and feasibility of the two proposed algorithms.

  8. Probabilistic Distributed Algorithms for Energy Efficient Routing and Tracking in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Paul G. Spirakis

    2009-02-01

    Full Text Available In this work we focus on the energy efficiency challenge in wireless sensor networks, from both an on-line perspective (related to routing, as well as a network design perspective (related to tracking. We investigate a few representative, important aspects of energy efficiency: a the robust and fast data propagation b the problem of balancing the energy dissipation among all sensors in the network and c the problem of efficiently tracking moving entities in sensor networks. Our work here is a methodological survey of selected results that have already appeared in the related literature. In particular, we investigate important issues of energy optimization, like minimizing the total energy dissipation, minimizing the number of transmissions as well as balancing the energy load to prolong the system’s lifetime. We review characteristic protocols and techniques in the recent literature, including probabilistic forwarding and local optimization methods. We study the problem of localizing and tracking multiple moving targets from a network design perspective i.e. towards estimating the least possible number of sensors, their positions and operation characteristics needed to efficiently perform the tracking task. To avoid an expensive massive deployment, we try to take advantage of possible coverage overlaps over space and time, by introducing a novel combinatorial model that captures such overlaps. Under this model, we abstract the tracking network design problem by a covering combinatorial problem and then design and analyze an efficient approximate method for sensor placement and operation.

  9. Tracking Amendments to Legislation and Other Political Texts with a Novel Minimum-Edit-Distance Algorithm: DocuToads

    DEFF Research Database (Denmark)

    Hermansson, Henrik Alf Jonas; Cross, James

    2015-01-01

    Political scientists often nd themselves tracking amendments to political texts. As different actors weigh in, texts change as they are drafted and redrafted, reflecting political preferences and power. This study provides a novel solution to the problem of detecting amendments to political text...... based upon minimum edit distances. We demonstrate the usefulness of two language-insensitive, transparent, and efficient minimum-edit-distance algorithms suited for the task. These algorithms are capable of providing an account of the types (insertions, deletions, substitutions, and transpositions......) and substantive amount of amendments made between version of texts. To illustrate the usefulness and eciency of the approach we replicate two existing studies from the field of legislative studies. Our results demonstrate that minimum edit distance methods can produce superior measures of text amendments to hand...

  10. Algorithms

    Indian Academy of Sciences (India)

    positive numbers. The word 'algorithm' was most often associated with this algorithm till 1950. It may however be pOinted out that several non-trivial algorithms such as synthetic (polynomial) division have been found in Vedic Mathematics which are dated much before Euclid's algorithm. A programming language Is used.

  11. A Hybrid Parallel Algorithm for Computing and Tracking Level Set Topology

    OpenAIRE

    Maadasamy, Senthilnathan; Doraiswamy, Harish; Natarajan, Vijay

    2012-01-01

    The contour tree is a topological abstraction of a scalar field that captures evolution in level set connectivity. It is an effective representation for visual exploration and analysis of scientific data. We describe a work-efficient, output sensitive, and scalable parallel algorithm for computing the contour tree of a scalar field defined on a domain that is represented using either an unstructured mesh or a structured grid. A hybrid implementation of the algorithm using the GPU and multi-co...

  12. Performance of the ATLAS track reconstruction algorithms in dense environments in LHC Run 2

    Energy Technology Data Exchange (ETDEWEB)

    Aaboud, M. [Univ. Mohamed Premier et LPTPM, Oujda (Morocco). Faculte des Sciences; Aad, G. [CPPM, Aix-Marseille Univ. et CNRS/IN2P3, Marseille (France); Abbott, B. [Oklahoma Univ., Norman, OK (United States). Homer L. Dodge Dept. of Physics and Astronomy; Collaboration: ATLAS Collaboration; and others

    2017-10-15

    With the increase in energy of the Large Hadron Collider to a centre-of-mass energy of 13 TeV for Run 2, events with dense environments, such as in the cores of high-energy jets, became a focus for new physics searches as well as measurements of the Standard Model. These environments are characterized by charged-particle separations of the order of the tracking detectors sensor granularity. Basic track quantities are compared between 3.2 fb{sup -1} of data collected by the ATLAS experiment and simulation of proton-proton collisions producing high-transverse-momentum jets at a centre-of-mass energy of 13 TeV. The impact of charged-particle separations and multiplicities on the track reconstruction performance is discussed. The track reconstruction efficiency in the cores of jets with transverse momenta between 200 and 1600 GeV is quantified using a novel, data-driven, method. The method uses the energy loss, dE/dx, to identify pixel clusters originating from two charged particles. Of the charged particles creating these clusters, the measured fraction that fail to be reconstructed is 0.061 ± 0.006(stat.) ± 0.014(syst.) and 0.093 ± 0.017(stat.) ± 0.021(syst.) for jet transverse momenta of 200-400 GeV and 1400-1600 GeV, respectively. (orig.)

  13. Performance of the ATLAS track reconstruction algorithms in dense environments in LHC Run 2.

    Science.gov (United States)

    Aaboud, M; Aad, G; Abbott, B; Abdallah, J; Abdinov, O; Abeloos, B; Abidi, S H; AbouZeid, O S; Abraham, N L; Abramowicz, H; Abreu, H; Abreu, R; Abulaiti, Y; Acharya, B S; Adachi, S; Adamczyk, L; Adelman, J; Adersberger, M; Adye, T; Affolder, A A; Agatonovic-Jovin, T; Agheorghiesei, C; Aguilar-Saavedra, J A; Ahlen, S P; Ahmadov, F; Aielli, G; Akatsuka, S; Akerstedt, H; Åkesson, T P A; Akimov, A V; Alberghi, G L; Albert, J; Albicocco, P; Alconada Verzini, M J; Aleksa, M; Aleksandrov, I N; Alexa, C; Alexander, G; Alexopoulos, T; Alhroob, M; Ali, B; Aliev, M; Alimonti, G; Alison, J; Alkire, S P; Allbrooke, B M M; Allen, B W; Allport, P P; Aloisio, A; Alonso, A; Alonso, F; Alpigiani, C; Alshehri, A A; Alstaty, M; Alvarez Gonzalez, B; Álvarez Piqueras, D; Alviggi, M G; Amadio, B T; Amaral Coutinho, Y; Amelung, C; Amidei, D; Santos, S P Amor Dos; Amorim, A; Amoroso, S; Amundsen, G; Anastopoulos, C; Ancu, L S; Andari, N; Andeen, T; Anders, C F; Anders, J K; Anderson, K J; Andreazza, A; Andrei, V; Angelidakis, S; Angelozzi, I; Angerami, A; Anisenkov, A V; Anjos, N; Annovi, A; Antel, C; Antonelli, M; Antonov, A; Antrim, D J; Anulli, F; Aoki, M; Aperio Bella, L; Arabidze, G; Arai, Y; Araque, J P; Araujo Ferraz, V; Arce, A T H; Ardell, R E; Arduh, F A; Arguin, J-F; Argyropoulos, S; Arik, M; Armbruster, A J; Armitage, L J; Arnaez, O; Arnold, H; Arratia, M; Arslan, O; Artamonov, A; Artoni, G; Artz, S; Asai, S; Asbah, N; Ashkenazi, A; Asquith, L; Assamagan, K; Astalos, R; Atkinson, M; Atlay, N B; Augsten, K; Avolio, G; Axen, B; Ayoub, M K; Azuelos, G; Baas, A E; Baca, M J; Bachacou, H; Bachas, K; Backes, M; Backhaus, M; Bagnaia, P; Bahrasemani, H; Baines, J T; Bajic, M; Baker, O K; Baldin, E M; Balek, P; Balli, F; Balunas, W K; Banas, E; Banerjee, Sw; Bannoura, A A E; Barak, L; Barberio, E L; Barberis, D; Barbero, M; Barillari, T; Barisits, M-S; Barklow, T; Barlow, N; Barnes, S L; Barnett, B M; Barnett, R M; Barnovska-Blenessy, Z; Baroncelli, A; Barone, G; Barr, A J; Barranco Navarro, L; Barreiro, F; Barreiro Guimarães da Costa, J; Bartoldus, R; Barton, A E; Bartos, P; Basalaev, A; Bassalat, A; Bates, R L; Batista, S J; Batley, J R; Battaglia, M; Bauce, M; Bauer, F; Bawa, H S; Beacham, J B; Beattie, M D; Beau, T; Beauchemin, P H; Bechtle, P; Beck, H P; Becker, K; Becker, M; Beckingham, M; Becot, C; Beddall, A J; Beddall, A; Bednyakov, V A; Bedognetti, M; Bee, C P; Beermann, T A; Begalli, M; Begel, M; Behr, J K; Bell, A S; Bella, G; Bellagamba, L; Bellerive, A; Bellomo, M; Belotskiy, K; Beltramello, O; Belyaev, N L; Benary, O; Benchekroun, D; Bender, M; Bendtz, K; Benekos, N; Benhammou, Y; Benhar Noccioli, E; Benitez, J; Benjamin, D P; Benoit, M; Bensinger, J R; Bentvelsen, S; Beresford, L; Beretta, M; Berge, D; Bergeaas Kuutmann, E; Berger, N; Beringer, J; Berlendis, S; Bernard, N R; Bernardi, G; Bernius, C; Bernlochner, F U; Berry, T; Berta, P; Bertella, C; Bertoli, G; Bertolucci, F; Bertram, I A; Bertsche, C; Bertsche, D; Besjes, G J; Bessidskaia Bylund, O; Bessner, M; Besson, N; Betancourt, C; Bethani, A; Bethke, S; Bevan, A J; Beyer, J; Bianchi, R M; Biebel, O; Biedermann, D; Bielski, R; Biesuz, N V; Biglietti, M; Billoud, T R V; Bilokon, H; Bindi, M; Bingul, A; Bini, C; Biondi, S; Bisanz, T; Bittrich, C; Bjergaard, D M; Black, C W; Black, J E; Black, K M; Blair, R E; Blazek, T; Bloch, I; Blocker, C; Blue, A; Blum, W; Blumenschein, U; Blunier, S; Bobbink, G J; Bobrovnikov, V S; Bocchetta, S S; Bocci, A; Bock, C; Boehler, M; Boerner, D; Bogavac, D; Bogdanchikov, A G; Bohm, C; Boisvert, V; Bokan, P; Bold, T; Boldyrev, A S; Bolz, A E; Bomben, M; Bona, M; Boonekamp, M; Borisov, A; Borissov, G; Bortfeldt, J; Bortoletto, D; Bortolotto, V; Boscherini, D; Bosman, M; Bossio Sola, J D; Boudreau, J; Bouffard, J; Bouhova-Thacker, E V; Boumediene, D; Bourdarios, C; Boutle, S K; Boveia, A; Boyd, J; Boyko, I R; Bracinik, J; Brandt, A; Brandt, G; Brandt, O; Bratzler, U; Brau, B; Brau, J E; Breaden Madden, W D; Brendlinger, K; Brennan, A J; Brenner, L; Brenner, R; Bressler, S; Briglin, D L; Bristow, T M; Britton, D; Britzger, D; Brochu, F M; Brock, I; Brock, R; Brooijmans, G; Brooks, T; Brooks, W K; Brosamer, J; Brost, E; Broughton, J H; de Renstrom, P A Bruckman; Bruncko, D; Bruni, A; Bruni, G; Bruni, L S; Brunt, B H; Bruschi, M; Bruscino, N; Bryant, P; Bryngemark, L; Buanes, T; Buat, Q; Buchholz, P; Buckley, A G; Budagov, I A; Buehrer, F; Bugge, M K; Bulekov, O; Bullock, D; Burch, T J; Burckhart, H; Burdin, S; Burgard, C D; Burger, A M; Burghgrave, B; Burka, K; Burke, S; Burmeister, I; Burr, J T P; Busato, E; Büscher, D; Büscher, V; Bussey, P; Butler, J M; Buttar, C M; Butterworth, J M; Butti, P; Buttinger, W; Buzatu, A; Buzykaev, A R; Cabrera Urbán, S; Caforio, D; Cairo, V M; Cakir, O; Calace, N; Calafiura, P; Calandri, A; Calderini, G; Calfayan, P; Callea, G; Caloba, L P; Calvente Lopez, S; Calvet, D; Calvet, S; Calvet, T P; Camacho Toro, R; Camarda, S; Camarri, P; Cameron, D; Caminal Armadans, R; Camincher, C; Campana, S; Campanelli, M; Camplani, A; Campoverde, A; Canale, V; Cano Bret, M; Cantero, J; Cao, T; Capeans Garrido, M D M; Caprini, I; Caprini, M; Capua, M; Carbone, R M; Cardarelli, R; Cardillo, F; Carli, I; Carli, T; Carlino, G; Carlson, B T; Carminati, L; Carney, R M D; Caron, S; Carquin, E; Carrá, S; Carrillo-Montoya, G D; Carvalho, J; Casadei, D; Casado, M P; Casolino, M; Casper, D W; Castelijn, R; Castillo Gimenez, V; Castro, N F; Catinaccio, A; Catmore, J R; Cattai, A; Caudron, J; Cavaliere, V; Cavallaro, E; Cavalli, D; Cavalli-Sforza, M; Cavasinni, V; Celebi, E; Ceradini, F; Cerda Alberich, L; Cerqueira, A S; Cerri, A; Cerrito, L; Cerutti, F; Cervelli, A; Cetin, S A; Chafaq, A; Chakraborty, D; Chan, S K; Chan, W S; Chan, Y L; Chang, P; Chapman, J D; Charlton, D G; Chau, C C; Chavez Barajas, C A; Che, S; Cheatham, S; Chegwidden, A; Chekanov, S; Chekulaev, S V; Chelkov, G A; Chelstowska, M A; Chen, C; Chen, H; Chen, S; Chen, S; Chen, X; Chen, Y; Cheng, H C; Cheng, H J; Cheplakov, A; Cheremushkina, E; Cherkaoui El Moursli, R; Chernyatin, V; Cheu, E; Chevalier, L; Chiarella, V; Chiarelli, G; Chiodini, G; Chisholm, A S; Chitan, A; Chiu, Y H; Chizhov, M V; Choi, K; Chomont, A R; Chouridou, S; Christodoulou, V; Chromek-Burckhart, D; Chu, M C; Chudoba, J; Chuinard, A J; Chwastowski, J J; Chytka, L; Ciftci, A K; Cinca, D; Cindro, V; Cioara, I A; Ciocca, C; Ciocio, A; Cirotto, F; Citron, Z H; Citterio, M; Ciubancan, M; Clark, A; Clark, B L; Clark, M R; Clark, P J; Clarke, R N; Clement, C; Coadou, Y; Cobal, M; Coccaro, A; Cochran, J; Colasurdo, L; Cole, B; Colijn, A P; Collot, J; Colombo, T; Conde Muiño, P; Coniavitis, E; Connell, S H; Connelly, I A; Constantinescu, S; Conti, G; Conventi, F; Cooke, M; Cooper-Sarkar, A M; Cormier, F; Cormier, K J R; Corradi, M; Corriveau, F; Cortes-Gonzalez, A; Cortiana, G; Costa, G; Costa, M J; Costanzo, D; Cottin, G; Cowan, G; Cox, B E; Cranmer, K; Crawley, S J; Creager, R A; Cree, G; Crépé-Renaudin, S; Crescioli, F; Cribbs, W A; Cristinziani, M; Croft, V; Crosetti, G; Cueto, A; Cuhadar Donszelmann, T; Cukierman, A R; Cummings, J; Curatolo, M; Cúth, J; Czirr, H; Czodrowski, P; D'amen, G; D'Auria, S; D'eramo, L; D'Onofrio, M; Da Cunha Sargedas De Sousa, M J; Via, C Da; Dabrowski, W; Dado, T; Dai, T; Dale, O; Dallaire, F; Dallapiccola, C; Dam, M; Dandoy, J R; Daneri, M F; Dang, N P; Daniells, A C; Dann, N S; Danninger, M; Hoffmann, M Dano; Dao, V; Darbo, G; Darmora, S; Dassoulas, J; Dattagupta, A; Daubney, T; Davey, W; David, C; Davidek, T; Davies, M; Davis, D R; Davison, P; Dawe, E; Dawson, I; De, K; de Asmundis, R; De Benedetti, A; De Castro, S; De Cecco, S; De Groot, N; de Jong, P; De la Torre, H; De Lorenzi, F; De Maria, A; De Pedis, D; De Salvo, A; De Sanctis, U; De Santo, A; De Vasconcelos Corga, K; De Vivie De Regie, J B; Dearnaley, W J; Debbe, R; Debenedetti, C; Dedovich, D V; Dehghanian, N; Deigaard, I; Del Gaudio, M; Del Peso, J; Prete, T Del; Delgove, D; Deliot, F; Delitzsch, C M; Dell'Acqua, A; Dell'Asta, L; Dell'Orso, M; Della Pietra, M; Della Volpe, D; Delmastro, M; Delporte, C; Delsart, P A; DeMarco, D A; Demers, S; Demichev, M; Demilly, A; Denisov, S P; Denysiuk, D; Derendarz, D; Derkaoui, J E; Derue, F; Dervan, P; Desch, K; Deterre, C; Dette, K; Devesa, M R; Deviveiros, P O; Dewhurst, A; Dhaliwal, S; Di Bello, F A; Di Ciaccio, A; Di Ciaccio, L; Di Clemente, W K; Di Donato, C; Di Girolamo, A; Di Girolamo, B; Di Micco, B; Di Nardo, R; Di Petrillo, K F; Di Simone, A; Di Sipio, R; Di Valentino, D; Diaconu, C; Diamond, M; Dias, F A; Diaz, M A; Diehl, E B; Dietrich, J; Díez Cornell, S; Dimitrievska, A; Dingfelder, J; Dita, P; Dita, S; Dittus, F; Djama, F; Djobava, T; Djuvsland, J I; do Vale, M A B; Dobos, D; Dobre, M; Doglioni, C; Dolejsi, J; Dolezal, Z; Donadelli, M; Donati, S; Dondero, P; Donini, J; Dopke, J; Doria, A; Dova, M T; Doyle, A T; Drechsler, E; Dris, M; Du, Y; Duarte-Campderros, J; Dubreuil, A; Duchovni, E; Duckeck, G; Ducourthial, A; Ducu, O A; Duda, D; Dudarev, A; Dudder, A Chr; Duffield, E M; Duflot, L; Dührssen, M; Dumancic, M; Dumitriu, A E; Duncan, A K; Dunford, M; Duran Yildiz, H; Düren, M; Durglishvili, A; Duschinger, D; Dutta, B; Dyndal, M; Eckardt, C; Ecker, K M; Edgar, R C; Eifert, T; Eigen, G; Einsweiler, K; Ekelof, T; Kacimi, M El; Kosseifi, R El; Ellajosyula, V; Ellert, M; Elles, S; Ellinghaus, F; Elliot, A A; Ellis, N; Elmsheuser, J; Elsing, M; Emeliyanov, D; Enari, Y; Endner, O C; Ennis, J S; Erdmann, J; Ereditato, A; Ernis, G; Ernst, M; Errede, S; Escalier, M; Escobar, C; Esposito, B; Estrada Pastor, O; Etienvre, A I; Etzion, E; Evans, H; Ezhilov, A; Ezzi, M; Fabbri, F; Fabbri, L; Facini, G; Fakhrutdinov, R M; Falciano, S; Falla, R J; Faltova, J; Fang, Y; Fanti, M; Farbin, A; Farilla, A; Farina, C; Farina, E M; Farooque, T; Farrell, S; Farrington, S M; Farthouat, P; Fassi, F; Fassnacht, P; Fassouliotis, D; Faucci Giannelli, M; Favareto, A; Fawcett, W J; Fayard, L; Fedin, O L; Fedorko, W; Feigl, S; Feligioni, L; Feng, C; Feng, E J; Feng, H; Fenton, M J; Fenyuk, A B; Feremenga, L; Fernandez Martinez, P; Fernandez Perez, S; Ferrando, J; Ferrari, A; Ferrari, P; Ferrari, R; Ferreira de Lima, D E; Ferrer, A; Ferrere, D; Ferretti, C; Fiedler, F; Filipčič, A; Filipuzzi, M; Filthaut, F; Fincke-Keeler, M; Finelli, K D; Fiolhais, M C N; Fiorini, L; Fischer, A; Fischer, C; Fischer, J; Fisher, W C; Flaschel, N; Fleck, I; Fleischmann, P; Fletcher, R R M; Flick, T; Flierl, B M; Flores Castillo, L R; Flowerdew, M J; Forcolin, G T; Formica, A; Förster, F A; Forti, A; Foster, A G; Fournier, D; Fox, H; Fracchia, S; Francavilla, P; Franchini, M; Franchino, S; Francis, D; Franconi, L; Franklin, M; Frate, M; Fraternali, M; Freeborn, D; Fressard-Batraneanu, S M; Freund, B; Froidevaux, D; Frost, J A; Fukunaga, C; Fusayasu, T; Fuster, J; Gabaldon, C; Gabizon, O; Gabrielli, A; Gabrielli, A; Gach, G P; Gadatsch, S; Gadomski, S; Gagliardi, G; Gagnon, L G; Galea, C; Galhardo, B; Gallas, E J; Gallop, B J; Gallus, P; Galster, G; Gan, K K; Ganguly, S; Gao, Y; Gao, Y S; Garay Walls, F M; García, C; García Navarro, J E; Garcia-Sciveres, M; Gardner, R W; Garelli, N; Garonne, V; Gascon Bravo, A; Gasnikova, K; Gatti, C; Gaudiello, A; Gaudio, G; Gavrilenko, I L; Gay, C; Gaycken, G; Gazis, E N; Gee, C N P; Geisen, J; Geisen, M; Geisler, M P; Gellerstedt, K; Gemme, C; Genest, M H; Geng, C; Gentile, S; Gentsos, C; George, S; Gerbaudo, D; Gershon, A; Geßner, G; Ghasemi, S; Ghneimat, M; Giacobbe, B; Giagu, S; Giannetti, P; Gibson, S M; Gignac, M; Gilchriese, M; Gillberg, D; Gilles, G; Gingrich, D M; Giokaris, N; Giordani, M P; Giorgi, F M; Giraud, P F; Giromini, P; Giugni, D; Giuli, F; Giuliani, C; Giulini, M; Gjelsten, B K; Gkaitatzis, S; Gkialas, I; Gkougkousis, E L; Gkountoumis, P; Gladilin, L K; Glasman, C; Glatzer, J; Glaysher, P C F; Glazov, A; Goblirsch-Kolb, M; Godlewski, J; Goldfarb, S; Golling, T; Golubkov, D; Gomes, A; Gonçalo, R; Goncalves Gama, R; Goncalves Pinto Firmino Da Costa, J; Gonella, G; Gonella, L; Gongadze, A; González de la Hoz, S; Gonzalez-Sevilla, S; Goossens, L; Gorbounov, P A; Gordon, H A; Gorelov, I; Gorini, B; Gorini, E; Gorišek, A; Goshaw, A T; Gössling, C; Gostkin, M I; Gottardo, C A; Goudet, C R; Goujdami, D; Goussiou, A G; Govender, N; Gozani, E; Graber, L; Grabowska-Bold, I; Gradin, P O J; Gramling, J; Gramstad, E; Grancagnolo, S; Gratchev, V; Gravila, P M; Gray, C; Gray, H M; Greenwood, Z D; Grefe, C; Gregersen, K; Gregor, I M; Grenier, P; Grevtsov, K; Griffiths, J; Grillo, A A; Grimm, K; Grinstein, S; Gris, Ph; Grivaz, J-F; Groh, S; Gross, E; Grosse-Knetter, J; Grossi, G C; Grout, Z J; Grummer, A; Guan, L; Guan, W; Guenther, J; Guescini, F; Guest, D; Gueta, O; Gui, B; Guido, E; Guillemin, T; Guindon, S; Gul, U; Gumpert, C; Guo, J; Guo, W; Guo, Y; Gupta, R; Gupta, S; Gustavino, G; Gutierrez, P; Gutierrez Ortiz, N G; Gutschow, C; Guyot, C; Guzik, M P; Gwenlan, C; Gwilliam, C B; Haas, A; Haber, C; Hadavand, H K; Haddad, N; Hadef, A; Hageböck, S; Hagihara, M; Hakobyan, H; Haleem, M; Haley, J; Halladjian, G; Hallewell, G D; Hamacher, K; Hamal, P; Hamano, K; Hamilton, A; Hamity, G N; Hamnett, P G; Han, L; Han, S; Hanagaki, K; Hanawa, K; Hance, M; Haney, B; Hanke, P; Hansen, J B; Hansen, J D; Hansen, M C; Hansen, P H; Hara, K; Hard, A S; Harenberg, T; Hariri, F; Harkusha, S; Harrington, R D; Harrison, P F; Hartmann, N M; Hasegawa, M; Hasegawa, Y; Hasib, A; Hassani, S; Haug, S; Hauser, R; Hauswald, L; Havener, L B; Havranek, M; Hawkes, C M; Hawkings, R J; Hayakawa, D; Hayden, D; Hays, C P; Hays, J M; Hayward, H S; Haywood, S J; Head, S J; Heck, T; Hedberg, V; Heelan, L; Heidegger, K K; Heim, S; Heim, T; Heinemann, B; Heinrich, J J; Heinrich, L; Heinz, C; Hejbal, J; Helary, L; Held, A; Hellman, S; Helsens, C; Henderson, R C W; Heng, Y; Henkelmann, S; Henriques Correia, A M; Henrot-Versille, S; Herbert, G H; Herde, H; Herget, V; Hernández Jiménez, Y; Herr, H; Herten, G; Hertenberger, R; Hervas, L; Herwig, T C; Hesketh, G G; Hessey, N P; Hetherly, J W; Higashino, S; Higón-Rodriguez, E; Hill, E; Hill, J C; Hiller, K H; Hillier, S J; Hils, M; Hinchliffe, I; Hirose, M; Hirschbuehl, D; Hiti, B; Hladik, O; Hoad, X; Hobbs, J; Hod, N; Hodgkinson, M C; Hodgson, P; Hoecker, A; Hoeferkamp, M R; Hoenig, F; Hohn, D; Holmes, T R; Homann, M; Honda, S; Honda, T; Hong, T M; Hooberman, B H; Hopkins, W H; Horii, Y; Horton, A J; Hostachy, J-Y; Hou, S; Hoummada, A; Howarth, J; Hoya, J; Hrabovsky, M; Hrdinka, J; Hristova, I; Hrivnac, J; Hryn'ova, T; Hrynevich, A; Hsu, P J; Hsu, S-C; Hu, Q; Hu, S; Huang, Y; Hubacek, Z; Hubaut, F; Huegging, F; Huffman, T B; Hughes, E W; Hughes, G; Huhtinen, M; Huo, P; Huseynov, N; Huston, J; Huth, J; Iacobucci, G; Iakovidis, G; Ibragimov, I; Iconomidou-Fayard, L; Idrissi, Z; Iengo, P; Igonkina, O; Iizawa, T; Ikegami, Y; Ikeno, M; Ilchenko, Y; Iliadis, D; Ilic, N; Introzzi, G; Ioannou, P; Iodice, M; Iordanidou, K; Ippolito, V; Isacson, M F; Ishijima, N; Ishino, M; Ishitsuka, M; Issever, C; Istin, S; Ito, F; Iturbe Ponce, J M; Iuppa, R; Iwasaki, H; Izen, J M; Izzo, V; Jabbar, S; Jackson, P; Jacobs, R M; Jain, V; Jakobi, K B; Jakobs, K; Jakobsen, S; Jakoubek, T; Jamin, D O; Jana, D K; Jansky, R; Janssen, J; Janus, M; Janus, P A; Jarlskog, G; Javadov, N; Javůrek, T; Javurkova, M; Jeanneau, F; Jeanty, L; Jejelava, J; Jelinskas, A; Jenni, P; Jeske, C; Jézéquel, S; Ji, H; Jia, J; Jiang, H; Jiang, Y; Jiang, Z; Jiggins, S; Jimenez Pena, J; Jin, S; Jinaru, A; Jinnouchi, O; Jivan, H; Johansson, P; Johns, K A; Johnson, C A; Johnson, W J; Jon-And, K; Jones, R W L; Jones, S D; Jones, S; Jones, T J; Jongmanns, J; Jorge, P M; Jovicevic, J; Ju, X; Rozas, A Juste; Köhler, M K; Kaczmarska, A; Kado, M; Kagan, H; Kagan, M; Kahn, S J; Kaji, T; Kajomovitz, E; Kalderon, C W; Kaluza, A; Kama, S; Kamenshchikov, A; Kanaya, N; Kanjir, L; Kantserov, V A; Kanzaki, J; Kaplan, B; Kaplan, L S; Kar, D; Karakostas, K; Karastathis, N; Kareem, M J; Karentzos, E; Karpov, S N; Karpova, Z M; Karthik, K; Kartvelishvili, V; Karyukhin, A N; Kasahara, K; Kashif, L; Kass, R D; Kastanas, A; Kataoka, Y; Kato, C; Katre, A; Katzy, J; Kawade, K; Kawagoe, K; Kawamoto, T; Kawamura, G; Kay, E F; Kazanin, V F; Keeler, R; Kehoe, R; Keller, J S; Kempster, J J; Kendrick, J; Keoshkerian, H; Kepka, O; Kerševan, B P; Kersten, S; Keyes, R A; Khader, M; Khalil-Zada, F; Khanov, A; Kharlamov, A G; Kharlamova, T; Khodinov, A; Khoo, T J; Khovanskiy, V; Khramov, E; Khubua, J; Kido, S; Kilby, C R; Kim, H Y; Kim, S H; Kim, Y K; Kimura, N; Kind, O M; King, B T; Kirchmeier, D; Kirk, J; Kiryunin, A E; Kishimoto, T; Kisielewska, D; Kitali, V; Kiuchi, K; Kivernyk, O; Kladiva, E; Klapdor-Kleingrothaus, T; Klein, M H; Klein, M; Klein, U; Kleinknecht, K; Klimek, P; Klimentov, A; Klingenberg, R; Klingl, T; Klioutchnikova, T; Kluge, E-E; Kluit, P; Kluth, S; Kneringer, E; Knoops, E B F G; Knue, A; Kobayashi, A; Kobayashi, D; Kobayashi, T; Kobel, M; Kocian, M; Kodys, P; Koffas, T; Koffeman, E; Köhler, N M; Koi, T; Kolb, M; Koletsou, I; Komar, A A; Komori, Y; Kondo, T; Kondrashova, N; Köneke, K; König, A C; Kono, T; Konoplich, R; Konstantinidis, N; Kopeliansky, R; Koperny, S; Kopp, A K; Korcyl, K; Kordas, K; Korn, A; Korol, A A; Korolkov, I; Korolkova, E V; Kortner, O; Kortner, S; Kosek, T; Kostyukhin, V V; Kotwal, A; Koulouris, A; Kourkoumeli-Charalampidi, A; Kourkoumelis, C; Kourlitis, E; Kouskoura, V; Kowalewska, A B; Kowalewski, R; Kowalski, T Z; Kozakai, C; Kozanecki, W; Kozhin, A S; Kramarenko, V A; Kramberger, G; Krasnopevtsev, D; Krasny, M W; Krasznahorkay, A; Krauss, D; Kremer, J A; Kretzschmar, J; Kreutzfeldt, K; Krieger, P; Krizka, K; Kroeninger, K; Kroha, H; Kroll, J; Kroll, J; Kroseberg, J; Krstic, J; Kruchonak, U; Krüger, H; Krumnack, N; Kruse, M C; Kubota, T; Kucuk, H; Kuday, S; Kuechler, J T; Kuehn, S; Kugel, A; Kuger, F; Kuhl, T; Kukhtin, V; Kukla, R; Kulchitsky, Y; Kuleshov, S; Kulinich, Y P; Kuna, M; Kunigo, T; Kupco, A; Kupfer, T; Kuprash, O; Kurashige, H; Kurchaninov, L L; Kurochkin, Y A; Kurth, M G; Kus, V; Kuwertz, E S; Kuze, M; Kvita, J; Kwan, T; Kyriazopoulos, D; La Rosa, A; La Rosa Navarro, J L; La Rotonda, L; Lacasta, C; Lacava, F; Lacey, J; Lacker, H; Lacour, D; Ladygin, E; Lafaye, R; Laforge, B; Lagouri, T; Lai, S; Lammers, S; Lampl, W; Lançon, E; Landgraf, U; Landon, M P J; Lanfermann, M C; Lang, V S; Lange, J C; Langenberg, R J; Lankford, A J; Lanni, F; Lantzsch, K; Lanza, A; Lapertosa, A; Laplace, S; Laporte, J F; Lari, T; Manghi, F Lasagni; Lassnig, M; Laurelli, P; Lavrijsen, W; Law, A T; Laycock, P; Lazovich, T; Lazzaroni, M; Le, B; Le Dortz, O; Le Guirriec, E; Le Quilleuc, E P; LeBlanc, M; LeCompte, T; Ledroit-Guillon, F; Lee, C A; Lee, G R; Lee, S C; Lee, L; Lefebvre, B; Lefebvre, G; Lefebvre, M; Legger, F; Leggett, C; Lehan, A; Lehmann Miotto, G; Lei, X; Leight, W A; Leite, M A L; Leitner, R; Lellouch, D; Lemmer, B; Leney, K J C; Lenz, T; Lenzi, B; Leone, R; Leone, S; Leonidopoulos, C; Lerner, G; Leroy, C; Lesage, A A J; Lester, C G; Levchenko, M; Levêque, J; Levin, D; Levinson, L J; Levy, M; Lewis, D; Li, B; Li, H; Li, L; Li, Q; Li, S; Li, X; Li, Y; Liang, Z; Liberti, B; Liblong, A; Lie, K; Liebal, J; Liebig, W; Limosani, A; Lin, S C; Lin, T H; Lindquist, B E; Lionti, A E; Lipeles, E; Lipniacka, A; Lisovyi, M; Liss, T M; Lister, A; Litke, A M; Liu, B; Liu, H; Liu, H; Liu, J K K; Liu, J; Liu, J B; Liu, K; Liu, L; Liu, M; Liu, Y L; Liu, Y; Livan, M; Lleres, A; Llorente Merino, J; Lloyd, S L; Lo, C Y; Sterzo, F Lo; Lobodzinska, E M; Loch, P; Loebinger, F K; Loesle, A; Loew, K M; Loginov, A; Lohse, T; Lohwasser, K; Lokajicek, M; Long, B A; Long, J D; Long, R E; Longo, L; Looper, K A; Lopez, J A; Lopez Mateos, D; Lopez Paz, I; Solis, A Lopez; Lorenz, J; Lorenzo Martinez, N; Losada, M; Lösel, P J; Lou, X; Lounis, A; Love, J; Love, P A; Lu, H; Lu, N; Lu, Y J; Lubatti, H J; Luci, C; Lucotte, A; Luedtke, C; Luehring, F; Lukas, W; Luminari, L; Lundberg, O; Lund-Jensen, B; Luzi, P M; Lynn, D; Lysak, R; Lytken, E; Lyubushkin, V; Ma, H; Ma, L L; Ma, Y; Maccarrone, G; Macchiolo, A; Macdonald, C M; Maček, B; Machado Miguens, J; Madaffari, D; Madar, R; Mader, W F; Madsen, A; Maeda, J; Maeland, S; Maeno, T; Maevskiy, A S; Magerl, V; Mahlstedt, J; Maiani, C; Maidantchik, C; Maier, A A; Maier, T; Maio, A; Majersky, O; Majewski, S; Makida, Y; Makovec, N; Malaescu, B; Malecki, Pa; Maleev, V P; Malek, F; Mallik, U; Malon, D; Malone, C; Maltezos, S; Malyukov, S; Mamuzic, J; Mancini, G; Mandelli, L; Mandić, I; Maneira, J; Manhaes de Andrade Filho, L; Manjarres Ramos, J; Mann, A; Manousos, A; Mansoulie, B; Mansour, J D; Mantifel, R; Mantoani, M; Manzoni, S; Mapelli, L; Marceca, G; March, L; Marchese, L; Marchiori, G; Marcisovsky, M; Marjanovic, M; Marley, D E; Marroquim, F; Marsden, S P; Marshall, Z; Martensson, M U F; Marti-Garcia, S; Martin, C B; Martin, T A; Martin, V J; Martin Dit Latour, B; Martinez, M; Martinez Outschoorn, V I; Martin-Haugh, S; Martoiu, V S; Martyniuk, A C; Marzin, A; Masetti, L; Mashimo, T; Mashinistov, R; Masik, J; Maslennikov, A L; Massa, L; Mastrandrea, P; Mastroberardino, A; Masubuchi, T; Mättig, P; Maurer, J; Maxfield, S J; Maximov, D A; Mazini, R; Maznas, I; Mazza, S M; Mc Fadden, N C; Goldrick, G Mc; Mc Kee, S P; McCarn, A; McCarthy, R L; McCarthy, T G; McClymont, L I; McDonald, E F; Mcfayden, J A; Mchedlidze, G; McMahon, S J; McNamara, P C; McPherson, R A; Meehan, S; Megy, T J; Mehlhase, S; Mehta, A; Meideck, T; Meier, K; Meirose, B; Melini, D; Mellado Garcia, B R; Mellenthin, J D; Melo, M; Meloni, F; Menary, S B; Meng, L; Meng, X T; Mengarelli, A; Menke, S; Meoni, E; Mergelmeyer, S; Mermod, P; Merola, L; Meroni, C; Merritt, F S; Messina, A; Metcalfe, J; Mete, A S; Meyer, C; Meyer, J-P; Meyer, J; Meyer Zu Theenhausen, H; Miano, F; Middleton, R P; Miglioranzi, S; Mijović, L; Mikenberg, G; Mikestikova, M; Mikuž, M; Milesi, M; Milic, A; Miller, D W; Mills, C; Milov, A; Milstead, D A; Minaenko, A A; Minami, Y; Minashvili, I A; Mincer, A I; Mindur, B; Mineev, M; Minegishi, Y; Ming, Y; Mir, L M; Mistry, K P; Mitani, T; Mitrevski, J; Mitsou, V A; Miucci, A; Miyagawa, P S; Mizukami, A; Mjörnmark, J U; Mkrtchyan, T; Mlynarikova, M; Moa, T; Mochizuki, K; Mogg, P; Mohapatra, S; Molander, S; Moles-Valls, R; Monden, R; Mondragon, M C; Mönig, K; Monk, J; Monnier, E; Montalbano, A; Montejo Berlingen, J; Monticelli, F; Monzani, S; Moore, R W; Morange, N; Moreno, D; Moreno Llácer, M; Morettini, P; Morgenstern, S; Mori, D; Mori, T; Morii, M; Morinaga, M; Morisbak, V; Morley, A K; Mornacchi, G; Morris, J D; Morvaj, L; Moschovakos, P; Mosidze, M; Moss, H J; Moss, J; Motohashi, K; Mount, R; Mountricha, E; Moyse, E J W; Muanza, S; Mudd, R D; Mueller, F; Mueller, J; Mueller, R S P; Muenstermann, D; Mullen, P; Mullier, G A; Munoz Sanchez, F J; Murray, W J; Musheghyan, H; Muškinja, M; Myagkov, A G; Myska, M; Nachman, B P; Nackenhorst, O; Nagai, K; Nagai, R; Nagano, K; Nagasaka, Y; Nagata, K; Nagel, M; Nagy, E; Nairz, A M; Nakahama, Y; Nakamura, K; Nakamura, T; Nakano, I; Naranjo Garcia, R F; Narayan, R; Narrias Villar, D I; Naryshkin, I; Naumann, T; Navarro, G; Nayyar, R; Neal, H A; Nechaeva, P Yu; Neep, T J; Negri, A; Negrini, M; Nektarijevic, S; Nellist, C; Nelson, A; Nelson, M E; Nemecek, S; Nemethy, P; Nessi, M; Neubauer, M S; Neumann, M; Newman, P R; Ng, T Y; Nguyen Manh, T; Nickerson, R B; Nicolaidou, R; Nielsen, J; Nikolaenko, V; Nikolic-Audit, I; Nikolopoulos, K; Nilsen, J K; Nilsson, P; Ninomiya, Y; Nisati, A; Nishu, N; Nisius, R; Nitsche, I; Nobe, T; Noguchi, Y; Nomachi, M; Nomidis, I; Nomura, M A; Nooney, T; Nordberg, M; Norjoharuddeen, N; Novgorodova, O; Nowak, S; Nozaki, M; Nozka, L; Ntekas, K; Nurse, E; Nuti, F; O'connor, K; O'Neil, D C; O'Rourke, A A; O'Shea, V; Oakham, F G; Oberlack, H; Obermann, T; Ocariz, J; Ochi, A; Ochoa, I; Ochoa-Ricoux, J P; Oda, S; Odaka, S; Ogren, H; Oh, A; Oh, S H; Ohm, C C; Ohman, H; Oide, H; Okawa, H; Okumura, Y; Okuyama, T; Olariu, A; Oleiro Seabra, L F; Olivares Pino, S A; Oliveira Damazio, D; Olszewski, A; Olszowska, J; Onofre, A; Onogi, K; Onyisi, P U E; Oppen, H; Oreglia, M J; Oren, Y; Orestano, D; Orlando, N; Orr, R S; Osculati, B; Ospanov, R; Otero Y Garzon, G; Otono, H; Ouchrif, M; Ould-Saada, F; Ouraou, A; Oussoren, K P; Ouyang, Q; Owen, M; Owen, R E; Ozcan, V E; Ozturk, N; Pachal, K; Pacheco Pages, A; Pacheco Rodriguez, L; Padilla Aranda, C; Pagan Griso, S; Paganini, M; Paige, F; Palacino, G; Palazzo, S; Palestini, S; Palka, M; Pallin, D; Panagiotopoulou, E St; Panagoulias, I; Pandini, C E; Panduro Vazquez, J G; Pani, P; Panitkin, S; Pantea, D; Paolozzi, L; Papadopoulou, Th D; Papageorgiou, K; Paramonov, A; Paredes Hernandez, D; Parker, A J; Parker, M A; Parker, K A; Parodi, F; Parsons, J A; Parzefall, U; Pascuzzi, V R; Pasner, J M; Pasqualucci, E; Passaggio, S; Pastore, Fr; Pataraia, S; Pater, J R; Pauly, T; Pearson, B; Pedraza Lopez, S; Pedro, R; Peleganchuk, S V; Penc, O; Peng, C; Peng, H; Penwell, J; Peralva, B S; Perego, M M; Perepelitsa, D V; Perini, L; Pernegger, H; Perrella, S; Peschke, R; Peshekhonov, V D; Peters, K; Peters, R F Y; Petersen, B A; Petersen, T C; Petit, E; Petridis, A; Petridou, C; Petroff, P; Petrolo, E; Petrov, M; Petrucci, F; Pettersson, N E; Peyaud, A; Pezoa, R; Phillips, F H; Phillips, P W; Piacquadio, G; Pianori, E; Picazio, A; Piccaro, E; Pickering, M A; Piegaia, R; Pilcher, J E; Pilkington, A D; Pin, A W J; Pinamonti, M; Pinfold, J L; Pirumov, H; Pitt, M; Plazak, L; Pleier, M-A; Pleskot, V; Plotnikova, E; Pluth, D; Podberezko, P; Poettgen, R; Poggi, R; Poggioli, L; Pohl, D; Polesello, G; Poley, A; Policicchio, A; Polifka, R; Polini, A; Pollard, C S; Polychronakos, V; Pommès, K; Ponomarenko, D; Pontecorvo, L; Pope, B G; Popeneciu, G A; Poppleton, A; Pospisil, S; Potamianos, K; Potrap, I N; Potter, C J; Poulard, G; Poulsen, T; Poveda, J; Pozo Astigarraga, M E; Pralavorio, P; Pranko, A; Prell, S; Price, D; Price, L E; Primavera, M; Prince, S; Proklova, N; Prokofiev, K; Prokoshin, F; Protopopescu, S; Proudfoot, J; Przybycien, M; Puri, A; Puzo, P; Qian, J; Qin, G; Qin, Y; Quadt, A; Queitsch-Maitland, M; Quilty, D; Raddum, S; Radeka, V; Radescu, V; Radhakrishnan, S K; Radloff, P; Rados, P; Ragusa, F; Rahal, G; Raine, J A; Rajagopalan, S; Rangel-Smith, C; Rashid, T; Raspopov, S; Ratti, M G; Rauch, D M; Rauscher, F; Rave, S; Ravinovich, I; Rawling, J H; Raymond, M; Read, A L; Readioff, N P; Reale, M; Rebuzzi, D M; Redelbach, A; Redlinger, G; Reece, R; Reed, R G; Reeves, K; Rehnisch, L; Reichert, J; Reiss, A; Rembser, C; Ren, H; Rescigno, M; Resconi, S; Resseguie, E D; Rettie, S; Reynolds, E; Rezanova, O L; Reznicek, P; Rezvani, R; Richter, R; Richter, S; Richter-Was, E; Ricken, O; Ridel, M; Rieck, P; Riegel, C J; Rieger, J; Rifki, O; Rijssenbeek, M; Rimoldi, A; Rimoldi, M; Rinaldi, L; Ripellino, G; Ristić, B; Ritsch, E; Riu, I; Rizatdinova, F; Rizvi, E; Rizzi, C; Roberts, R T; Robertson, S H; Robichaud-Veronneau, A; Robinson, D; Robinson, J E M; Robson, A; Rocco, E; Roda, C; Rodina, Y; Rodriguez Bosca, S; Rodriguez Perez, A; Rodriguez Rodriguez, D; Roe, S; Rogan, C S; Røhne, O; Roloff, J; Romaniouk, A; Romano, M; Romano Saez, S M; Romero Adam, E; Rompotis, N; Ronzani, M; Roos, L; Rosati, S; Rosbach, K; Rose, P; Rosien, N-A; Rossi, E; Rossi, L P; Rosten, J H N; Rosten, R; Rotaru, M; Roth, I; Rothberg, J; Rousseau, D; Rozanov, A; Rozen, Y; Ruan, X; Rubbo, F; Rühr, F; Ruiz-Martinez, A; Rurikova, Z; Rusakovich, N A; Russell, H L; Rutherfoord, J P; Ruthmann, N; Ryabov, Y F; Rybar, M; Rybkin, G; Ryu, S; Ryzhov, A; Rzehorz, G F; Saavedra, A F; Sabato, G; Sacerdoti, S; Sadrozinski, H F-W; Sadykov, R; Safai Tehrani, F; Saha, P; Sahinsoy, M; Saimpert, M; Saito, M; Saito, T; Sakamoto, H; Sakurai, Y; Salamanna, G; Salazar Loyola, J E; Salek, D; De Bruin, P H Sales; Salihagic, D; Salnikov, A; Salt, J; Salvatore, D; Salvatore, F; Salvucci, A; Salzburger, A; Sammel, D; Sampsonidis, D; Sampsonidou, D; Sánchez, J; Sanchez Martinez, V; Sanchez Pineda, A; Sandaker, H; Sandbach, R L; Sander, C O; Sandhoff, M; Sandoval, C; Sankey, D P C; Sannino, M; Sansoni, A; Santoni, C; Santonico, R; Santos, H; Santoyo Castillo, I; Sapronov, A; Saraiva, J G; Sarrazin, B; Sasaki, O; Sato, K; Sauvan, E; Savage, G; Savard, P; Savic, N; Sawyer, C; Sawyer, L; Saxon, J; Sbarra, C; Sbrizzi, A; Scanlon, T; Scannicchio, D A; Scarcella, M; Scarfone, V; Schaarschmidt, J; Schacht, P; Schachtner, B M; Schaefer, D; Schaefer, L; Schaefer, R; Schaeffer, J; Schaepe, S; Schaetzel, S; Schäfer, U; Schaffer, A C; Schaile, D; Schamberger, R D; Scharf, V; Schegelsky, V A; Scheirich, D; Schernau, M; Schiavi, C; Schier, S; Schildgen, L K; Schillo, C; Schioppa, M; Schlenker, S; Schmidt-Sommerfeld, K R; Schmieden, K; Schmitt, C; Schmitt, S; Schmitz, S; Schnoor, U; Schoeffel, L; Schoening, A; Schoenrock, B D; Schopf, E; Schott, M; Schouwenberg, J F P; Schovancova, J; Schramm, S; Schuh, N; Schulte, A; Schultens, M J; Schultz-Coulon, H-C; Schulz, H; Schumacher, M; Schumm, B A; Schune, Ph; Schwartzman, A; Schwarz, T A; Schweiger, H; Schwemling, Ph; Schwienhorst, R; Schwindling, J; Sciandra, A; Sciolla, G; Scuri, F; Scutti, F; Searcy, J; Seema, P; Seidel, S C; Seiden, A; Seixas, J M; Sekhniaidze, G; Sekhon, K; Sekula, S J; Semprini-Cesari, N; Senkin, S; Serfon, C; Serin, L; Serkin, L; Sessa, M; Seuster, R; Severini, H; Sfiligoj, T; Sforza, F; Sfyrla, A; Shabalina, E; Shaikh, N W; Shan, L Y; Shang, R; Shank, J T; Shapiro, M; Shatalov, P B; Shaw, K; Shaw, S M; Shcherbakova, A; Shehu, C Y; Shen, Y; Sherafati, N; Sherwood, P; Shi, L; Shimizu, S; Shimmin, C O; Shimojima, M; Shipsey, I P J; Shirabe, S; Shiyakova, M; Shlomi, J; Shmeleva, A; Shoaleh Saadi, D; Shochet, M J; Shojaii, S; Shope, D R; Shrestha, S; Shulga, E; Shupe, M A; Sicho, P; Sickles, A M; Sidebo, P E; Sideras Haddad, E; Sidiropoulou, O; Sidoti, A; Siegert, F; Sijacki, Dj; Silva, J; Silverstein, S B; Simak, V; Simic, Lj; Simion, S; Simioni, E; Simmons, B; Simon, M; Sinervo, P; Sinev, N B; Sioli, M; Siragusa, G; Siral, I; Sivoklokov, S Yu; Sjölin, J; Skinner, M B; Skubic, P; Slater, M; Slavicek, T; Slawinska, M; Sliwa, K; Slovak, R; Smakhtin, V; Smart, B H; Smiesko, J; Smirnov, N; Smirnov, S Yu; Smirnov, Y; Smirnova, L N; Smirnova, O; Smith, J W; Smith, M N K; Smith, R W; Smizanska, M; Smolek, K; Snesarev, A A; Snyder, I M; Snyder, S; Sobie, R; Socher, F; Soffer, A; Søgaard, A; Soh, D A; Sokhrannyi, G; Solans Sanchez, C A; Solar, M; Soldatov, E Yu; Soldevila, U; Solodkov, A A; Soloshenko, A; Solovyanov, O V; Solovyev, V; Sommer, P; Son, H; Sopczak, A; Sosa, D; Sotiropoulou, C L; Soualah, R; Soukharev, A M; South, D; Sowden, B C; Spagnolo, S; Spalla, M; Spangenberg, M; Spanò, F; Sperlich, D; Spettel, F; Spieker, T M; Spighi, R; Spigo, G; Spiller, L A; Spousta, M; St Denis, R D; Stabile, A; Stamen, R; Stamm, S; Stanecka, E; Stanek, R W; Stanescu, C; Stanitzki, M M; Stapf, B S; Stapnes, S; Starchenko, E A; Stark, G H; Stark, J; Stark, S H; Staroba, P; Starovoitov, P; Stärz, S; Staszewski, R; Steinberg, P; Stelzer, B; Stelzer, H J; Stelzer-Chilton, O; Stenzel, H; Stewart, G A; Stockton, M C; Stoebe, M; Stoicea, G; Stolte, P; Stonjek, S; Stradling, A R; Straessner, A; Stramaglia, M E; Strandberg, J; Strandberg, S; Strauss, M; Strizenec, P; Ströhmer, R; Strom, D M; Stroynowski, R; Strubig, A; Stucci, S A; Stugu, B; Styles, N A; Su, D; Su, J; Suchek, S; Sugaya, Y; Suk, M; Sulin, V V; Sultan, Dms; Sultansoy, S; Sumida, T; Sun, S; Sun, X; Suruliz, K; Suster, C J E; Sutton, M R; Suzuki, S; Svatos, M; Swiatlowski, M; Swift, S P; Sykora, I; Sykora, T; Ta, D; Tackmann, K; Taenzer, J; Taffard, A; Tafirout, R; Tahirovic, E; Taiblum, N; Takai, H; Takashima, R; Takasugi, E H; Takeshita, T; Takubo, Y; Talby, M; Talyshev, A A; Tanaka, J; Tanaka, M; Tanaka, R; Tanaka, S; Tanioka, R; Tannenwald, B B; Tapia Araya, S; Tapprogge, S; Tarem, S; Tartarelli, G F; Tas, P; Tasevsky, M; Tashiro, T; Tassi, E; Tavares Delgado, A; Tayalati, Y; Taylor, A C; Taylor, G N; Taylor, P T E; Taylor, W; Teixeira-Dias, P; Temple, D; Ten Kate, H; Teng, P K; Teoh, J J; Tepel, F; Terada, S; Terashi, K; Terron, J; Terzo, S; Testa, M; Teuscher, R J; Theveneaux-Pelzer, T; Thomas, J P; Thomas-Wilsker, J; Thompson, P D; Thompson, A S; Thomsen, L A; Thomson, E; Tibbetts, M J; Ticse Torres, R E; Tikhomirov, V O; Tikhonov, Yu A; Timoshenko, S; Tipton, P; Tisserant, S; Todome, K; Todorova-Nova, S; Tojo, J; Tokár, S; Tokushuku, K; Tolley, E; Tomlinson, L; Tomoto, M; Tompkins, L; Toms, K; Tong, B; Tornambe, P; Torrence, E; Torres, H; Torró Pastor, E; Toth, J; Touchard, F; Tovey, D R; Treado, C J; Trefzger, T; Tresoldi, F; Tricoli, A; Trigger, I M; Trincaz-Duvoid, S; Tripiana, M F; Trischuk, W; Trocmé, B; Trofymov, A; Troncon, C; Trottier-McDonald, M; Trovatelli, M; Truong, L; Trzebinski, M; Trzupek, A; Tsang, K W; Tseng, J C-L; Tsiareshka, P V; Tsipolitis, G; Tsirintanis, N; Tsiskaridze, S; Tsiskaridze, V; Tskhadadze, E G; Tsui, K M; Tsukerman, I I; Tsulaia, V; Tsuno, S; Tsybychev, D; Tu, Y; Tudorache, A; Tudorache, V; Tulbure, T T; Tuna, A N; Tupputi, S A; Turchikhin, S; Turgeman, D; Turk Cakir, I; Turra, R; Tuts, P M; Ucchielli, G; Ueda, I; Ughetto, M; Ukegawa, F; Unal, G; Undrus, A; Unel, G; Ungaro, F C; Unno, Y; Unverdorben, C; Urban, J; Urquijo, P; Urrejola, P; Usai, G; Usui, J; Vacavant, L; Vacek, V; Vachon, B; Vadla, K O H; Vaidya, A; Valderanis, C; Valdes Santurio, E; Valente, M; Valentinetti, S; Valero, A; Valéry, L; Valkar, S; Vallier, A; Valls Ferrer, J A; Van Den Wollenberg, W; van der Graaf, H; van Gemmeren, P; Van Nieuwkoop, J; van Vulpen, I; van Woerden, M C; Vanadia, M; Vandelli, W; Vaniachine, A; Vankov, P; Vardanyan, G; Vari, R; Varnes, E W; Varni, C; Varol, T; Varouchas, D; Vartapetian, A; Varvell, K E; Vasquez, J G; Vasquez, G A; Vazeille, F; Vazquez Schroeder, T; Veatch, J; Veeraraghavan, V; Veloce, L M; Veloso, F; Veneziano, S; Ventura, A; Venturi, M; Venturi, N; Venturini, A; Vercesi, V; Verducci, M; Verkerke, W; Vermeulen, A T; Vermeulen, J C; Vetterli, M C; Viaux Maira, N; Viazlo, O; Vichou, I; Vickey, T; Vickey Boeriu, O E; Viehhauser, G H A; Viel, S; Vigani, L; Villa, M; Villaplana Perez, M; Vilucchi, E; Vincter, M G; Vinogradov, V B; Vishwakarma, A; Vittori, C; Vivarelli, I; Vlachos, S; Vlasak, M; Vogel, M; Vokac, P; Volpi, G; von der Schmitt, H; von Toerne, E; Vorobel, V; Vorobev, K; Vos, M; Voss, R; Vossebeld, J H; Vranjes, N; Vranjes Milosavljevic, M; Vrba, V; Vreeswijk, M; Vuillermet, R; Vukotic, I; Wagner, P; Wagner, W; Wagner-Kuhr, J; Wahlberg, H; Wahrmund, S; Wakabayashi, J; Walder, J; Walker, R; Walkowiak, W; Wallangen, V; Wang, C; Wang, C; Wang, F; Wang, H; Wang, H; Wang, J; Wang, J; Wang, Q; Wang, R; Wang, S M; Wang, T; Wang, W; Wang, W; Wang, Z; Wanotayaroj, C; Warburton, A; Ward, C P; Wardrope, D R; Washbrook, A; Watkins, P M; Watson, A T; Watson, M F; Watts, G; Watts, S; Waugh, B M; Webb, A F; Webb, S; Weber, M S; Weber, S W; Weber, S A; Webster, J S; Weidberg, A R; Weinert, B; Weingarten, J; Weirich, M; Weiser, C; Weits, H; Wells, P S; Wenaus, T; Wengler, T; Wenig, S; Wermes, N; Werner, M D; Werner, P; Wessels, M; Weston, T D; Whalen, K; Whallon, N L; Wharton, A M; White, A S; White, A; White, M J; White, R; Whiteson, D; Whitmore, B W; Wickens, F J; Wiedenmann, W; Wielers, M; Wiglesworth, C; Wiik-Fuchs, L A M; Wildauer, A; Wilk, F; Wilkens, H G; Williams, H H; Williams, S; Willis, C; Willocq, S; Wilson, J A; Wingerter-Seez, I; Winkels, E; Winklmeier, F; Winston, O J; Winter, B T; Wittgen, M; Wobisch, M; Wolf, T M H; Wolff, R; Wolter, M W; Wolters, H; Wong, V W S; Worm, S D; Wosiek, B K; Wotschack, J; Wozniak, K W; Wu, M; Wu, S L; Wu, X; Wu, Y; Wyatt, T R; Wynne, B M; Xella, S; Xi, Z; Xia, L; Xu, D; Xu, L; Yabsley, B; Yacoob, S; Yamaguchi, D; Yamaguchi, Y; Yamamoto, A; Yamamoto, S; Yamanaka, T; Yamatani, M; Yamauchi, K; Yamazaki, Y; Yan, Z; Yang, H; Yang, H; Yang, Y; Yang, Z; Yao, W-M; Yap, Y C; Yasu, Y; Yatsenko, E; Yau Wong, K H; Ye, J; Ye, S; Yeletskikh, I; Yigitbasi, E; Yildirim, E; Yorita, K; Yoshihara, K; Young, C; Young, C J S; Yu, J; Yu, J; Yuen, S P Y; Yusuff, I; Zabinski, B; Zacharis, G; Zaidan, R; Zaitsev, A M; Zakharchuk, N; Zalieckas, J; Zaman, A; Zambito, S; Zanzi, D; Zeitnitz, C; Zemaityte, G; Zemla, A; Zeng, J C; Zeng, Q; Zenin, O; Ženiš, T; Zerwas, D; Zhang, D; Zhang, F; Zhang, G; Zhang, H; Zhang, J; Zhang, L; Zhang, L; Zhang, M; Zhang, P; Zhang, R; Zhang, R; Zhang, X; Zhang, Y; Zhang, Z; Zhao, X; Zhao, Y; Zhao, Z; Zhemchugov, A; Zhou, B; Zhou, C; Zhou, L; Zhou, M; Zhou, M; Zhou, N; Zhu, C G; Zhu, H; Zhu, J; Zhu, Y; Zhuang, X; Zhukov, K; Zibell, A; Zieminska, D; Zimine, N I; Zimmermann, C; Zimmermann, S; Zinonos, Z; Zinser, M; Ziolkowski, M; Živković, L; Zobernig, G; Zoccoli, A; Zou, R; Zur Nedden, M; Zwalinski, L

    2017-01-01

    With the increase in energy of the Large Hadron Collider to a centre-of-mass energy of 13 [Formula: see text] for Run 2, events with dense environments, such as in the cores of high-energy jets, became a focus for new physics searches as well as measurements of the Standard Model. These environments are characterized by charged-particle separations of the order of the tracking detectors sensor granularity. Basic track quantities are compared between 3.2 fb[Formula: see text] of data collected by the ATLAS experiment and simulation of proton-proton collisions producing high-transverse-momentum jets at a centre-of-mass energy of 13 [Formula: see text]. The impact of charged-particle separations and multiplicities on the track reconstruction performance is discussed. The track reconstruction efficiency in the cores of jets with transverse momenta between 200 and 1600 [Formula: see text] is quantified using a novel, data-driven, method. The method uses the energy loss, [Formula: see text], to identify pixel clusters originating from two charged particles. Of the charged particles creating these clusters, the measured fraction that fail to be reconstructed is [Formula: see text] and [Formula: see text] for jet transverse momenta of 200-400 [Formula: see text] and 1400-1600 [Formula: see text], respectively.

  14. Human body motion tracking based on quantum-inspired immune cloning algorithm

    Science.gov (United States)

    Han, Hong; Yue, Lichuan; Jiao, Licheng; Wu, Xing

    2009-10-01

    In a static monocular camera system, to gain a perfect 3D human body posture is a great challenge for Computer Vision technology now. This paper presented human postures recognition from video sequences using the Quantum-Inspired Immune Cloning Algorithm (QICA). The algorithm included three parts. Firstly, prior knowledge of human beings was used, the key joint points of human could be detected automatically from the human contours and skeletons which could be thinning from the contours; And due to the complexity of human movement, a forecasting mechanism of occlusion joint points was addressed to get optimum 2D key joint points of human body; And then pose estimation recovered by optimizing between the 2D projection of 3D human key joint points and 2D detection key joint points using QICA, which recovered the movement of human body perfectly, because this algorithm could acquire not only the global optimal solution, but the local optimal solution.

  15. Novel PID Tracking Controller for 2DOF Robotic Manipulator System Based on Artificial Bee Colony Algorithm

    Directory of Open Access Journals (Sweden)

    Elkhateeb Nasr A.

    2017-12-01

    Full Text Available This study presents a well-developed optimization methodology based on the dynamic inertia weight Artificial Bee Colony algorithm (ABC to design an optimal PID controller for a robotic arm manipulator. The dynamical analysis of robotic arm manipulators investigates a coupling relation between the joint torques applied by the actuators and the position and acceleration of the robot arm. An optimal PID control law is obtained from the proposed (ABC algorithm and applied to the robotic system. The designed controller optimizes the trajectory of the robot’s end effector for a time-variant input and makes the robot robust in the presence of external disturbance.

  16. Automatic segmentation of coronary angiograms based on fuzzy inferring and probabilistic tracking

    Directory of Open Access Journals (Sweden)

    Shoujun Zhou

    2010-08-01

    Full Text Available Abstract Background Segmentation of the coronary angiogram is important in computer-assisted artery motion analysis or reconstruction of 3D vascular structures from a single-plan or biplane angiographic system. Developing fully automated and accurate vessel segmentation algorithms is highly challenging, especially when extracting vascular structures with large variations in image intensities and noise, as well as with variable cross-sections or vascular lesions. Methods This paper presents a novel tracking method for automatic segmentation of the coronary artery tree in X-ray angiographic images, based on probabilistic vessel tracking and fuzzy structure pattern inferring. The method is composed of two main steps: preprocessing and tracking. In preprocessing, multiscale Gabor filtering and Hessian matrix analysis were used to enhance and extract vessel features from the original angiographic image, leading to a vessel feature map as well as a vessel direction map. In tracking, a seed point was first automatically detected by analyzing the vessel feature map. Subsequently, two operators [e.g., a probabilistic tracking operator (PTO and a vessel structure pattern detector (SPD] worked together based on the detected seed point to extract vessel segments or branches one at a time. The local structure pattern was inferred by a multi-feature based fuzzy inferring function employed in the SPD. The identified structure pattern, such as crossing or bifurcation, was used to control the tracking process, for example, to keep tracking the current segment or start tracking a new one, depending on the detected pattern. Results By appropriate integration of these advanced preprocessing and tracking steps, our tracking algorithm is able to extract both vessel axis lines and edge points, as well as measure the arterial diameters in various complicated cases. For example, it can walk across gaps along the longitudinal vessel direction, manage varying vessel

  17. Robust Battery Fuel Gauge Algorithm Development, Part 3: State of Charge Tracking

    Science.gov (United States)

    2014-10-19

    lithium ion batteries in electric drive vehicles using extended kalman filtering,” 2013. [13] A. P. Dempster, N. M. Laird, D. B. Rubin et al., “Maximum...identification,adaptive nonlinear filtering, extended Kalman filter (EKF), reducedorder filtering. REPORT DOCUMENTATION PAGE 11. SPONSOR/MONITOR’S REPORT...Charge Tracking B. Balasingam, G. V. Avvari, B. Pattipati, K. Pattipati and Y. Bar-Shalom Dept. of Electrical and Computer Engineering, University of

  18. Tuning a Kalman filter carrier tracking algorithm in the presence of ionospheric scintillation

    OpenAIRE

    Susi, Melania; Andreotti, Marcus; Aquino, Marcio; Dodson, Alan

    2016-01-01

    Strong ionospheric electron content gradients may lead to fast and unpredictable fluctuations in the phase and amplitude of the signals from Global Navigation Satellite Systems (GNSS). This phenomenon, known as ionospheric scintillation, is capable of deteriorating the tracking performance of a GNSS receiver, leading to increased phase and Doppler errors, cycle slips and also to complete losses of signal lock. In order to mitigate scintillation effects at receiver level, the robustness of the...

  19. Space-time Coordinated Distributed Sensing Algorithms for Resource Efficient Narrowband Target Localization and Tracking

    OpenAIRE

    Shashi Phoha; John Koch; Eric Grele; Christopher Griffin; Bharat Madan

    2005-01-01

    Distributed sensing has been used for enhancing signal to noise ratios for space-time localization and tracking of remote objects using phased array antennas, sonar, and radio signals. The use of these technologies in identifying mobile targets in a field, emitting acoustic signals, using a network of low-cost narrow band acoustic micro-sensing devices randomly dispersed over the region of interest, presents unique challenges. The effects of wind, turbulence, and temperature gradients and oth...

  20. Mix Model of FE Method and IPSO Algorithm for Dome Shape Optimization of Articulated Pressure Vessels Considering the Effect of Non-geodesic Trajectories

    Science.gov (United States)

    Paknahad, A.; Nourani, R.

    2014-04-01

    The main essential topic for the design of articulated pressure vessels is related to the determination of the optimal meridian profile. This article, aimed to present the new model for optimum design of dome contours for filament wound articulated pressure vessels based on non-geodesic trajectories. The current model is a mix of finite element analysis and inertia weight particle swarm optimization algorithm. Geometrical limitations, stability-ensuring winding conditions and the Tsai-Wu failure criterion have been used as optimization constraints. Classical lamination theory and non-geodesic trajectories are used to analyse the field stress equations and increase the structural performance. The geometry of dome contours is defined by the B-spline curves with twenty-one points. The results, when compared to the previously published results, indicate the efficiency of the presented model in achieving superior performance of dome shape for articulated pressure vessels. Also, it is shown that the design based on non-geodesic trajectories using this model gains better response than the design by geodesics type.

  1. Performance of the ATLAS Track Reconstruction Algorithms in Dense Environments in LHC run 2

    CERN Document Server

    Aaboud, M.; ATLAS Collaboration; Abbott, Brad; Abdallah, Jalal; Abdinov, Ovsat; Abeloos, Baptiste; Abidi, Syed Haider; AbouZeid, Ossama; Abraham, Nicola; Abramowicz, Halina; Abreu, Henso; Abreu, Ricardo; Abulaiti, Yiming; Acharya, Bobby Samir; Adachi, Shunsuke; Adamczyk, Leszek; Adelman, Jahred; Adersberger, Michael; Adye, Tim; Affolder, Tony; Agatonovic-Jovin, Tatjana; Agheorghiesei, Catalin; Aguilar-Saavedra, Juan Antonio; Ahlen, Steven; Ahmadov, Faig; Aielli, Giulio; Akatsuka, Shunichi; Akerstedt, Henrik; Åkesson, Torsten Paul Ake; Akimov, Andrei; Alberghi, Gian Luigi; Albert, Justin; Albicocco, Pietro; Alconada Verzini, Maria Josefina; Aleksa, Martin; Aleksandrov, Igor; Alexa, Calin; Alexander, Gideon; Alexopoulos, Theodoros; Alhroob, Muhammad; Ali, Babar; Aliev, Malik; Alimonti, Gianluca; Alison, John; Alkire, Steven Patrick; Allbrooke, Benedict; Allen, Benjamin William; Allport, Phillip; Aloisio, Alberto; Alonso, Alejandro; Alonso, Francisco; Alpigiani, Cristiano; Alshehri, Azzah Aziz; Alstaty, Mahmoud; Alvarez Gonzalez, Barbara; Άlvarez Piqueras, Damián; Alviggi, Mariagrazia; Amadio, Brian Thomas; Amaral Coutinho, Yara; Amelung, Christoph; Amidei, Dante; Amor Dos Santos, Susana Patricia; Amorim, Antonio; Amoroso, Simone; Amundsen, Glenn; Anastopoulos, Christos; Ancu, Lucian Stefan; Andari, Nansi; Andeen, Timothy; Anders, Christoph Falk; Anders, John Kenneth; Anderson, Kelby; Andreazza, Attilio; Andrei, George Victor; Angelidakis, Stylianos; Angelozzi, Ivan; Angerami, Aaron; Anisenkov, Alexey; Anjos, Nuno; Annovi, Alberto; Antel, Claire; Antonelli, Mario; Antonov, Alexey; Antrim, Daniel Joseph; Anulli, Fabio; Aoki, Masato; Aperio Bella, Ludovica; Arabidze, Giorgi; Arai, Yasuo; Araque, Juan Pedro; Araujo Ferraz, Victor; Arce, Ayana; Ardell, Rose Elisabeth; Arduh, Francisco Anuar; Arguin, Jean-Francois; Argyropoulos, Spyridon; Arik, Metin; Armbruster, Aaron James; Armitage, Lewis James; Arnaez, Olivier; Arnold, Hannah; Arratia, Miguel; Arslan, Ozan; Artamonov, Andrei; Artoni, Giacomo; Artz, Sebastian; Asai, Shoji; Asbah, Nedaa; Ashkenazi, Adi; Asquith, Lily; Assamagan, Ketevi; Astalos, Robert; Atkinson, Markus; Atlay, Naim Bora; Augsten, Kamil; Avolio, Giuseppe; Axen, Bradley; Ayoub, Mohamad Kassem; Azuelos, Georges; Baas, Alessandra; Baca, Matthew John; Bachacou, Henri; Bachas, Konstantinos; Backes, Moritz; Backhaus, Malte; Bagnaia, Paolo; Bahrasemani, Sina; Baines, John; Bajic, Milena; Baker, Oliver Keith; Baldin, Evgenii; Balek, Petr; Balli, Fabrice; Balunas, William Keaton; Banas, Elzbieta; Banerjee, Swagato; Bannoura, Arwa A E; Barak, Liron; Barberio, Elisabetta Luigia; Barberis, Dario; Barbero, Marlon; Barillari, Teresa; Barisits, Martin-Stefan; Barklow, Timothy; Barlow, Nick; Barnes, Sarah Louise; Barnett, Bruce; Barnett, Michael; Barnovska-Blenessy, Zuzana; Baroncelli, Antonio; Barone, Gaetano; Barr, Alan; Barranco Navarro, Laura; Barreiro, Fernando; Barreiro Guimarães da Costa, João; Bartoldus, Rainer; Barton, Adam Edward; Bartos, Pavol; Basalaev, Artem; Bassalat, Ahmed; Bates, Richard; Batista, Santiago Juan; Batley, Richard; Battaglia, Marco; Bauce, Matteo; Bauer, Florian; Bawa, Harinder Singh; Beacham, James; Beattie, Michael David; Beau, Tristan; Beauchemin, Pierre-Hugues; Bechtle, Philip; Beck, Hans~Peter; Becker, Kathrin; Becker, Maurice; Beckingham, Matthew; Becot, Cyril; Beddall, Andrew; Beddall, Ayda; Bednyakov, Vadim; Bedognetti, Matteo; Bee, Christopher; Beermann, Thomas; Begalli, Marcia; Begel, Michael; Behr, Janna Katharina; Bell, Andrew Stuart; Bella, Gideon; Bellagamba, Lorenzo; Bellerive, Alain; Bellomo, Massimiliano; Belotskiy, Konstantin; Beltramello, Olga; Belyaev, Nikita; Benary, Odette; Benchekroun, Driss; Bender, Michael; Bendtz, Katarina; Benekos, Nektarios; Benhammou, Yan; Benhar Noccioli, Eleonora; Benitez, Jose; Benjamin, Douglas; Benoit, Mathieu; Bensinger, James; Bentvelsen, Stan; Beresford, Lydia; Beretta, Matteo; Berge, David; Bergeaas Kuutmann, Elin; Berger, Nicolas; Beringer, Jürg; Berlendis, Simon; Bernard, Nathan Rogers; Bernardi, Gregorio; Bernius, Catrin; Bernlochner, Florian Urs; Berry, Tracey; Berta, Peter; Bertella, Claudia; Bertoli, Gabriele; Bertolucci, Federico; Bertram, Iain Alexander; Bertsche, Carolyn; Bertsche, David; Besjes, Geert-Jan; Bessidskaia Bylund, Olga; Bessner, Martin Florian; Besson, Nathalie; Betancourt, Christopher; Bethani, Agni; Bethke, Siegfried; Bevan, Adrian John; Beyer, Julien-christopher; Bianchi, Riccardo-Maria; Biebel, Otmar; Biedermann, Dustin; Bielski, Rafal; Biesuz, Nicolo Vladi; Biglietti, Michela; Bilbao De Mendizabal, Javier; Billoud, Thomas Remy Victor; Bilokon, Halina; Bindi, Marcello; Bingul, Ahmet; Bini, Cesare; Biondi, Silvia; Bisanz, Tobias; Bittrich, Carsten; Bjergaard, David Martin; Black, Curtis; Black, James; Black, Kevin; Blair, Robert; Blazek, Tomas; Bloch, Ingo; Blocker, Craig; Blue, Andrew; Blum, Walter; Blumenschein, Ulrike; Blunier, Sylvain; Bobbink, Gerjan; Bobrovnikov, Victor; Bocchetta, Simona Serena; Bocci, Andrea; Bock, Christopher; Boehler, Michael; Boerner, Daniela; Bogavac, Danijela; Bogdanchikov, Alexander; Bohm, Christian; Boisvert, Veronique; Bokan, Petar; Bold, Tomasz; Boldyrev, Alexey; Bolz, Arthur Eugen; Bomben, Marco; Bona, Marcella; Boonekamp, Maarten; Borisov, Anatoly; Borissov, Guennadi; Bortfeldt, Jonathan; Bortoletto, Daniela; Bortolotto, Valerio; Boscherini, Davide; Bosman, Martine; Bossio Sola, Jonathan David; Boudreau, Joseph; Bouffard, Julian; Bouhova-Thacker, Evelina Vassileva; Boumediene, Djamel Eddine; Bourdarios, Claire; Boutle, Sarah Kate; Boveia, Antonio; Boyd, James; Boyko, Igor; Bracinik, Juraj; Brandt, Andrew; Brandt, Gerhard; Brandt, Oleg; Bratzler, Uwe; Brau, Benjamin; Brau, James; Breaden Madden, William Dmitri; Brendlinger, Kurt; Brennan, Amelia Jean; Brenner, Lydia; Brenner, Richard; Bressler, Shikma; Briglin, Daniel Lawrence; Bristow, Timothy Michael; Britton, Dave; Britzger, Daniel; Brochu, Frederic; Brock, Ian; Brock, Raymond; Brooijmans, Gustaaf; Brooks, Timothy; Brooks, William; Brosamer, Jacquelyn; Brost, Elizabeth; Broughton, James; Bruckman de Renstrom, Pawel; Bruncko, Dusan; Bruni, Alessia; Bruni, Graziano; Bruni, Lucrezia Stella; Brunt, Benjamin; Bruschi, Marco; Bruscino, Nello; Bryant, Patrick; Bryngemark, Lene; Buanes, Trygve; Buat, Quentin; Buchholz, Peter; Buckley, Andrew; Budagov, Ioulian; Buehrer, Felix; Bugge, Magnar Kopangen; Bulekov, Oleg; Bullock, Daniel; Burch, Tyler James; Burckhart, Helfried; Burdin, Sergey; Burgard, Carsten Daniel; Burger, Angela Maria; Burghgrave, Blake; Burka, Klaudia; Burke, Stephen; Burmeister, Ingo; Burr, Jonathan Thomas Peter; Busato, Emmanuel; Büscher, Daniel; Büscher, Volker; Bussey, Peter; Butler, John; Buttar, Craig; Butterworth, Jonathan; Butti, Pierfrancesco; Buttinger, William; Buzatu, Adrian; Buzykaev, Aleksey; Cabrera Urbán, Susana; Caforio, Davide; Cairo, Valentina; Cakir, Orhan; Calace, Noemi; Calafiura, Paolo; Calandri, Alessandro; Calderini, Giovanni; Calfayan, Philippe; Callea, Giuseppe; Caloba, Luiz; Calvente Lopez, Sergio; Calvet, David; Calvet, Samuel; Calvet, Thomas Philippe; Camacho Toro, Reina; Camarda, Stefano; Camarri, Paolo; Cameron, David; Caminal Armadans, Roger; Camincher, Clement; Campana, Simone; Campanelli, Mario; Camplani, Alessandra; Campoverde, Angel; Canale, Vincenzo; Cano Bret, Marc; Cantero, Josu; Cao, Tingting; Capeans Garrido, Maria Del Mar; Caprini, Irinel; Caprini, Mihai; Capua, Marcella; Carbone, Ryne Michael; Cardarelli, Roberto; Cardillo, Fabio; Carli, Ina; Carli, Tancredi; Carlino, Gianpaolo; Carlson, Benjamin Taylor; Carminati, Leonardo; Carney, Rebecca; Caron, Sascha; Carquin, Edson; Carrá, Sonia; Carrillo-Montoya, German D; Carvalho, João; Casadei, Diego; Casado, Maria Pilar; Casolino, Mirkoantonio; Casper, David William; Castelijn, Remco; Castillo Gimenez, Victoria; Castro, Nuno Filipe; Catinaccio, Andrea; Catmore, James; Cattai, Ariella; Caudron, Julien; Cavaliere, Viviana; Cavallaro, Emanuele; Cavalli, Donatella; Cavalli-Sforza, Matteo; Cavasinni, Vincenzo; Celebi, Emre; Ceradini, Filippo; Cerda Alberich, Leonor; Santiago Cerqueira, Augusto; Cerri, Alessandro; Cerrito, Lucio; Cerutti, Fabio; Cervelli, Alberto; Cetin, Serkant Ali; Chafaq, Aziz; Chakraborty, Dhiman; Chan, Stephen Kam-wah; Chan, Wing Sheung; Chan, Yat Long; Chang, Philip; Chapman, John Derek; Charlton, Dave; Chau, Chav Chhiv; Chavez Barajas, Carlos Alberto; Che, Siinn; Cheatham, Susan; Chegwidden, Andrew; Chekanov, Sergei; Chekulaev, Sergey; Chelkov, Gueorgui; Chelstowska, Magda Anna; Chen, Chunhui; Chen, Hucheng; Chen, Shenjian; Chen, Shion; Chen, Xin; Chen, Ye; Cheng, Hok Chuen; Cheng, Huajie; Cheplakov, Alexander; Cheremushkina, Evgenia; Cherkaoui El Moursli, Rajaa; Chernyatin, Valeriy; Cheu, Elliott; Chevalier, Laurent; Chiarella, Vitaliano; Chiarelli, Giorgio; Chiodini, Gabriele; Chisholm, Andrew; Chitan, Adrian; Chiu, Yu Him Justin; Chizhov, Mihail; Choi, Kyungeon; Chomont, Arthur Rene; Chouridou, Sofia; Christodoulou, Valentinos; Chromek-Burckhart, Doris; Chu, Ming Chung; Chudoba, Jiri; Chuinard, Annabelle Julia; Chwastowski, Janusz; Chytka, Ladislav; Ciftci, Abbas Kenan; Cinca, Diane; Cindro, Vladimir; Cioara, Irina Antonela; Ciocca, Claudia; Ciocio, Alessandra; Cirotto, Francesco; Citron, Zvi Hirsh; Citterio, Mauro; Ciubancan, Mihai; Clark, Allan G; Clark, Brian Lee; Clark, Michael; Clark, Philip James; Clarke, Robert; Clement, Christophe; Coadou, Yann; Cobal, Marina; Coccaro, Andrea; Cochran, James H; Colasurdo, Luca; Cole, Brian; Colijn, Auke-Pieter; Collot, Johann; Colombo, Tommaso; Conde Muiño, Patricia; Coniavitis, Elias; Connell, Simon Henry; Connelly, Ian; Constantinescu, Serban; Conti, Geraldine; Conventi, Francesco; Cooke, Mark; Cooper-Sarkar, Amanda; Cormier, Felix; Cormier, Kyle James Read; Corradi, Massimo; Corriveau, Francois; Cortes-Gonzalez, Arely; Cortiana, Giorgio; Costa, Giuseppe; Costa, María José; Costanzo, Davide; Cottin, Giovanna; Cowan, Glen; Cox, Brian; Cranmer, Kyle; Crawley, Samuel Joseph; Creager, Rachael; Cree, Graham; Crépé-Renaudin, Sabine; Crescioli, Francesco; Cribbs, Wayne Allen; Cristinziani, Markus; Croft, Vince; Crosetti, Giovanni; Cueto, Ana; Cuhadar Donszelmann, Tulay; Cukierman, Aviv Ruben; Cummings, Jane; Curatolo, Maria; Cúth, Jakub; Czirr, Hendrik; Czodrowski, Patrick; D'amen, Gabriele; D'Auria, Saverio; D'eramo, Louis; D'Onofrio, Monica; Da Cunha Sargedas De Sousa, Mario Jose; Da Via, Cinzia; Dabrowski, Wladyslaw; Dado, Tomas; Dai, Tiesheng; Dale, Orjan; Dallaire, Frederick; Dallapiccola, Carlo; Dam, Mogens; Dandoy, Jeffrey; Daneri, Maria Florencia; Dang, Nguyen Phuong; Daniells, Andrew Christopher; Dann, Nicholas Stuart; Danninger, Matthias; Dano Hoffmann, Maria; Dao, Valerio; Darbo, Giovanni; Darmora, Smita; Dassoulas, James; Dattagupta, Aparajita; Daubney, Thomas; Davey, Will; David, Claire; Davidek, Tomas; Davies, Merlin; Davis, Douglas; Davison, Peter; Dawe, Edmund; Dawson, Ian; De, Kaushik; de Asmundis, Riccardo; De Benedetti, Abraham; De Castro, Stefano; De Cecco, Sandro; De Groot, Nicolo; de Jong, Paul; De la Torre, Hector; De Lorenzi, Francesco; De Maria, Antonio; De Pedis, Daniele; De Salvo, Alessandro; De Sanctis, Umberto; De Santo, Antonella; De Vasconcelos Corga, Kevin; De Vivie De Regie, Jean-Baptiste; Dearnaley, William James; Debbe, Ramiro; Debenedetti, Chiara; Dedovich, Dmitri; Dehghanian, Nooshin; Deigaard, Ingrid; Del Gaudio, Michela; Del Peso, Jose; Del Prete, Tarcisio; Delgove, David; Deliot, Frederic; Delitzsch, Chris Malena; Dell'Acqua, Andrea; Dell'Asta, Lidia; Dell'Orso, Mauro; Della Pietra, Massimo; della Volpe, Domenico; Delmastro, Marco; Delporte, Charles; Delsart, Pierre-Antoine; DeMarco, David; Demers, Sarah; Demichev, Mikhail; Demilly, Aurelien; Denisov, Sergey; Denysiuk, Denys; Derendarz, Dominik; Derkaoui, Jamal Eddine; Derue, Frederic; Dervan, Paul; Desch, Klaus Kurt; Deterre, Cecile; Dette, Karola; Devesa, Maria Roberta; Deviveiros, Pier-Olivier; Dewhurst, Alastair; Dhaliwal, Saminder; Di Bello, Francesco Armando; Di Ciaccio, Anna; Di Ciaccio, Lucia; Di Clemente, William Kennedy; Di Donato, Camilla; Di Girolamo, Alessandro; Di Girolamo, Beniamino; Di Micco, Biagio; Di Nardo, Roberto; Di Petrillo, Karri Folan; Di Simone, Andrea; Di Sipio, Riccardo; Di Valentino, David; Diaconu, Cristinel; Diamond, Miriam; Dias, Flavia; Diaz, Marco Aurelio; Diehl, Edward; Dietrich, Janet; Díez Cornell, Sergio; Dimitrievska, Aleksandra; Dingfelder, Jochen; Dita, Petre; Dita, Sanda; Dittus, Fridolin; Djama, Fares; Djobava, Tamar; Djuvsland, Julia Isabell; Barros do Vale, Maria Aline; Dobos, Daniel; Dobre, Monica; Doglioni, Caterina; Dolejsi, Jiri; Dolezal, Zdenek; Donadelli, Marisilvia; Donati, Simone; Dondero, Paolo; Donini, Julien; Dopke, Jens; Doria, Alessandra; Dova, Maria-Teresa; Doyle, Tony; Drechsler, Eric; Dris, Manolis; Du, Yanyan; Duarte-Campderros, Jorge; Dubreuil, Arnaud; Duchovni, Ehud; Duckeck, Guenter; Ducourthial, Audrey; Ducu, Otilia Anamaria; Duda, Dominik; Dudarev, Alexey; Dudder, Andreas Christian; Duffield, Emily Marie; Duflot, Laurent; Dührssen, Michael; Dumancic, Mirta; Dumitriu, Ana Elena; Duncan, Anna Kathryn; Dunford, Monica; Duran Yildiz, Hatice; Düren, Michael; Durglishvili, Archil; Duschinger, Dirk; Dutta, Baishali; Dyndal, Mateusz; Eckardt, Christoph; Ecker, Katharina Maria; Edgar, Ryan Christopher; Eifert, Till; Eigen, Gerald; Einsweiler, Kevin; Ekelof, Tord; El Kacimi, Mohamed; El Kosseifi, Rima; Ellajosyula, Venugopal; Ellert, Mattias; Elles, Sabine; Ellinghaus, Frank; Elliot, Alison; Ellis, Nicolas; Elmsheuser, Johannes; Elsing, Markus; Emeliyanov, Dmitry; Enari, Yuji; Endner, Oliver Chris; Ennis, Joseph Stanford; Erdmann, Johannes; Ereditato, Antonio; Ernis, Gunar; Ernst, Michael; Errede, Steven; Escalier, Marc; Escobar, Carlos; Esposito, Bellisario; Estrada Pastor, Oscar; Etienvre, Anne-Isabelle; Etzion, Erez; Evans, Hal; Ezhilov, Alexey; Ezzi, Mohammed; Fabbri, Federica; Fabbri, Laura; Facini, Gabriel; Fakhrutdinov, Rinat; Falciano, Speranza; Falla, Rebecca Jane; Faltova, Jana; Fang, Yaquan; Fanti, Marcello; Farbin, Amir; Farilla, Addolorata; Farina, Christian; Farina, Edoardo Maria; Farooque, Trisha; Farrell, Steven; Farrington, Sinead; Farthouat, Philippe; Fassi, Farida; Fassnacht, Patrick; Fassouliotis, Dimitrios; Faucci Giannelli, Michele; Favareto, Andrea; Fawcett, William James; Fayard, Louis; Fedin, Oleg; Fedorko, Wojciech; Feigl, Simon; Feligioni, Lorenzo; Feng, Cunfeng; Feng, Eric; Feng, Haolu; Fenton, Michael James; Fenyuk, Alexander; Feremenga, Last; Fernandez Martinez, Patricia; Fernandez Perez, Sonia; Ferrando, James; Ferrari, Arnaud; Ferrari, Pamela; Ferrari, Roberto; Ferreira de Lima, Danilo Enoque; Ferrer, Antonio; Ferrere, Didier; Ferretti, Claudio; Fiedler, Frank; Filipčič, Andrej; Filipuzzi, Marco; Filthaut, Frank; Fincke-Keeler, Margret; Finelli, Kevin Daniel; Fiolhais, Miguel; Fiorini, Luca; Fischer, Adam; Fischer, Cora; Fischer, Julia; Fisher, Wade Cameron; Flaschel, Nils; Fleck, Ivor; Fleischmann, Philipp; Fletcher, Rob Roy MacGregor; Flick, Tobias; Flierl, Bernhard Matthias; Flores Castillo, Luis; Flowerdew, Michael; Forcolin, Giulio Tiziano; Formica, Andrea; Förster, Fabian Alexander; Forti, Alessandra; Foster, Andrew Geoffrey; Fournier, Daniel; Fox, Harald; Fracchia, Silvia; Francavilla, Paolo; Franchini, Matteo; Franchino, Silvia; Francis, David; Franconi, Laura; Franklin, Melissa; Frate, Meghan; Fraternali, Marco; Freeborn, David; Fressard-Batraneanu, Silvia; Freund, Benjamin; Froidevaux, Daniel; Frost, James; Fukunaga, Chikara; Fusayasu, Takahiro; Fuster, Juan; Gabaldon, Carolina; Gabizon, Ofir; Gabrielli, Alessandro; Gabrielli, Andrea; Gach, Grzegorz; Gadatsch, Stefan; Gadomski, Szymon; Gagliardi, Guido; Gagnon, Louis Guillaume; Galea, Cristina; Galhardo, Bruno; Gallas, Elizabeth; Gallop, Bruce; Gallus, Petr; Galster, Gorm Aske Gram Krohn; Gan, KK; Ganguly, Sanmay; Gao, Yanyan; Gao, Yongsheng; Garay Walls, Francisca; García, Carmen; García Navarro, José Enrique; Garcia-Sciveres, Maurice; Gardner, Robert; Garelli, Nicoletta; Garonne, Vincent; Gascon Bravo, Alberto; Gasnikova, Ksenia; Gatti, Claudio; Gaudiello, Andrea; Gaudio, Gabriella; Gavrilenko, Igor; Gay, Colin; Gaycken, Goetz; Gazis, Evangelos; Gee, Norman; Geisen, Jannik; Geisen, Marc; Geisler, Manuel Patrice; Gellerstedt, Karl; Gemme, Claudia; Genest, Marie-Hélène; Geng, Cong; Gentile, Simonetta; Gentsos, Christos; George, Simon; Gerbaudo, Davide; Gershon, Avi; Geß{}ner, Gregor; Ghasemi, Sara; Ghneimat, Mazuza; Giacobbe, Benedetto; Giagu, Stefano; Giannetti, Paola; Gibson, Stephen; Gignac, Matthew; Gilchriese, Murdock; Gillberg, Dag; Gilles, Geoffrey; Gingrich, Douglas; Giokaris, Nikos; Giordani, MarioPaolo; Giorgi, Filippo Maria; Giraud, Pierre-Francois; Giromini, Paolo; Giugni, Danilo; Giuli, Francesco; Giuliani, Claudia; Giulini, Maddalena; Gjelsten, Børge Kile; Gkaitatzis, Stamatios; Gkialas, Ioannis; Gkougkousis, Evangelos Leonidas; Gkountoumis, Panagiotis; Gladilin, Leonid; Glasman, Claudia; Glatzer, Julian; Glaysher, Paul; Glazov, Alexandre; Goblirsch-Kolb, Maximilian; Godlewski, Jan; Goldfarb, Steven; Golling, Tobias; Golubkov, Dmitry; Gomes, Agostinho; Gonçalo, Ricardo; Goncalves Gama, Rafael; Goncalves Pinto Firmino Da Costa, Joao; Gonella, Giulia; Gonella, Laura; Gongadze, Alexi; González de la Hoz, Santiago; Gonzalez-Sevilla, Sergio; Goossens, Luc; Gorbounov, Petr Andreevich; Gordon, Howard; Gorelov, Igor; Gorini, Benedetto; Gorini, Edoardo; Gorišek, Andrej; Goshaw, Alfred; Gössling, Claus; Gostkin, Mikhail Ivanovitch; Gottardo, Carlo Alberto; Goudet, Christophe Raymond; Goujdami, Driss; Goussiou, Anna; Govender, Nicolin; Gozani, Eitan; Graber, Lars; Grabowska-Bold, Iwona; Gradin, Per Olov Joakim; Gramling, Johanna; Gramstad, Eirik; Grancagnolo, Sergio; Gratchev, Vadim; Gravila, Paul Mircea; Gray, Chloe; Gray, Heather; Greenwood, Zeno Dixon; Grefe, Christian; Gregersen, Kristian; Gregor, Ingrid-Maria; Grenier, Philippe; Grevtsov, Kirill; Griffiths, Justin; Grillo, Alexander; Grimm, Kathryn; Grinstein, Sebastian; Gris, Philippe Luc Yves; Grivaz, Jean-Francois; Groh, Sabrina; Gross, Eilam; Grosse-Knetter, Joern; Grossi, Giulio Cornelio; Grout, Zara Jane; Grummer, Aidan; Guan, Liang; Guan, Wen; Guenther, Jaroslav; Guescini, Francesco; Guest, Daniel; Gueta, Orel; Gui, Bin; Guido, Elisa; Guillemin, Thibault; Guindon, Stefan; Gul, Umar; Gumpert, Christian; Guo, Jun; Guo, Wen; Guo, Yicheng; Gupta, Ruchi; Gupta, Shaun; Gustavino, Giuliano; Gutierrez, Phillip; Gutierrez Ortiz, Nicolas Gilberto; Gutschow, Christian; Guyot, Claude; Guzik, Marcin Pawel; Gwenlan, Claire; Gwilliam, Carl; Haas, Andy; Haber, Carl; Hadavand, Haleh Khani; Haddad, Nacim; Hadef, Asma; Hageböck, Stephan; Hagihara, Mutsuto; Hakobyan, Hrachya; Haleem, Mahsana; Haley, Joseph; Halladjian, Garabed; Hallewell, Gregory David; Hamacher, Klaus; Hamal, Petr; Hamano, Kenji; Hamilton, Andrew; Hamity, Guillermo Nicolas; Hamnett, Phillip George; Han, Liang; Han, Shuo; Hanagaki, Kazunori; Hanawa, Keita; Hance, Michael; Haney, Bijan; Hanke, Paul; Hansen, Jørgen Beck; Hansen, Jorn Dines; Hansen, Maike Christina; Hansen, Peter Henrik; Hara, Kazuhiko; Hard, Andrew; Harenberg, Torsten; Hariri, Faten; Harkusha, Siarhei; Harrington, Robert; Harrison, Paul Fraser; Hartmann, Nikolai Marcel; Hasegawa, Makoto; Hasegawa, Yoji; Hasib, Ahmed; Hassani, Samira; Haug, Sigve; Hauser, Reiner; Hauswald, Lorenz; Havener, Laura Brittany; Havranek, Miroslav; Hawkes, Christopher; Hawkings, Richard John; Hayakawa, Daiki; Hayden, Daniel; Hays, Chris; Hays, Jonathan Michael; Hayward, Helen; Haywood, Stephen; Head, Simon; Heck, Tobias; Hedberg, Vincent; Heelan, Louise; Heidegger, Kim Katrin; Heim, Sarah; Heim, Timon; Heinemann, Beate; Heinrich, Jochen Jens; Heinrich, Lukas; Heinz, Christian; Hejbal, Jiri; Helary, Louis; Held, Alexander; Hellman, Sten; Helsens, Clement; Henderson, Robert; Heng, Yang; Henkelmann, Steffen; Henriques Correia, Ana Maria; Henrot-Versille, Sophie; Herbert, Geoffrey Henry; Herde, Hannah; Herget, Verena; Hernández Jiménez, Yesenia; Herr, Holger; Herten, Gregor; Hertenberger, Ralf; Hervas, Luis; Herwig, Theodor Christian; Hesketh, Gavin Grant; Hessey, Nigel; Hetherly, Jeffrey Wayne; Higashino, Satoshi; Higón-Rodriguez, Emilio; Hill, Ewan; Hill, John; Hiller, Karl Heinz; Hillier, Stephen; Hils, Maximilian; Hinchliffe, Ian; Hirose, Minoru; Hirschbuehl, Dominic; Hiti, Bojan; Hladik, Ondrej; Hoad, Xanthe; Hobbs, John; Hod, Noam; Hodgkinson, Mark; Hodgson, Paul; Hoecker, Andreas; Hoeferkamp, Martin; Hoenig, Friedrich; Hohn, David; Holmes, Tova Ray; Homann, Michael; Honda, Shunsuke; Honda, Takuya; Hong, Tae Min; Hooberman, Benjamin Henry; Hopkins, Walter; Horii, Yasuyuki; Horton, Arthur James; Hostachy, Jean-Yves; Hou, Suen; Hoummada, Abdeslam; Howarth, James; Hoya, Joaquin; Hrabovsky, Miroslav; Hrdinka, Julia; Hristova, Ivana; Hrivnac, Julius; Hryn'ova, Tetiana; Hrynevich, Aliaksei; Hsu, Pai-hsien Jennifer; Hsu, Shih-Chieh; Hu, Qipeng; Hu, Shuyang; Huang, Yanping; Hubacek, Zdenek; Hubaut, Fabrice; Huegging, Fabian; Huffman, Todd Brian; Hughes, Emlyn; Hughes, Gareth; Huhtinen, Mika; Huo, Peng; Huseynov, Nazim; Huston, Joey; Huth, John; Iacobucci, Giuseppe; Iakovidis, Georgios; Ibragimov, Iskander; Iconomidou-Fayard, Lydia; Idrissi, Zineb; Iengo, Paolo; Igonkina, Olga; Iizawa, Tomoya; Ikegami, Yoichi; Ikeno, Masahiro; Ilchenko, Yuriy; Iliadis, Dimitrios; Ilic, Nikolina; Introzzi, Gianluca; Ioannou, Pavlos; Iodice, Mauro; Iordanidou, Kalliopi; Ippolito, Valerio; Isacson, Max Fredrik; Ishijima, Naoki; Ishino, Masaya; Ishitsuka, Masaki; Issever, Cigdem; Istin, Serhat; Ito, Fumiaki; Iturbe Ponce, Julia Mariana; Iuppa, Roberto; Iwasaki, Hiroyuki; Izen, Joseph; Izzo, Vincenzo; Jabbar, Samina; Jackson, Paul; Jacobs, Ruth Magdalena; Jain, Vivek; Jakobi, Katharina Bianca; Jakobs, Karl; Jakobsen, Sune; Jakoubek, Tomas; Jamin, David Olivier; Jana, Dilip; Jansky, Roland; Janssen, Jens; Janus, Michel; Janus, Piotr Andrzej; Jarlskog, Göran; Javadov, Namig; Javůrek, Tomáš; Javurkova, Martina; Jeanneau, Fabien; Jeanty, Laura; Jejelava, Juansher; Jelinskas, Adomas; Jenni, Peter; Jeske, Carl; Jézéquel, Stéphane; Ji, Haoshuang; Jia, Jiangyong; Jiang, Hai; Jiang, Yi; Jiang, Zihao; Jiggins, Stephen; Jimenez Pena, Javier; Jin, Shan; Jinaru, Adam; Jinnouchi, Osamu; Jivan, Harshna; Johansson, Per; Johns, Kenneth; Johnson, Christian; Johnson, William Joseph; Jon-And, Kerstin; Jones, Roger; Jones, Samuel David; Jones, Sarah; Jones, Tim; Jongmanns, Jan; Jorge, Pedro; Jovicevic, Jelena; Ju, Xiangyang; Juste Rozas, Aurelio; Köhler, Markus Konrad; Kaczmarska, Anna; Kado, Marumi; Kagan, Harris; Kagan, Michael; Kahn, Sebastien Jonathan; Kaji, Toshiaki; Kajomovitz, Enrique; Kalderon, Charles William; Kaluza, Adam; Kama, Sami; Kamenshchikov, Andrey; Kanaya, Naoko; Kanjir, Luka; Kantserov, Vadim; Kanzaki, Junichi; Kaplan, Benjamin; Kaplan, Laser Seymour; Kar, Deepak; Karakostas, Konstantinos; Karastathis, Nikolaos; Kareem, Mohammad Jawad; Karentzos, Efstathios; Karpov, Sergey; Karpova, Zoya; Karthik, Krishnaiyengar; Kartvelishvili, Vakhtang; Karyukhin, Andrey; Kasahara, Kota; Kashif, Lashkar; Kass, Richard; Kastanas, Alex; Kataoka, Yousuke; Kato, Chikuma; Katre, Akshay; Katzy, Judith; Kawade, Kentaro; Kawagoe, Kiyotomo; Kawamoto, Tatsuo; Kawamura, Gen; Kay, Ellis; Kazanin, Vassili; Keeler, Richard; Kehoe, Robert; Keller, John; Kempster, Jacob Julian; Kendrick, James; Keoshkerian, Houry; Kepka, Oldrich; Kerševan, Borut Paul; Kersten, Susanne; Keyes, Robert; Khader, Mazin; Khalil-zada, Farkhad; Khanov, Alexander; Kharlamov, Alexey; Kharlamova, Tatyana; Khodinov, Alexander; Khoo, Teng Jian; Khovanskiy, Valery; Khramov, Evgeniy; Khubua, Jemal; Kido, Shogo; Kilby, Callum; Kim, Hee Yeun; Kim, Shinhong; Kim, Young-Kee; Kimura, Naoki; Kind, Oliver Maria; King, Barry; Kirchmeier, David; Kirk, Julie; Kiryunin, Andrey; Kishimoto, Tomoe; Kisielewska, Danuta; Kiuchi, Kenji; Kivernyk, Oleh; Kladiva, Eduard; Klapdor-Kleingrothaus, Thorwald; Klein, Matthew Henry; Klein, Max; Klein, Uta; Kleinknecht, Konrad; Klimek, Pawel; Klimentov, Alexei; Klingenberg, Reiner; Klingl, Tobias; Klioutchnikova, Tatiana; Kluge, Eike-Erik; Kluit, Peter; Kluth, Stefan; Kneringer, Emmerich; Knoops, Edith; Knue, Andrea; Kobayashi, Aine; Kobayashi, Dai; Kobayashi, Tomio; Kobel, Michael; Kocian, Martin; Kodys, Peter; Koffas, Thomas; Koffeman, Els; Köhler, Nicolas Maximilian; Koi, Tatsumi; Kolb, Mathis; Koletsou, Iro; Komar, Aston; Komori, Yuto; Kondo, Takahiko; Kondrashova, Nataliia; Köneke, Karsten; König, Adriaan; Kono, Takanori; Konoplich, Rostislav; Konstantinidis, Nikolaos; Kopeliansky, Revital; Koperny, Stefan; Kopp, Anna Katharina; Korcyl, Krzysztof; Kordas, Kostantinos; Korn, Andreas; Korol, Aleksandr; Korolkov, Ilya; Korolkova, Elena; Kortner, Oliver; Kortner, Sandra; Kosek, Tomas; Kostyukhin, Vadim; Kotwal, Ashutosh; Koulouris, Aimilianos; Kourkoumeli-Charalampidi, Athina; Kourkoumelis, Christine; Kourlitis, Evangelos; Kouskoura, Vasiliki; Kowalewska, Anna Bozena; Kowalewski, Robert Victor; Kowalski, Tadeusz; Kozakai, Chihiro; Kozanecki, Witold; Kozhin, Anatoly; Kramarenko, Viktor; Kramberger, Gregor; Krasnopevtsev, Dimitrii; Krasny, Mieczyslaw Witold; Krasznahorkay, Attila; Krauss, Dominik; Kremer, Jakub Andrzej; Kretzschmar, Jan; Kreutzfeldt, Kristof; Krieger, Peter; Krizka, Karol; Kroeninger, Kevin; Kroha, Hubert; Kroll, Jiri; Kroll, Joe; Kroseberg, Juergen; Krstic, Jelena; Kruchonak, Uladzimir; Krüger, Hans; Krumnack, Nils; Kruse, Mark; Kubota, Takashi; Kucuk, Hilal; Kuday, Sinan; Kuechler, Jan Thomas; Kuehn, Susanne; Kugel, Andreas; Kuger, Fabian; Kuhl, Thorsten; Kukhtin, Victor; Kukla, Romain; Kulchitsky, Yuri; Kuleshov, Sergey; Kulinich, Yakov Petrovich; Kuna, Marine; Kunigo, Takuto; Kupco, Alexander; Kupfer, Tobias; Kuprash, Oleg; Kurashige, Hisaya; Kurchaninov, Leonid; Kurochkin, Yurii; Kurth, Matthew Glenn; Kus, Vlastimil; Kuwertz, Emma Sian; Kuze, Masahiro; Kvita, Jiri; Kwan, Tony; Kyriazopoulos, Dimitrios; La Rosa, Alessandro; La Rosa Navarro, Jose Luis; La Rotonda, Laura; Lacasta, Carlos; Lacava, Francesco; Lacey, James; Lacker, Heiko; Lacour, Didier; Ladygin, Evgueni; Lafaye, Remi; Laforge, Bertrand; Lagouri, Theodota; Lai, Stanley; Lammers, Sabine; Lampl, Walter; Lançon, Eric; Landgraf, Ulrich; Landon, Murrough; Lanfermann, Marie Christine; Lang, Valerie Susanne; Lange, J örn Christian; Langenberg, Robert Johannes; Lankford, Andrew; Lanni, Francesco; Lantzsch, Kerstin; Lanza, Agostino; Lapertosa, Alessandro; Laplace, Sandrine; Laporte, Jean-Francois; Lari, Tommaso; Lasagni Manghi, Federico; Lassnig, Mario; Laurelli, Paolo; Lavrijsen, Wim; Law, Alexander; Laycock, Paul; Lazovich, Tomo; Lazzaroni, Massimo; Le, Brian; Le Dortz, Olivier; Le Guirriec, Emmanuel; Le Quilleuc, Eloi; LeBlanc, Matthew Edgar; LeCompte, Thomas; Ledroit-Guillon, Fabienne; Lee, Claire Alexandra; Lee, Graham Richard; Lee, Shih-Chang; Lee, Lawrence; Lefebvre, Benoit; Lefebvre, Guillaume; Lefebvre, Michel; Legger, Federica; Leggett, Charles; Lehan, Allan; Lehmann Miotto, Giovanna; Lei, Xiaowen; Leight, William Axel; Leite, Marco Aurelio Lisboa; Leitner, Rupert; Lellouch, Daniel; Lemmer, Boris; Leney, Katharine; Lenz, Tatjana; Lenzi, Bruno; Leone, Robert; Leone, Sandra; Leonidopoulos, Christos; Lerner, Giuseppe; Leroy, Claude; Lesage, Arthur; Lester, Christopher; Levchenko, Mikhail; Levêque, Jessica; Levin, Daniel; Levinson, Lorne; Levy, Mark; Lewis, Dave; Li, Bing; Li, Changqiao; Li, Haifeng; Li, Liang; Li, Qi; Li, Shu; Li, Xingguo; Li, Yichen; Liang, Zhijun; Liberti, Barbara; Liblong, Aaron; Lie, Ki; Liebal, Jessica; Liebig, Wolfgang; Limosani, Antonio; Lin, Simon; Lin, Tai-Hua; Lindquist, Brian Edward; Lionti, Anthony Eric; Lipeles, Elliot; Lipniacka, Anna; Lisovyi, Mykhailo; Liss, Tony; Lister, Alison; Litke, Alan; Liu, Bo; Liu, Hao; Liu, Hongbin; Liu, Jesse Kar Kee; Liu, Jian; Liu, Jianbei; Liu, Kun; Liu, Lulu; Liu, Minghui; Liu, Yanlin; Liu, Yanwen; Livan, Michele; Lleres, Annick; Llorente Merino, Javier; Lloyd, Stephen; Lo, Cheuk Yee; Lo Sterzo, Francesco; Lobodzinska, Ewelina Maria; Loch, Peter; Loebinger, Fred; Loesle, Alena; Loew, Kevin Michael; Loginov, Andrey; Lohse, Thomas; Lohwasser, Kristin; Lokajicek, Milos; Long, Brian Alexander; Long, Jonathan David; Long, Robin Eamonn; Longo, Luigi; Looper, Kristina Anne; Lopez, Jorge; Lopez Mateos, David; Lopez Paz, Ivan; Lopez Solis, Alvaro; Lorenz, Jeanette; Lorenzo Martinez, Narei; Losada, Marta; Lösel, Philipp Jonathan; Lou, XinChou; Lounis, Abdenour; Love, Jeremy; Love, Peter; Lu, Haonan; Lu, Nan; Lu, Yun-Ju; Lubatti, Henry; Luci, Claudio; Lucotte, Arnaud; Luedtke, Christian; Luehring, Frederick; Lukas, Wolfgang; Luminari, Lamberto; Lundberg, Olof; Lund-Jensen, Bengt; Luzi, Pierre Marc; Lynn, David; Lysak, Roman; Lytken, Else; Lyubushkin, Vladimir; Ma, Hong; Ma, Lian Liang; Ma, Yanhui; Maccarrone, Giovanni; Macchiolo, Anna; Macdonald, Calum Michael; Maček, Boštjan; Machado Miguens, Joana; Madaffari, Daniele; Madar, Romain; Mader, Wolfgang; Madsen, Alexander; Maeda, Junpei; Maeland, Steffen; Maeno, Tadashi; Maevskiy, Artem; Magradze, Erekle; Mahlstedt, Joern; Maiani, Camilla; Maidantchik, Carmen; Maier, Andreas Alexander; Maier, Thomas; Maio, Amélia; Majersky, Oliver; Majewski, Stephanie; Makida, Yasuhiro; Makovec, Nikola; Malaescu, Bogdan; Malecki, Pawel; Maleev, Victor; Malek, Fairouz; Mallik, Usha; Malon, David; Malone, Claire; Maltezos, Stavros; Malyukov, Sergei; Mamuzic, Judita; Mancini, Giada; Mandelli, Luciano; Mandić, Igor; Maneira, José; Manhaes de Andrade Filho, Luciano; Manjarres Ramos, Joany; Mann, Alexander; Manousos, Athanasios; Mansoulie, Bruno; Mansour, Jason Dhia; Mantifel, Rodger; Mantoani, Matteo; Manzoni, Stefano; Mapelli, Livio; Marceca, Gino; March, Luis; Marchese, Luigi; Marchiori, Giovanni; Marcisovsky, Michal; Marjanovic, Marija; Marley, Daniel; Marroquim, Fernando; Marsden, Stephen Philip; Marshall, Zach; Martensson, Mikael; Marti-Garcia, Salvador; Martin, Christopher Blake; Martin, Tim; Martin, Victoria Jane; Martin dit Latour, Bertrand; Martinez, Mario; Martinez Outschoorn, Verena; Martin-Haugh, Stewart; Martoiu, Victor Sorin; Martyniuk, Alex; Marzin, Antoine; Masetti, Lucia; Mashimo, Tetsuro; Mashinistov, Ruslan; Masik, Jiri; Maslennikov, Alexey; Massa, Lorenzo; Mastrandrea, Paolo; Mastroberardino, Anna; Masubuchi, Tatsuya; Mättig, Peter; Maurer, Julien; Maxfield, Stephen; Maximov, Dmitriy; Mazini, Rachid; Maznas, Ioannis; Mazza, Simone Michele; Mc Fadden, Neil Christopher; Mc Goldrick, Garrin; Mc Kee, Shawn Patrick; McCarn, Allison; McCarthy, Robert; McCarthy, Tom; McClymont, Laurie; McDonald, Emily; Mcfayden, Josh; Mchedlidze, Gvantsa; McMahon, Steve; McNamara, Peter Charles; McPherson, Robert; Meehan, Samuel; Megy, Theo Jean; Mehlhase, Sascha; Mehta, Andrew; Meideck, Thomas; Meier, Karlheinz; Meirose, Bernhard; Melini, Davide; Mellado Garcia, Bruce Rafael; Mellenthin, Johannes Donatus; Melo, Matej; Meloni, Federico; Menary, Stephen Burns; Meng, Lingxin; Meng, Xiangting; Mengarelli, Alberto; Menke, Sven; Meoni, Evelin; Mergelmeyer, Sebastian; Mermod, Philippe; Merola, Leonardo; Meroni, Chiara; Merritt, Frank; Messina, Andrea; Metcalfe, Jessica; Mete, Alaettin Serhan; Meyer, Christopher; Meyer, Jean-Pierre; Meyer, Jochen; Meyer Zu Theenhausen, Hanno; Miano, Fabrizio; Middleton, Robin; Miglioranzi, Silvia; Mijović, Liza; Mikenberg, Giora; Mikestikova, Marcela; Mikuž, Marko; Milesi, Marco; Milic, Adriana; Miller, David; Mills, Corrinne; Milov, Alexander; Milstead, David; Minaenko, Andrey; Minami, Yuto; Minashvili, Irakli; Mincer, Allen; Mindur, Bartosz; Mineev, Mikhail; Minegishi, Yuji; Ming, Yao; Mir, Lluisa-Maria; Mistry, Khilesh; Mitani, Takashi; Mitrevski, Jovan; Mitsou, Vasiliki A; Miucci, Antonio; Miyagawa, Paul; Mizukami, Atsushi; Mjörnmark, Jan-Ulf; Mkrtchyan, Tigran; Mlynarikova, Michaela; Moa, Torbjoern; Mochizuki, Kazuya; Mogg, Philipp; Mohapatra, Soumya; Molander, Simon; Moles-Valls, Regina; Monden, Ryutaro; Mondragon, Matthew Craig; Mönig, Klaus; Monk, James; Monnier, Emmanuel; Montalbano, Alyssa; Montejo Berlingen, Javier; Monticelli, Fernando; Monzani, Simone; Moore, Roger; Morange, Nicolas; Moreno, Deywis; Moreno Llácer, María; Morettini, Paolo; Morgenstern, Stefanie; Mori, Daniel; Mori, Tatsuya; Morii, Masahiro; Morinaga, Masahiro; Morisbak, Vanja; Morley, Anthony Keith; Mornacchi, Giuseppe; Morris, John; Morvaj, Ljiljana; Moschovakos, Paris; Mosidze, Maia; Moss, Harry James; Moss, Josh; Motohashi, Kazuki; Mount, Richard; Mountricha, Eleni; Moyse, Edward; Muanza, Steve; Mudd, Richard; Mueller, Felix; Mueller, James; Mueller, Ralph Soeren Peter; Muenstermann, Daniel; Mullen, Paul; Mullier, Geoffrey; Munoz Sanchez, Francisca Javiela; Murray, Bill; Musheghyan, Haykuhi; Muškinja, Miha; Myagkov, Alexey; Myska, Miroslav; Nachman, Benjamin Philip; Nackenhorst, Olaf; Nagai, Koichi; Nagai, Ryo; Nagano, Kunihiro; Nagasaka, Yasushi; Nagata, Kazuki; Nagel, Martin; Nagy, Elemer; Nairz, Armin Michael; Nakahama, Yu; Nakamura, Koji; Nakamura, Tomoaki; Nakano, Itsuo; Naranjo Garcia, Roger Felipe; Narayan, Rohin; Narrias Villar, Daniel Isaac; Naryshkin, Iouri; Naumann, Thomas; Navarro, Gabriela; Nayyar, Ruchika; Neal, Homer; Nechaeva, Polina; Neep, Thomas James; Negri, Andrea; Negrini, Matteo; Nektarijevic, Snezana; Nellist, Clara; Nelson, Andrew; Nelson, Michael Edward; Nemecek, Stanislav; Nemethy, Peter; Nessi, Marzio; Neubauer, Mark; Neumann, Manuel; Newman, Paul; Ng, Tsz Yu; Nguyen Manh, Tuan; Nickerson, Richard; Nicolaidou, Rosy; Nielsen, Jason; Nikolaenko, Vladimir; Nikolic-Audit, Irena; Nikolopoulos, Konstantinos; Nilsen, Jon Kerr; Nilsson, Paul; Ninomiya, Yoichi; Nisati, Aleandro; Nishu, Nishu; Nisius, Richard; Nitsche, Isabel; Nobe, Takuya; Noguchi, Yohei; Nomachi, Masaharu; Nomidis, Ioannis; Nomura, Marcelo Ayumu; Nooney, Tamsin; Nordberg, Markus; Norjoharuddeen, Nurfikri; Novgorodova, Olga; Nowak, Sebastian; Nozaki, Mitsuaki; Nozka, Libor; Ntekas, Konstantinos; Nurse, Emily; Nuti, Francesco; O'connor, Kelsey; O'Neil, Dugan; O'Rourke, Abigail Alexandra; O'Shea, Val; Oakham, Gerald; Oberlack, Horst; Obermann, Theresa; Ocariz, Jose; Ochi, Atsuhiko; Ochoa, Ines; Ochoa-Ricoux, Juan Pedro; Oda, Susumu; Odaka, Shigeru; Ogren, Harold; Oh, Alexander; Oh, Seog; Ohm, Christian; Ohman, Henrik; Oide, Hideyuki; Okawa, Hideki; Okumura, Yasuyuki; Okuyama, Toyonobu; Olariu, Albert; Oleiro Seabra, Luis Filipe; Olivares Pino, Sebastian Andres; Oliveira Damazio, Denis; Olszewski, Andrzej; Olszowska, Jolanta; Onofre, António; Onogi, Kouta; Onyisi, Peter; Oreglia, Mark; Oren, Yona; Orestano, Domizia; Orlando, Nicola; Orr, Robert; Osculati, Bianca; Ospanov, Rustem; Otero y Garzon, Gustavo; Otono, Hidetoshi; Ouchrif, Mohamed; Ould-Saada, Farid; Ouraou, Ahmimed; Oussoren, Koen Pieter; Ouyang, Qun; Owen, Mark; Owen, Rhys Edward; Ozcan, Veysi Erkcan; Ozturk, Nurcan; Pachal, Katherine; Pacheco Pages, Andres; Pacheco Rodriguez, Laura; Padilla Aranda, Cristobal; Pagan Griso, Simone; Paganini, Michela; Paige, Frank; Palacino, Gabriel; Palazzo, Serena; Palestini, Sandro; Palka, Marek; Pallin, Dominique; Panagiotopoulou, Evgenia; Panagoulias, Ilias; Pandini, Carlo Enrico; Panduro Vazquez, William; Pani, Priscilla; Panitkin, Sergey; Pantea, Dan; Paolozzi, Lorenzo; Papadopoulou, Theodora; Papageorgiou, Konstantinos; Paramonov, Alexander; Paredes Hernandez, Daniela; Parker, Adam Jackson; Parker, Michael Andrew; Parker, Kerry Ann; Parodi, Fabrizio; Parsons, John; Parzefall, Ulrich; Pascuzzi, Vincent; Pasner, Jacob Martin; Pasqualucci, Enrico; Passaggio, Stefano; Pastore, Francesca; Pataraia, Sophio; Pater, Joleen; Pauly, Thilo; Pearson, Benjamin; Pedraza Lopez, Sebastian; Pedro, Rute; Peleganchuk, Sergey; Penc, Ondrej; Peng, Cong; Peng, Haiping; Penwell, John; Peralva, Bernardo; Perego, Marta Maria; Perepelitsa, Dennis; Perini, Laura; Pernegger, Heinz; Perrella, Sabrina; Peschke, Richard; Peshekhonov, Vladimir; Peters, Krisztian; Peters, Yvonne; Petersen, Brian; Petersen, Troels; Petit, Elisabeth; Petridis, Andreas; Petridou, Chariclia; Petroff, Pierre; Petrolo, Emilio; Petrov, Mariyan; Petrucci, Fabrizio; Pettersson, Nora Emilia; Peyaud, Alan; Pezoa, Raquel; Phillips, Forrest Hays; Phillips, Peter William; Piacquadio, Giacinto; Pianori, Elisabetta; Picazio, Attilio; Piccaro, Elisa; Pickering, Mark Andrew; Piegaia, Ricardo; Pilcher, James; Pilkington, Andrew; Pin, Arnaud Willy J; Pinamonti, Michele; Pinfold, James; Pirumov, Hayk; Pitt, Michael; Plazak, Lukas; Pleier, Marc-Andre; Pleskot, Vojtech; Plotnikova, Elena; Pluth, Daniel; Podberezko, Pavel; Poettgen, Ruth; Poggi, Riccardo; Poggioli, Luc; Pohl, David-leon; Polesello, Giacomo; Poley, Anne-luise; Policicchio, Antonio; Polifka, Richard; Polini, Alessandro; Pollard, Christopher Samuel; Polychronakos, Venetios; Pommès, Kathy; Ponomarenko, Daniil; Pontecorvo, Ludovico; Pope, Bernard; Popeneciu, Gabriel Alexandru; Poppleton, Alan; Pospisil, Stanislav; Potamianos, Karolos; Potrap, Igor; Potter, Christina; Poulard, Gilbert; Poulsen, Trine; Poveda, Joaquin; Pozo Astigarraga, Mikel Eukeni; Pralavorio, Pascal; Pranko, Aliaksandr; Prell, Soeren; Price, Darren; Price, Lawrence; Primavera, Margherita; Prince, Sebastien; Proklova, Nadezda; Prokofiev, Kirill; Prokoshin, Fedor; Protopopescu, Serban; Proudfoot, James; Przybycien, Mariusz; Puri, Akshat; Puzo, Patrick; Qian, Jianming; Qin, Gang; Qin, Yang; Quadt, Arnulf; Queitsch-Maitland, Michaela; Quilty, Donnchadha; Raddum, Silje; Radeka, Veljko; Radescu, Voica; Radhakrishnan, Sooraj Krishnan; Radloff, Peter; Rados, Pere; Ragusa, Francesco; Rahal, Ghita; Raine, John Andrew; Rajagopalan, Srinivasan; Rangel-Smith, Camila; Rashid, Tasneem; Raspopov, Sergii; Ratti, Maria Giulia; Rauch, Daniel; Rauscher, Felix; Rave, Stefan; Ravinovich, Ilia; Rawling, Jacob Henry; Raymond, Michel; Read, Alexander Lincoln; Readioff, Nathan Peter; Reale, Marilea; Rebuzzi, Daniela; Redelbach, Andreas; Redlinger, George; Reece, Ryan; Reed, Robert; Reeves, Kendall; Rehnisch, Laura; Reichert, Joseph; Reiss, Andreas; Rembser, Christoph; Ren, Huan; Rescigno, Marco; Resconi, Silvia; Resseguie, Elodie Deborah; Rettie, Sebastien; Reynolds, Elliot; Rezanova, Olga; Reznicek, Pavel; Rezvani, Reyhaneh; Richter, Robert; Richter, Stefan; Richter-Was, Elzbieta; Ricken, Oliver; Ridel, Melissa; Rieck, Patrick; Riegel, Christian Johann; Rieger, Julia; Rifki, Othmane; Rijssenbeek, Michael; Rimoldi, Adele; Rimoldi, Marco; Rinaldi, Lorenzo; Ripellino, Giulia; Ristić, Branislav; Ritsch, Elmar; Riu, Imma; Rizatdinova, Flera; Rizvi, Eram; Rizzi, Chiara; Roberts, Rhys Thomas; Robertson, Steven; Robichaud-Veronneau, Andree; Robinson, Dave; Robinson, James; Robson, Aidan; Rocco, Elena; Roda, Chiara; Rodina, Yulia; Rodriguez Bosca, Sergi; Rodriguez Perez, Andrea; Rodriguez Rodriguez, Daniel; Roe, Shaun; Rogan, Christopher Sean; Røhne, Ole; Roloff, Jennifer; Romaniouk, Anatoli; Romano, Marino; Romano Saez, Silvestre Marino; Romero Adam, Elena; Rompotis, Nikolaos; Ronzani, Manfredi; Roos, Lydia; Rosati, Stefano; Rosbach, Kilian; Rose, Peyton; Rosien, Nils-Arne; Rossi, Elvira; Rossi, Leonardo Paolo; Rosten, Jonatan; Rosten, Rachel; Rotaru, Marina; Roth, Itamar; Rothberg, Joseph; Rousseau, David; Rozanov, Alexandre; Rozen, Yoram; Ruan, Xifeng; Rubbo, Francesco; Rühr, Frederik; Ruiz-Martinez, Aranzazu; Rurikova, Zuzana; Rusakovich, Nikolai; Russell, Heather; Rutherfoord, John; Ruthmann, Nils; Ryabov, Yury; Rybar, Martin; Rybkin, Grigori; Ryu, Soo; Ryzhov, Andrey; Rzehorz, Gerhard Ferdinand; Saavedra, Aldo; Sabato, Gabriele; Sacerdoti, Sabrina; Sadrozinski, Hartmut; Sadykov, Renat; Safai Tehrani, Francesco; Saha, Puja; Sahinsoy, Merve; Saimpert, Matthias; Saito, Masahiko; Saito, Tomoyuki; Sakamoto, Hiroshi; Sakurai, Yuki; Salamanna, Giuseppe; Salazar Loyola, Javier Esteban; Salek, David; Sales De Bruin, Pedro Henrique; Salihagic, Denis; Salnikov, Andrei; Salt, José; Salvatore, Daniela; Salvatore, Pasquale Fabrizio; Salvucci, Antonio; Salzburger, Andreas; Sammel, Dirk; Sampsonidis, Dimitrios; Sampsonidou, Despoina; Sánchez, Javier; Sanchez Martinez, Victoria; Sanchez Pineda, Arturo Rodolfo; Sandaker, Heidi; Sandbach, Ruth Laura; Sander, Christian Oliver; Sandhoff, Marisa; Sandoval, Carlos; Sankey, Dave; Sannino, Mario; Sansoni, Andrea; Santoni, Claudio; Santonico, Rinaldo; Santos, Helena; Santoyo Castillo, Itzebelt; Sapronov, Andrey; Saraiva, João; Sarrazin, Bjorn; Sasaki, Osamu; Sato, Koji; Sauvan, Emmanuel; Savage, Graham; Savard, Pierre; Savic, Natascha; Sawyer, Craig; Sawyer, Lee; Saxon, James; Sbarra, Carla; Sbrizzi, Antonio; Scanlon, Tim; Scannicchio, Diana; Scarcella, Mark; Scarfone, Valerio; Schaarschmidt, Jana; Schacht, Peter; Schachtner, Balthasar Maria; Schaefer, Douglas; Schaefer, Leigh; Schaefer, Ralph; Schaeffer, Jan; Schaepe, Steffen; Schaetzel, Sebastian; Schäfer, Uli; Schaffer, Arthur; Schaile, Dorothee; Schamberger, R Dean; Scharf, Veit; Schegelsky, Valery; Scheirich, Daniel; Schernau, Michael; Schiavi, Carlo; Schier, Sheena; Schildgen, Lara Katharina; Schillo, Christian; Schioppa, Marco; Schlenker, Stefan; Schmidt-Sommerfeld, Korbinian Ralf; Schmieden, Kristof; Schmitt, Christian; Schmitt, Stefan; Schmitz, Simon; Schnoor, Ulrike; Schoeffel, Laurent; Schoening, Andre; Schoenrock, Bradley Daniel; Schopf, Elisabeth; Schott, Matthias; Schouwenberg, Jeroen; Schovancova, Jaroslava; Schramm, Steven; Schuh, Natascha; Schulte, Alexandra; Schultens, Martin Johannes; Schultz-Coulon, Hans-Christian; Schulz, Holger; Schumacher, Markus; Schumm, Bruce; Schune, Philippe; Schwartzman, Ariel; Schwarz, Thomas Andrew; Schweiger, Hansdieter; Schwemling, Philippe; Schwienhorst, Reinhard; Schwindling, Jerome; Sciandra, Andrea; Sciolla, Gabriella; Scuri, Fabrizio; Scutti, Federico; Searcy, Jacob; Seema, Pienpen; Seidel, Sally; Seiden, Abraham; Seixas, José; Sekhniaidze, Givi; Sekhon, Karishma; Sekula, Stephen; Semprini-Cesari, Nicola; Senkin, Sergey; Serfon, Cedric; Serin, Laurent; Serkin, Leonid; Sessa, Marco; Seuster, Rolf; Severini, Horst; Sfiligoj, Tina; Sforza, Federico; Sfyrla, Anna; Shabalina, Elizaveta; Shaikh, Nabila Wahab; Shan, Lianyou; Shang, Ruo-yu; Shank, James; Shapiro, Marjorie; Shatalov, Pavel; Shaw, Kate; Shaw, Savanna Marie; Shcherbakova, Anna; Shehu, Ciwake Yusufu; Shen, Yu-Ting; Sherafati, Nima; Sherwood, Peter; Shi, Liaoshan; Shimizu, Shima; Shimmin, Chase Owen; Shimojima, Makoto; Shipsey, Ian Peter Joseph; Shirabe, Shohei; Shiyakova, Mariya; Shlomi, Jonathan; Shmeleva, Alevtina; Shoaleh Saadi, Diane; Shochet, Mel; Shojaii, Seyed Ruhollah; Shope, David Richard; Shrestha, Suyog; Shulga, Evgeny; Shupe, Michael; Sicho, Petr; Sickles, Anne Marie; Sidebo, Per Edvin; Sideras Haddad, Elias; Sidiropoulou, Ourania; Sidoti, Antonio; Siegert, Frank; Sijacki, Djordje; Silva, José; Silverstein, Samuel; Simak, Vladislav; Simic, Ljiljana; Simion, Stefan; Simioni, Eduard; Simmons, Brinick; Simon, Manuel; Sinervo, Pekka; Sinev, Nikolai; Sioli, Maximiliano; Siragusa, Giovanni; Siral, Ismet; Sivoklokov, Serguei; Sjölin, Jörgen; Skinner, Malcolm Bruce; Skubic, Patrick; Slater, Mark; Slavicek, Tomas; Slawinska, Magdalena; Sliwa, Krzysztof; Slovak, Radim; Smakhtin, Vladimir; Smart, Ben; Smiesko, Juraj; Smirnov, Nikita; Smirnov, Sergei; Smirnov, Yury; Smirnova, Lidia; Smirnova, Oxana; Smith, Joshua Wyatt; Smith, Matthew; Smith, Russell; Smizanska, Maria; Smolek, Karel; Snesarev, Andrei; Snyder, Ian Michael; Snyder, Scott; Sobie, Randall; Socher, Felix; Soffer, Abner; Soh, Dart-yin; Sokhrannyi, Grygorii; Solans Sanchez, Carlos; Solar, Michael; Soldatov, Evgeny; Soldevila, Urmila; Solodkov, Alexander; Soloshenko, Alexei; Solovyanov, Oleg; Solovyev, Victor; Sommer, Philip; Son, Hyungsuk; Sopczak, Andre; Sosa, David; Sotiropoulou, Calliope Louisa; Soualah, Rachik; Soukharev, Andrey; South, David; Sowden, Benjamin; Spagnolo, Stefania; Spalla, Margherita; Spangenberg, Martin; Spanò, Francesco; Sperlich, Dennis; Spettel, Fabian; Spieker, Thomas Malte; Spighi, Roberto; Spigo, Giancarlo; Spiller, Laurence Anthony; Spousta, Martin; St Denis, Richard Dante; Stabile, Alberto; Stamen, Rainer; Stamm, Soren; Stanecka, Ewa; Stanek, Robert; Stanescu, Cristian; Stanitzki, Marcel Michael; Stapf, Birgit Sylvia; Stapnes, Steinar; Starchenko, Evgeny; Stark, Giordon; Stark, Jan; Stark, Simon Holm; Staroba, Pavel; Starovoitov, Pavel; Stärz, Steffen; Staszewski, Rafal; Steinberg, Peter; Stelzer, Bernd; Stelzer, Harald Joerg; Stelzer-Chilton, Oliver; Stenzel, Hasko; Stewart, Graeme; Stockton, Mark; Stoebe, Michael; Stoicea, Gabriel; Stolte, Philipp; Stonjek, Stefan; Stradling, Alden; Straessner, Arno; Stramaglia, Maria Elena; Strandberg, Jonas; Strandberg, Sara; Strauss, Michael; Strizenec, Pavol; Ströhmer, Raimund; Strom, David; Stroynowski, Ryszard; Strubig, Antonia; Stucci, Stefania Antonia; Stugu, Bjarne; Styles, Nicholas Adam; Su, Dong; Su, Jun; Suchek, Stanislav; Sugaya, Yorihito; Suk, Michal; Sulin, Vladimir; Sultan, D M S; Sultansoy, Saleh; Sumida, Toshi; Sun, Siyuan; Sun, Xiaohu; Suruliz, Kerim; Suster, Carl; Sutton, Mark; Suzuki, Shota; Svatos, Michal; Swiatlowski, Maximilian; Swift, Stewart Patrick; Sykora, Ivan; Sykora, Tomas; Ta, Duc; Tackmann, Kerstin; Taenzer, Joe; Taffard, Anyes; Tafirout, Reda; Taiblum, Nimrod; Takai, Helio; Takashima, Ryuichi; Takasugi, Eric Hayato; Takeshita, Tohru; Takubo, Yosuke; Talby, Mossadek; Talyshev, Alexey; Tanaka, Junichi; Tanaka, Masahiro; Tanaka, Reisaburo; Tanaka, Shuji; Tanioka, Ryo; Tannenwald, Benjamin Bordy; Tapia Araya, Sebastian; Tapprogge, Stefan; Tarem, Shlomit; Tartarelli, Giuseppe Francesco; Tas, Petr; Tasevsky, Marek; Tashiro, Takuya; Tassi, Enrico; Tavares Delgado, Ademar; Tayalati, Yahya; Taylor, Aaron; Taylor, Geoffrey; Taylor, Pierre Thor Elliot; Taylor, Wendy; Teixeira-Dias, Pedro; Temple, Darren; Ten Kate, Herman; Teng, Ping-Kun; Teoh, Jia Jian; Tepel, Fabian-Phillipp; Terada, Susumu; Terashi, Koji; Terron, Juan; Terzo, Stefano; Testa, Marianna; Teuscher, Richard; Theveneaux-Pelzer, Timothée; Thomas, Juergen; Thomas-Wilsker, Joshuha; Thompson, Paul; Thompson, Stan; Thomsen, Lotte Ansgaard; Thomson, Evelyn; Tibbetts, Mark James; Ticse Torres, Royer Edson; Tikhomirov, Vladimir; Tikhonov, Yury; Timoshenko, Sergey; Tipton, Paul; Tisserant, Sylvain; Todome, Kazuki; Todorova-Nova, Sharka; Tojo, Junji; Tokár, Stanislav; Tokushuku, Katsuo; Tolley, Emma; Tomlinson, Lee; Tomoto, Makoto; Tompkins, Lauren; Toms, Konstantin; Tong, Baojia(Tony); Tornambe, Peter; Torrence, Eric; Torres, Heberth; Torró Pastor, Emma; Toth, Jozsef; Touchard, Francois; Tovey, Daniel; Treado, Colleen Jennifer; Trefzger, Thomas; Tresoldi, Fabio; Tricoli, Alessandro; Trigger, Isabel Marian; Trincaz-Duvoid, Sophie; Tripiana, Martin; Trischuk, William; Trocmé, Benjamin; Trofymov, Artur; Troncon, Clara; Trottier-McDonald, Michel; Trovatelli, Monica; Truong, Loan; Trzebinski, Maciej; Trzupek, Adam; Tsang, Ka Wa; Tseng, Jeffrey; Tsiareshka, Pavel; Tsipolitis, Georgios; Tsirintanis, Nikolaos; Tsiskaridze, Shota; Tsiskaridze, Vakhtang; Tskhadadze, Edisher; Tsui, Ka Ming; Tsukerman, Ilya; Tsulaia, Vakhtang; Tsuno, Soshi; Tsybychev, Dmitri; Tu, Yanjun; Tudorache, Alexandra; Tudorache, Valentina; Tulbure, Traian Tiberiu; Tuna, Alexander Naip; Tupputi, Salvatore; Turchikhin, Semen; Turgeman, Daniel; Turk Cakir, Ilkay; Turra, Ruggero; Tuts, Michael; Ucchielli, Giulia; Ueda, Ikuo; Ughetto, Michael; Ukegawa, Fumihiko; Unal, Guillaume; Undrus, Alexander; Unel, Gokhan; Ungaro, Francesca; Unno, Yoshinobu; Unverdorben, Christopher; Urban, Jozef; Urquijo, Phillip; Urrejola, Pedro; Usai, Giulio; Usui, Junya; Vacavant, Laurent; Vacek, Vaclav; Vachon, Brigitte; Valderanis, Chrysostomos; Valdes Santurio, Eduardo; Valentinetti, Sara; Valero, Alberto; Valéry, Lo\\"ic; Valkar, Stefan; Vallier, Alexis; Valls Ferrer, Juan Antonio; Van Den Wollenberg, Wouter; van der Graaf, Harry; van Gemmeren, Peter; Van Nieuwkoop, Jacobus; van Vulpen, Ivo; van Woerden, Marius Cornelis; Vanadia, Marco; Vandelli, Wainer; Vaniachine, Alexandre; Vankov, Peter; Vardanyan, Gagik; Vari, Riccardo; Varnes, Erich; Varni, Carlo; Varol, Tulin; Varouchas, Dimitris; Vartapetian, Armen; Varvell, Kevin; Vasquez, Jared Gregory; Vasquez, Gerardo; Vazeille, Francois; Vazquez Schroeder, Tamara; Veatch, Jason; Veeraraghavan, Venkatesh; Veloce, Laurelle Maria; Veloso, Filipe; Veneziano, Stefano; Ventura, Andrea; Venturi, Manuela; Venturi, Nicola; Venturini, Alessio; Vercesi, Valerio; Verducci, Monica; Verkerke, Wouter; Vermeulen, Ambrosius Thomas; Vermeulen, Jos; Vetterli, Michel; Viaux Maira, Nicolas; Viazlo, Oleksandr; Vichou, Irene; Vickey, Trevor; Vickey Boeriu, Oana Elena; Viehhauser, Georg; Viel, Simon; Vigani, Luigi; Villa, Mauro; Villaplana Perez, Miguel; Vilucchi, Elisabetta; Vincter, Manuella; Vinogradov, Vladimir; Vishwakarma, Akanksha; Vittori, Camilla; Vivarelli, Iacopo; Vlachos, Sotirios; Vlasak, Michal; Vogel, Marcelo; Vokac, Petr; Volpi, Guido; von der Schmitt, Hans; von Toerne, Eckhard; Vorobel, Vit; Vorobev, Konstantin; Vos, Marcel; Voss, Rudiger; Vossebeld, Joost; Vranjes, Nenad; Vranjes Milosavljevic, Marija; Vrba, Vaclav; Vreeswijk, Marcel; Vuillermet, Raphael; Vukotic, Ilija; Wagner, Peter; Wagner, Wolfgang; Wagner-Kuhr, Jeannine; Wahlberg, Hernan; Wahrmund, Sebastian; Wakabayashi, Jun; Walder, James; Walker, Rodney; Walkowiak, Wolfgang; Wallangen, Veronica; Wang, Chao; Wang, Chao; Wang, Fuquan; Wang, Haichen; Wang, Hulin; Wang, Jike; Wang, Jin; Wang, Qing; Wang, Rui; Wang, Song-Ming; Wang, Tingting; Wang, Wei; Wang, Wenxiao; Wang, Zirui; Wanotayaroj, Chaowaroj; Warburton, Andreas; Ward, Patricia; Wardrope, David Robert; Washbrook, Andrew; Watkins, Peter; Watson, Alan; Watson, Miriam; Watts, Gordon; Watts, Stephen; Waugh, Ben; Webb, Aaron Foley; Webb, Samuel; Weber, Michele; Weber, Stefan Wolf; Weber, Stephen; Webster, Jordan S; Weidberg, Anthony; Weinert, Benjamin; Weingarten, Jens; Weirich, Marcel; Weiser, Christian; Weits, Hartger; Wells, Phillippa; Wenaus, Torre; Wengler, Thorsten; Wenig, Siegfried; Wermes, Norbert; Werner, Michael David; Werner, Per; Wessels, Martin; Whalen, Kathleen; Whallon, Nikola Lazar; Wharton, Andrew Mark; White, Aaron; White, Andrew; White, Martin; White, Ryan; Whiteson, Daniel; Whitmore, Ben William; Wickens, Fred; Wiedenmann, Werner; Wielers, Monika; Wiglesworth, Craig; Wiik-Fuchs, Liv Antje Mari; Wildauer, Andreas; Wilk, Fabian; Wilkens, Henric George; Williams, Hugh; Williams, Sarah; Willis, Christopher; Willocq, Stephane; Wilson, John; Wingerter-Seez, Isabelle; Winkels, Emma; Winklmeier, Frank; Winston, Oliver James; Winter, Benedict Tobias; Wittgen, Matthias; Wobisch, Markus; Wolf, Tim Michael Heinz; Wolff, Robert; Wolter, Marcin Wladyslaw; Wolters, Helmut; Wong, Vincent Wai Sum; Worm, Steven; Wosiek, Barbara; Wotschack, Jorg; Wozniak, Krzysztof; Wu, Miles; Wu, Sau Lan; Wu, Xin; Wu, Yusheng; Wyatt, Terry Richard; Wynne, Benjamin; Xella, Stefania; Xi, Zhaoxu; Xia, Ligang; Xu, Da; Xu, Lailin; Yabsley, Bruce; Yacoob, Sahal; Yamaguchi, Daiki; Yamaguchi, Yohei; Yamamoto, Akira; Yamamoto, Shimpei; Yamanaka, Takashi; Yamatani, Masahiro; Yamauchi, Katsuya; Yamazaki, Yuji; Yan, Zhen; Yang, Haijun; Yang, Hongtao; Yang, Yi; Yang, Zongchang; Yao, Weiming; Yap, Yee Chinn; Yasu, Yoshiji; Yatsenko, Elena; Yau Wong, Kaven Henry; Ye, Jingbo; Ye, Shuwei; Yeletskikh, Ivan; Yigitbasi, Efe; Yildirim, Eda; Yorita, Kohei; Yoshihara, Keisuke; Young, Charles; Young, Christopher John; Yu, Jaehoon; Yu, Jie; Yuen, Stephanie P; Yusuff, Imran; Zabinski, Bartlomiej; Zacharis, Georgios; Zaidan, Remi; Zaitsev, Alexander; Zakharchuk, Nataliia; Zalieckas, Justas; Zaman, Aungshuman; Zambito, Stefano; Zanzi, Daniele; Zeitnitz, Christian; Zemaityte, Gabija; Zemla, Andrzej; Zeng, Jian Cong; Zeng, Qi; Zenin, Oleg; Ženiš, Tibor; Zerwas, Dirk; Zhang, Dongliang; Zhang, Fangzhou; Zhang, Guangyi; Zhang, Huijun; Zhang, Jinlong; Zhang, Lei; Zhang, Liqing; Zhang, Matt; Zhang, Peng; Zhang, Rui; Zhang, Ruiqi; Zhang, Xueyao; Zhang, Yu; Zhang, Zhiqing; Zhao, Xiandong; Zhao, Yongke; Zhao, Zhengguo; Zhemchugov, Alexey; Zhou, Bing; Zhou, Chen; Zhou, Li; Zhou, Maosen; Zhou, Mingliang; Zhou, Ning; Zhu, Cheng Guang; Zhu, Hongbo; Zhu, Junjie; Zhu, Yingchun; Zhuang, Xuai; Zhukov, Konstantin; Zibell, Andre; Zieminska, Daria; Zimine, Nikolai; Zimmermann, Christoph; Zimmermann, Stephanie; Zinonos, Zinonas; Zinser, Markus; Ziolkowski, Michael; Živković, Lidija; Zobernig, Georg; Zoccoli, Antonio; Zou, Rui; zur Nedden, Martin; Zwalinski, Lukasz

    2017-10-11

    Abstract: With the increase in energy of the Large Hadron Collider to a centre-of-mass energy of 13 TeV for Run 2, events with dense environments, such as in the cores of high-energy jets, became a focus for new physics searches as well as measurements of the Standard Model. These environments are characterized by charged-particle separations of the order of the tracking detectors sensor granularity. Basic track quantities are compared between 3.2 fb$^{-1}$ of data collected by the ATLAS experiment and simulation of proton-proton collisions producing high-transverse-momentum jets at a centre-of-mass energy of 13 TeV. The impact of charged-particle separations and multiplicities on the track reconstruction performance is discussed. The efficiency in the cores of jets with transverse momenta between 200 GeV and 1600 GeV is quantified using a novel, data-driven, method. The method uses the energy loss, dE/dx, to identify pixel clusters originating from two charged particles. Of the charged particles creating the...

  2. Algorithms

    Indian Academy of Sciences (India)

    In the description of algorithms and programming languages, what is the role of control abstraction? • What are the inherent limitations of the algorithmic processes? In future articles in this series, we will show that these constructs are powerful and can be used to encode any algorithm. In the next article, we will discuss ...

  3. Application Mail Tracking Using RSA Algorithm As Security Data and HOT-Fit a Model for Evaluation System

    Science.gov (United States)

    Permadi, Ginanjar Setyo; Adi, Kusworo; Gernowo, Rahmad

    2018-02-01

    RSA algorithm give security in the process of the sending of messages or data by using 2 key, namely private key and public key .In this research to ensure and assess directly systems are made have meet goals or desire using a comprehensive evaluation methods HOT-Fit system .The purpose of this research is to build a information system sending mail by applying methods of security RSA algorithm and to evaluate in uses the method HOT-Fit to produce a system corresponding in the faculty physics. Security RSA algorithm located at the difficulty of factoring number of large coiled factors prima, the results of the prime factors has to be done to obtain private key. HOT-Fit has three aspects assessment, in the aspect of technology judging from the system status, the quality of system and quality of service. In the aspect of human judging from the use of systems and satisfaction users while in the aspect of organization judging from the structure and environment. The results of give a tracking system sending message based on the evaluation acquired.

  4. A Probability-Based Algorithm Using Image Sensors to Track the LED in a Vehicle Visible Light Communication System.

    Science.gov (United States)

    Huynh, Phat; Do, Trong-Hop; Yoo, Myungsik

    2017-02-10

    This paper proposes a probability-based algorithm to track the LED in vehicle visible light communication systems using a camera. In this system, the transmitters are the vehicles' front and rear LED lights. The receivers are high speed cameras that take a series of images of the LEDs. ThedataembeddedinthelightisextractedbyfirstdetectingthepositionoftheLEDsintheseimages. Traditionally, LEDs are detected according to pixel intensity. However, when the vehicle is moving, motion blur occurs in the LED images, making it difficult to detect the LEDs. Particularly at high speeds, some frames are blurred at a high degree, which makes it impossible to detect the LED as well as extract the information embedded in these frames. The proposed algorithm relies not only on the pixel intensity, but also on the optical flow of the LEDs and on statistical information obtained from previous frames. Based on this information, the conditional probability that a pixel belongs to a LED is calculated. Then, the position of LED is determined based on this probability. To verify the suitability of the proposed algorithm, simulations are conducted by considering the incidents that can happen in a real-world situation, including a change in the position of the LEDs at each frame, as well as motion blur due to the vehicle speed.

  5. A novel Gravity-FREAK feature extraction and Gravity-KLT tracking registration algorithm based on iPhone MEMS mobile sensor in mobile environment.

    Directory of Open Access Journals (Sweden)

    Zhiling Hong

    Full Text Available Based on the traditional Fast Retina Keypoint (FREAK feature description algorithm, this paper proposed a Gravity-FREAK feature description algorithm based on Micro-electromechanical Systems (MEMS sensor to overcome the limited computing performance and memory resources of mobile devices and further improve the reality interaction experience of clients through digital information added to the real world by augmented reality technology. The algorithm takes the gravity projection vector corresponding to the feature point as its feature orientation, which saved the time of calculating the neighborhood gray gradient of each feature point, reduced the cost of calculation and improved the accuracy of feature extraction. In the case of registration method of matching and tracking natural features, the adaptive and generic corner detection based on the Gravity-FREAK matching purification algorithm was used to eliminate abnormal matches, and Gravity Kaneda-Lucas Tracking (KLT algorithm based on MEMS sensor can be used for the tracking registration of the targets and robustness improvement of tracking registration algorithm under mobile environment.

  6. A novel Gravity-FREAK feature extraction and Gravity-KLT tracking registration algorithm based on iPhone MEMS mobile sensor in mobile environment.

    Science.gov (United States)

    Hong, Zhiling; Lin, Fan; Xiao, Bin

    2017-01-01

    Based on the traditional Fast Retina Keypoint (FREAK) feature description algorithm, this paper proposed a Gravity-FREAK feature description algorithm based on Micro-electromechanical Systems (MEMS) sensor to overcome the limited computing performance and memory resources of mobile devices and further improve the reality interaction experience of clients through digital information added to the real world by augmented reality technology. The algorithm takes the gravity projection vector corresponding to the feature point as its feature orientation, which saved the time of calculating the neighborhood gray gradient of each feature point, reduced the cost of calculation and improved the accuracy of feature extraction. In the case of registration method of matching and tracking natural features, the adaptive and generic corner detection based on the Gravity-FREAK matching purification algorithm was used to eliminate abnormal matches, and Gravity Kaneda-Lucas Tracking (KLT) algorithm based on MEMS sensor can be used for the tracking registration of the targets and robustness improvement of tracking registration algorithm under mobile environment.

  7. Blood vessel modeling for interactive simulation of interventional neuroradiology procedures.

    Science.gov (United States)

    Kerrien, E; Yureidini, A; Dequidt, J; Duriez, C; Anxionnat, R; Cotin, S

    2017-01-01

    Endovascular interventions can benefit from interactive simulation in their training phase but also during pre-operative and intra-operative phases if simulation scenarios are based on patient data. A key feature in this context is the ability to extract, from patient images, models of blood vessels that impede neither the realism nor the performance of simulation. This paper addresses both the segmentation and reconstruction of the vasculature from 3D Rotational Angiography data, and adapted to simulation: An original tracking algorithm is proposed to segment the vessel tree while filtering points extracted at the vessel surface in the vicinity of each point on the centerline; then an automatic procedure is described to reconstruct each local unstructured point set as a skeleton-based implicit surface (blobby model). The output of successively applying both algorithms is a new model of vasculature as a tree of local implicit models. The segmentation algorithm is compared with Multiple Hypothesis Testing (MHT) algorithm (Friman et al., 2010) on patient data, showing its greater ability to track blood vessels. The reconstruction algorithm is evaluated on both synthetic and patient data and demonstrate its ability to fit points with a subvoxel precision. Various tests are also reported where our model is used to simulate catheter navigation in interventional neuroradiology. An excellent realism, and much lower computational costs are reported when compared to triangular mesh surface models. Copyright © 2016 Elsevier B.V. All rights reserved.

  8. Wireless Sensor Networks for Heritage Object Deformation Detection and Tracking Algorithm

    Directory of Open Access Journals (Sweden)

    Zhijun Xie

    2014-10-01

    Full Text Available Deformation is the direct cause of heritage object collapse. It is significant to monitor and signal the early warnings of the deformation of heritage objects. However, traditional heritage object monitoring methods only roughly monitor a simple-shaped heritage object as a whole, but cannot monitor complicated heritage objects, which may have a large number of surfaces inside and outside. Wireless sensor networks, comprising many small-sized, low-cost, low-power intelligent sensor nodes, are more useful to detect the deformation of every small part of the heritage objects. Wireless sensor networks need an effective mechanism to reduce both the communication costs and energy consumption in order to monitor the heritage objects in real time. In this paper, we provide an effective heritage object deformation detection and tracking method using wireless sensor networks (EffeHDDT. In EffeHDDT, we discover a connected core set of sensor nodes to reduce the communication cost for transmitting and collecting the data of the sensor networks. Particularly, we propose a heritage object boundary detecting and tracking mechanism. Both theoretical analysis and experimental results demonstrate that our EffeHDDT method outperforms the existing methods in terms of network traffic and the precision of the deformation detection.

  9. Detection of convective initiation using Meteosat SEVIRI: implementation in and verification with the tracking and nowcasting algorithm Cb-TRAM

    Science.gov (United States)

    Merk, D.; Zinner, T.

    2013-08-01

    In this paper a new detection scheme for convective initiation (CI) under day and night conditions is presented. The new algorithm combines the strengths of two existing methods for detecting CI with geostationary satellite data. It uses the channels of the Spinning Enhanced Visible and Infrared Imager (SEVIRI) onboard Meteosat Second Generation (MSG). For the new algorithm five infrared (IR) criteria from the Satellite Convection Analysis and Tracking algorithm (SATCAST) and one high-resolution visible channel (HRV) criteria from Cb-TRAM were adapted. This set of criteria aims to identify the typical development of quickly developing convective cells in an early stage. The different criteria include time trends of the 10.8 IR channel, and IR channel differences, as well as their time trends. To provide the trend fields an optical-flow-based method is used: the pyramidal matching algorithm, which is part of Cb-TRAM. The new detection scheme is implemented in Cb-TRAM, and is verified for seven days which comprise different weather situations in central Europe. Contrasted with the original early-stage detection scheme of Cb-TRAM, skill scores are provided. From the comparison against detections of later thunderstorm stages, which are also provided by Cb-TRAM, a decrease in false prior warnings (false alarm ratio) from 91 to 81% is presented, an increase of the critical success index from 7.4 to 12.7%, and a decrease of the BIAS from 320 to 146% for normal scan mode. Similar trends are found for rapid scan mode. Most obvious is the decline of false alarms found for the synoptic class "cold air" masses.

  10. Real-time image-processing algorithm for markerless tumour tracking using X-ray fluoroscopic imaging.

    Science.gov (United States)

    Mori, S

    2014-05-01

    To ensure accuracy in respiratory-gating treatment, X-ray fluoroscopic imaging is used to detect tumour position in real time. Detection accuracy is strongly dependent on image quality, particularly positional differences between the patient and treatment couch. We developed a new algorithm to improve the quality of images obtained in X-ray fluoroscopic imaging and report the preliminary results. Two oblique X-ray fluoroscopic images were acquired using a dynamic flat panel detector (DFPD) for two patients with lung cancer. The weighting factor was applied to the DFPD image in respective columns, because most anatomical structures, as well as the treatment couch and port cover edge, were aligned in the superior-inferior direction when the patient lay on the treatment couch. The weighting factors for the respective columns were varied until the standard deviation of the pixel values within the image region was minimized. Once the weighting factors were calculated, the quality of the DFPD image was improved by applying the factors to multiframe images. Applying the image-processing algorithm produced substantial improvement in the quality of images, and the image contrast was increased. The treatment couch and irradiation port edge, which were not related to a patient's position, were removed. The average image-processing time was 1.1 ms, showing that this fast image processing can be applied to real-time tumour-tracking systems. These findings indicate that this image-processing algorithm improves the image quality in patients with lung cancer and successfully removes objects not related to the patient. Our image-processing algorithm might be useful in improving gated-treatment accuracy.

  11. Arterial tree tracking from anatomical landmarks in magnetic resonance angiography scans

    Science.gov (United States)

    O'Neil, Alison; Beveridge, Erin; Houston, Graeme; McCormick, Lynne; Poole, Ian

    2014-03-01

    This paper reports on arterial tree tracking in fourteen Contrast Enhanced MRA volumetric scans, given the positions of a predefined set of vascular landmarks, by using the A* algorithm to find the optimal path for each vessel based on voxel intensity and a learnt vascular probability atlas. The algorithm is intended for use in conjunction with an automatic landmark detection step, to enable fully automatic arterial tree tracking. The scan is filtered to give two further images using the top-hat transform with 4mm and 8mm cubic structuring elements. Vessels are then tracked independently on the scan in which the vessel of interest is best enhanced, as determined from knowledge of typical vessel diameter and surrounding structures. A vascular probability atlas modelling expected vessel location and orientation is constructed by non-rigidly registering the training scans to the test scan using a 3D thin plate spline to match landmark correspondences, and employing kernel density estimation with the ground truth center line points to form a probability density distribution. Threshold estimation by histogram analysis is used to segment background from vessel intensities. The A* algorithm is run using a linear cost function constructed from the threshold and the vascular atlas prior. Tracking results are presented for all major arteries excluding those in the upper limbs. An improvement was observed when tracking was informed by contextual information, with particular benefit for peripheral vessels.

  12. SU-G-JeP1-07: Development of a Programmable Motion Testbed for the Validation of Ultrasound Tracking Algorithms

    Energy Technology Data Exchange (ETDEWEB)

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

    2016-06-15

    Purpose: To develop an advanced testbed that combines a 3D motion stage and ultrasound phantom to optimize and validate 2D and 3D tracking algorithms for real-time motion management during radiation therapy. Methods: A Siemens S2000 Ultrasound scanner utilizing a 9L4 transducer was coupled with the Washington University 4D Phantom to simulate patient motion. The transducer was securely fastened to the 3D stage and positioned to image three cylinders of varying contrast in a Gammex 404GS LE phantom. The transducer was placed within a water bath above the phantom in order to maintain sufficient coupling for the entire range of simulated motion. A programmed motion sequence was used to move the transducer during image acquisition and a cine video was acquired for one minute to allow for long sequence tracking. Images were analyzed using a normalized cross-correlation block matching tracking algorithm and compared to the known motion of the transducer relative to the phantom. Results: The setup produced stable ultrasound motion traces consistent with those programmed into the 3D motion stage. The acquired ultrasound images showed minimal artifacts and an image quality that was more than suitable for tracking algorithm verification. Comparisons of a block matching tracking algorithm with the known motion trace for the three features resulted in an average tracking error of 0.59 mm. Conclusion: The high accuracy and programmability of the 4D phantom allows for the acquisition of ultrasound motion sequences that are highly customizable; allowing for focused analysis of some common pitfalls of tracking algorithms such as partial feature occlusion or feature disappearance, among others. The design can easily be modified to adapt to any probe such that the process can be extended to 3D acquisition. Further development of an anatomy specific phantom better resembling true anatomical landmarks could lead to an even more robust validation. This work is partially funded by NIH

  13. Dynamical control of the dialysis process. Part II: An improved algorithm for the solution of a tracking problem.

    Science.gov (United States)

    Bachhiesl, P; Scharfetter, H; Kappel, F; Hutten, H

    1996-09-01

    An efficient algorithm for the optimization of process parameters during dialysis has been developed. By solving a tracking-problem for prescribed time courses of distinguished variables, it is possible to compute optimal concentrations of electrolytes in dialysate as well as an optimal rate of ultrafiltration. These variables are indirectly influencing the status of the patient and can be directly modelled. They are describing the important exchange processes between blood and dialysate as well as between the different distribution spaces within the patient during dialysis. Their time courses are determined by an individually identifiable patient model. The tracking problem was treated as a dynamic optimization problem, and a continuous descent procedure which is usually employed for solving unconstrained static optimization problems has been adapted in such a manner that it is applicable for the solution of this problem. The used method is characterized by its simple mode of application, short solution time and moderate storage need. Especially in cases of contradictional requirements for desired time courses of model outputs the used optimization method performs well.

  14. Algorithms

    Indian Academy of Sciences (India)

    , i is referred to as the loop-index, 'stat-body' is any sequence of ... while i ~ N do stat-body; i: = i+ 1; endwhile. The algorithm for sorting the numbers is described in Table 1 and the algorithmic steps on a list of 4 numbers shown in. Figure 1.

  15. Combining multiple algorithms for road network tracking from multiple source remotely sensed imagery: a practical system and performance evaluation.

    Science.gov (United States)

    Lin, Xiangguo; Liu, Zhengjun; Zhang, Jixian; Shen, Jing

    2009-01-01

    In light of the increasing availability of commercial high-resolution imaging sensors, automatic interpretation tools are needed to extract road features. Currently, many approaches for road extraction are available, but it is acknowledged that there is no single method that would be successful in extracting all types of roads from any remotely sensed imagery. In this paper, a novel classification of roads is proposed, based on both the roads' geometrical, radiometric properties and the characteristics of the sensors. Subsequently, a general road tracking framework is proposed, and one or more suitable road trackers are designed or combined for each type of roads. Extensive experiments are performed to extract roads from aerial/satellite imagery, and the results show that a combination strategy can automatically extract more than 60% of the total roads from very high resolution imagery such as QuickBird and DMC images, with a time-saving of approximately 20%, and acceptable spatial accuracy. It is proven that a combination of multiple algorithms is more reliable, more efficient and more robust for extracting road networks from multiple-source remotely sensed imagery than the individual algorithms.

  16. Moving scanning emitter tracking by a single observer using time of interception: Observability analysis and algorithm

    Directory of Open Access Journals (Sweden)

    Yifei ZHANG

    2017-06-01

    Full Text Available The target motion analysis (TMA for a moving scanning emitter with known fixed scan rate by a single observer using the time of interception (TOI measurements only is investigated in this paper. By transforming the TOI of multiple scan cycles into the direction difference of arrival (DDOA model, the observability analysis for the TMA problem is performed. Some necessary conditions for uniquely identifying the scanning emitter trajectory are obtained. This paper also proposes a weighted instrumental variable (WIV estimator for the scanning emitter TMA, which does not require any initial solution guess and is closed-form and computationally attractive. More importantly, simulations show that the proposed algorithm can provide estimation mean square error close to the Cramer-Rao lower bound (CRLB at moderate noise levels with significantly lower estimation bias than the conventional pseudo-linear least square (PLS estimator.

  17. A Novel Robust Interacting Multiple Model Algorithm for Maneuvering Target Tracking

    Directory of Open Access Journals (Sweden)

    GHAZAL, M.

    2017-08-01

    Full Text Available In this paper, the state estimation problem for discrete-time jump Markov systems is considered. A minimax filtering technique, interacting multiple model algorithm based on game theory, is developed for discrete-time stochastic systems. Filter performance improvement in presence of model uncertainties, measurement noise, and unknown steering command of the maneuvering target is illustrated. It is shown that the technique presented in this paper has a better performance in comparison with the traditional Kalman filter with minimum estimation error criterion for the case of worst possible steering command of target. In particular, simulation results illustrate the improved performance of the proposed filter compared to Interacting Multiple Model (IMM, diagonal-matrix-weight IMM (DIMM, and IMM based on (IMMH filters.

  18. TRACKING AND MONITORING OF TAGGED OBJECTS EMPLOYING PARTICLE SWARM OPTIMIZATION ALGORITHM IN A DEPARTMENTAL STORE

    Directory of Open Access Journals (Sweden)

    Indrajit Bhattacharya

    2011-05-01

    Full Text Available The present paper proposes a departmental store automation system based on Radio Frequency Identification (RFID technology and Particle Swarm Optimization (PSO algorithm. The items in the departmental store spanned over different sections and in multiple floors, are tagged with passive RFID tags. The floor is divided into number of zones depending on different types of items that are placed in their respective racks. Each of the zones is placed with one RFID reader, which constantly monitors the items in their zone and periodically sends that information to the application. The problem of systematic periodic monitoring of the store is addressed in this application so that the locations, distributions and demands of every item in the store can be invigilated with intelligence. The proposed application is successfully demonstrated on a simulated case study.

  19. Fracture Analysis of Vessels. Oak Ridge FAVOR, v06.1, Computer Code: Theory and Implementation of Algorithms, Methods, and Correlations

    Energy Technology Data Exchange (ETDEWEB)

    Williams, P. T. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Dickson, T. L. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Yin, S. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

    2007-12-01

    The current regulations to insure that nuclear reactor pressure vessels (RPVs) maintain their structural integrity when subjected to transients such as pressurized thermal shock (PTS) events were derived from computational models developed in the early-to-mid 1980s. Since that time, advancements and refinements in relevant technologies that impact RPV integrity assessment have led to an effort by the NRC to re-evaluate its PTS regulations. Updated computational methodologies have been developed through interactions between experts in the relevant disciplines of thermal hydraulics, probabilistic risk assessment, materials embrittlement, fracture mechanics, and inspection (flaw characterization). Contributors to the development of these methodologies include the NRC staff, their contractors, and representatives from the nuclear industry. These updated methodologies have been integrated into the Fracture Analysis of Vessels -- Oak Ridge (FAVOR, v06.1) computer code developed for the NRC by the Heavy Section Steel Technology (HSST) program at Oak Ridge National Laboratory (ORNL). The FAVOR, v04.1, code represents the baseline NRC-selected applications tool for re-assessing the current PTS regulations. This report is intended to document the technical bases for the assumptions, algorithms, methods, and correlations employed in the development of the FAVOR, v06.1, code.

  20. Optical derotator alignment using image-processing algorithm for tracking laser vibrometer measurements of rotating objects

    Science.gov (United States)

    Khalil, Hossam; Kim, Dongkyu; Jo, Youngjoon; Park, Kyihwan

    2017-06-01

    An optical component called a Dove prism is used to rotate the laser beam of a laser-scanning vibrometer (LSV). This is called a derotator and is used for measuring the vibration of rotating objects. The main advantage of a derotator is that it works independently from an LSV. However, this device requires very specific alignment, in which the axis of the Dove prism must coincide with the rotational axis of the object. If the derotator is misaligned with the rotating object, the results of the vibration measurement are imprecise, owing to the alteration of the laser beam on the surface of the rotating object. In this study, a method is proposed for aligning a derotator with a rotating object through an image-processing algorithm that obtains the trajectory of a landmark attached to the object. After the trajectory of the landmark is mathematically modeled, the amount of derotator misalignment with respect to the object is calculated. The accuracy of the proposed method for aligning the derotator with the rotating object is experimentally tested.

  1. Vessel Operating Units (Vessels)

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains data for vessels that are greater than five net tons and have a current US Coast Guard documentation number. Beginning in1979, the NMFS...

  2. Effect of a novel motion correction algorithm (SSF) on the image quality of coronary CTA with intermediate heart rates: Segment-based and vessel-based analyses

    Energy Technology Data Exchange (ETDEWEB)

    Li, Qianwen, E-mail: qianwen18@126.com; Li, Pengyu, E-mail: lipyu818@gmail.com; Su, Zhuangzhi, E-mail: suzhuangzhi@xwh.ccmu.edu.cn; Yao, Xinyu, E-mail: 314985151@qq.com; Wang, Yan, E-mail: wy19851121@126.com; Wang, Chen, E-mail: fskwangchen@gmail.com; Du, Xiangying, E-mail: duxying_xw@163.com; Li, Kuncheng, E-mail: kuncheng.li@gmail.com

    2014-11-15

    Highlights: • SSF provided better image quality than single-sector and bi-sector reconstruction among the intermediate heart rates (65–75 bpm). • Evidence for the application of prospective ECG-triggered coronary CTA with SSF onto an expanded heart rate range. • Information about the inconsistent effectiveness of SSF among the segments of coronary artery. - Abstract: Purpose: To evaluate the effect of SnapShot Freeze (SSF) reconstruction at an intermediate heart-rate (HR) range (65–75 bpm) and compare this method with single-sector reconstruction and bi-sector reconstruction on segmental and vessel bases in retrospective coronary computed tomography angiography (CCTA). Materials and methods: Retrospective electrocardiogram-gated CCTA was performed on 37 consecutive patients with HR between 65 and 75 bpm using a 64-row CT scanner. Retrospective single-sector reconstruction, bi-sector reconstruction, and SSF were performed for each patient. Multi-phase single-sector reconstruction was performed to select the optimal phase. SSF and bi-sector images were also reconstructed at the optimal phase. The images were interpreted in an intent-to-diagnose fashion by two experienced readers using a 5-point scale, with 3 points as diagnostically acceptable. Image quality among the three reconstruction groups were compared on per-patient, per-vessel, and per-segment bases. Results: The average HR of the enrolled patients was 69.4 ± 2.7 bpm. A total of 111 vessels and 481 coronary segments were assessed. SSF provided significantly higher interpretability of the coronary segments than bi-sector reconstructions. The qualified and excellent rates of SSF (97.9% and 82.3%) were significantly higher than those of single-sector (92.9% and 66.3%) and bi-sector (90.9% and 64.7%) reconstructions. The image quality score (IQS) using SSF was also significantly higher than those of single-sector and bi-sector reconstructions both on per-patient and per-vessel bases. On per

  3. Tracking inside the ALICE Inner Tracking System

    CERN Document Server

    Badalà, A; Lo Re, G; Palmeri, A; Pappalardo, G S; Pulvirenti, A; Riggi, F

    2002-01-01

    One of the main purposes of the ALICE Inner Tracking System (ITS) is to improve the resolution of the track parameters found in the main ALICE tracker detector, the Time Projector Chamber (TPC). Some results about tracking efficiency and resolution of track parameters obtained with a tracking code, based on the Kalman filter algorithm are presented.

  4. Ice crystal characterization in cirrus clouds: a sun-tracking camera system and automated detection algorithm for halo displays

    Directory of Open Access Journals (Sweden)

    L. Forster

    2017-07-01

    Full Text Available Halo displays in the sky contain valuable information about ice crystal shape and orientation: e.g., the 22° halo is produced by randomly oriented hexagonal prisms while parhelia (sundogs indicate oriented plates. HaloCam, a novel sun-tracking camera system for the automated observation of halo displays is presented. An initial visual evaluation of the frequency of halo displays for the ACCEPT (Analysis of the Composition of Clouds with Extended Polarization Techniques field campaign from October to mid-November 2014 showed that sundogs were observed more often than 22° halos. Thus, the majority of halo displays was produced by oriented ice crystals. During the campaign about 27 % of the cirrus clouds produced 22° halos, sundogs or upper tangent arcs. To evaluate the HaloCam observations collected from regular measurements in Munich between January 2014 and June 2016, an automated detection algorithm for 22° halos was developed, which can be extended to other halo types as well. This algorithm detected 22° halos about 2 % of the time for this dataset. The frequency of cirrus clouds during this time period was estimated by co-located ceilometer measurements using temperature thresholds of the cloud base. About 25 % of the detected cirrus clouds occurred together with a 22° halo, which implies that these clouds contained a certain fraction of smooth, hexagonal ice crystals. HaloCam observations complemented by radiative transfer simulations and measurements of aerosol and cirrus cloud optical thickness (AOT and COT provide a possibility to retrieve more detailed information about ice crystal roughness. This paper demonstrates the feasibility of a completely automated method to collect and evaluate a long-term database of halo observations and shows the potential to characterize ice crystal properties.

  5. Algorithms

    Indian Academy of Sciences (India)

    Algorithms. 3. Procedures and Recursion. R K Shyamasundar. In this article we introduce procedural abstraction and illustrate its uses. Further, we illustrate the notion of recursion which is one of the most useful features of procedural abstraction. Procedures. Let us consider a variation of the pro blem of summing the first M.

  6. Algorithms

    Indian Academy of Sciences (India)

    number of elements. We shall illustrate the widely used matrix multiplication algorithm using the two dimensional arrays in the following. Consider two matrices A and B of integer type with di- mensions m x nand n x p respectively. Then, multiplication of. A by B denoted, A x B , is defined by matrix C of dimension m xp where.

  7. Land Surface Temperature and Emissivity Separation from Cross-Track Infrared Sounder Data with Atmospheric Reanalysis Data and ISSTES Algorithm

    Directory of Open Access Journals (Sweden)

    Yu-Ze Zhang

    2017-01-01

    Full Text Available The Cross-track Infrared Sounder (CrIS is one of the most advanced hyperspectral instruments and has been used for various atmospheric applications such as atmospheric retrievals and weather forecast modeling. However, because of the specific design purpose of CrIS, little attention has been paid to retrieving land surface parameters from CrIS data. To take full advantage of the rich spectral information in CrIS data to improve the land surface retrievals, particularly the acquisition of a continuous Land Surface Emissivity (LSE spectrum, this paper attempts to simultaneously retrieve a continuous LSE spectrum and the Land Surface Temperature (LST from CrIS data with the atmospheric reanalysis data and the Iterative Spectrally Smooth Temperature and Emissivity Separation (ISSTES algorithm. The results show that the accuracy of the retrieved LSEs and LST is comparable with the current land products. The overall differences of the LST and LSE retrievals are approximately 1.3 K and 1.48%, respectively. However, the LSEs in our study can be provided as a continuum spectrum instead of the single-channel values in traditional products. The retrieved LST and LSEs now can be better used to further analyze the surface properties or improve the retrieval of atmospheric parameters.

  8. Are greenhouse gas signals of Northern Hemisphere winter extra-tropical cyclone activity dependent on the identification and tracking algorithm?

    Energy Technology Data Exchange (ETDEWEB)

    Ulbrich, Uwe; Grieger, Jens [Freie Univ. Berlin (Germany). Inst. of Meteorology; Leckebusch, Gregor C. [Birmingham Univ. (United Kingdom). School of Geography, Earth and Environmental Sciences] [and others

    2013-02-15

    For Northern Hemisphere extra-tropical cyclone activity, the dependency of a potential anthropogenic climate change signal on the identification method applied is analysed. This study investigates the impact of the used algorithm on the changing signal, not the robustness of the climate change signal itself. Using one single transient AOGCM simulation as standard input for eleven state-of-the-art identification methods, the patterns of model simulated present day climatologies are found to be close to those computed from re-analysis, independent of the method applied. Although differences in the total number of cyclones identified exist, the climate change signals (IPCC SRES A1B) in the model run considered are largely similar between methods for all cyclones. Taking into account all tracks, decreasing numbers are found in the Mediterranean, the Arctic in the Barents and Greenland Seas, the mid-latitude Pacific and North America. Changing patterns are even more similar, if only the most severe systems are considered: the methods reveal a coherent statistically significant increase in frequency over the eastern North Atlantic and North Pacific. We found that the differences between the methods considered are largely due to the different role of weaker systems in the specific methods. (orig.)

  9. Non Invasive Estimation of Left VentrNon Invasive Estimation of Left Ventricular Normalized Torsion Angle in Healthy Persons by Echo Tracking Algorithm: Short Axis Viewicular Normalized Torsion Angle in Healthy Persons by Echo Tracking Algorithm: Short Axis View

    Directory of Open Access Journals (Sweden)

    Zahra Arab Baferani

    2011-12-01

    Full Text Available Background: Left ventricular (LV torsion angle is a key parameter of cardiac performance but is difficult to measure. The purpose of this study is to describe a noninvasive imaging method for the assessment of these complex cardiac motions. Objectives: In this study, left ventricular torsion angle and normalized torsion angle were estimated in the short axis view for healthy persons. Patients and Methods: We acquired basal and apical short axis left ventricular LV images in the short axis view for 14 healthy men to estimate LV torsion angle by echo tracking under a block-matching (BM algorithm. By extracting the instantaneous changes in total displacement vector in the short axis view throughout a cardiac cycle, we calculated the instantaneous rotation and torsion angles in the short axis view. To account for differences in heart size, normalized torsion was calculated based on the radius of both the apical and basal slices in the end diastolic frame. Results: Apical and basal rotation was measured from short axis images by automatic frame-to-frame tracking of grayscale echo patterns. The vertical and horizontal displacements of the apical level were more than those of the basal level. All data are expressed as mean ± standard deviation (SD. Data was tested for normal distribution and homogeneity of variance by the Kolmogorov-Smirnov test (K-S and Levene’s test respectively. The peak rotation angles of the basal and apical levels and LV torsion angle in the short axis view were 8.0 ± 1.6°, 9.5 ± 1.8°, and 17.3 ± 2.5°, respectively. The normalized torsion was calculated as 7.8 ± 1.3°, based on the basal maximum radius, the apical maximum radius, and the distance between the apical and basal levels. Conclusions: We conclude that the normalized torsion angle is an important biomechanical parameter, because it is independent of heart size and distorted geometries in pathological ventricles.

  10. Simulation and analysis of an isolated full-bridge DC/DC boost converter operating with a modified perturb and observe maximum power point tracking algorithm

    Directory of Open Access Journals (Sweden)

    Calebe A. Matias

    2017-07-01

    Full Text Available The purpose of the present study is to simulate and analyze an isolated full-bridge DC/DC boost converter, for photovoltaic panels, running a modified perturb and observe maximum power point tracking method. The zero voltage switching technique was used in order to minimize the losses of the converter for a wide range of solar operation. The efficiency of the power transfer is higher than 90% for large solar operating points. The panel enhancement due to the maximum power point tracking algorithm is 5.06%.

  11. SU-E-J-142: Performance Study of Automatic Image-Segmentation Algorithms in Motion Tracking Via MR-IGRT

    Energy Technology Data Exchange (ETDEWEB)

    Feng, Y; Olsen, J.; Parikh, P.; Noel, C; Wooten, H; Du, D; Mutic, S; Hu, Y [Washington University, St. Louis, MO (United States); Kawrakow, I; Dempsey, J [Washington University, St. Louis, MO (United States); ViewRay Co., Oakwood Village, OH (United States)

    2014-06-01

    Purpose: Evaluate commonly used segmentation algorithms on a commercially available real-time MR image guided radiotherapy (MR-IGRT) system (ViewRay), compare the strengths and weaknesses of each method, with the purpose of improving motion tracking for more accurate radiotherapy. Methods: MR motion images of bladder, kidney, duodenum, and liver tumor were acquired for three patients using a commercial on-board MR imaging system and an imaging protocol used during MR-IGRT. A series of 40 frames were selected for each case to cover at least 3 respiratory cycles. Thresholding, Canny edge detection, fuzzy k-means (FKM), k-harmonic means (KHM), and reaction-diffusion level set evolution (RD-LSE), along with the ViewRay treatment planning and delivery system (TPDS) were included in the comparisons. To evaluate the segmentation results, an expert manual contouring of the organs or tumor from a physician was used as a ground-truth. Metrics value of sensitivity, specificity, Jaccard similarity, and Dice coefficient were computed for comparison. Results: In the segmentation of single image frame, all methods successfully segmented the bladder and kidney, but only FKM, KHM and TPDS were able to segment the liver tumor and the duodenum. For segmenting motion image series, the TPDS method had the highest sensitivity, Jarccard, and Dice coefficients in segmenting bladder and kidney, while FKM and KHM had a slightly higher specificity. A similar pattern was observed when segmenting the liver tumor and the duodenum. The Canny method is not suitable for consistently segmenting motion frames in an automated process, while thresholding and RD-LSE cannot consistently segment a liver tumor and the duodenum. Conclusion: The study compared six different segmentation methods and showed the effectiveness of the ViewRay TPDS algorithm in segmenting motion images during MR-IGRT. Future studies include a selection of conformal segmentation methods based on image/organ-specific information

  12. A novel application of PageRank and user preference algorithms for assessing the relative performance of track athletes in competition.

    Science.gov (United States)

    Beggs, Clive B; Shepherd, Simon J; Emmonds, Stacey; Jones, Ben

    2017-01-01

    Ranking enables coaches, sporting authorities, and pundits to determine the relative performance of individual athletes and teams in comparison to their peers. While ranking is relatively straightforward in sports that employ traditional leagues, it is more difficult in sports where competition is fragmented (e.g. athletics, boxing, etc.), with not all competitors competing against each other. In such situations, complex points systems are often employed to rank athletes. However, these systems have the inherent weakness that they frequently rely on subjective assessments in order to gauge the calibre of the competitors involved. Here we show how two Internet derived algorithms, the PageRank (PR) and user preference (UP) algorithms, when utilised with a simple 'who beat who' matrix, can be used to accurately rank track athletes, avoiding the need for subjective assessment. We applied the PR and UP algorithms to the 2015 IAAF Diamond League men's 100m competition and compared their performance with the Keener, Colley and Massey ranking algorithms. The top five places computed by the PR and UP algorithms, and the Diamond League '2016' points system were all identical, with the Kendall's tau distance between the PR standings and '2016' points system standings being just 15, indicating that only 5.9% of pairs differed in their order between these two lists. By comparison, the UP and '2016' standings displayed a less strong relationship, with a tau distance of 95, indicating that 37.6% of the pairs differed in their order. When compared with the standings produced using the Keener, Colley and Massey algorithms, the PR standings appeared to be closest to the Keener standings (tau distance = 67, 26.5% pair order disagreement), whereas the UP standings were more similar to the Colley and Massey standings, with the tau distances between these ranking lists being only 48 (19.0% pair order disagreement) and 59 (23.3% pair order disagreement) respectively. In particular, the

  13. A novel application of PageRank and user preference algorithms for assessing the relative performance of track athletes in competition.

    Directory of Open Access Journals (Sweden)

    Clive B Beggs

    Full Text Available Ranking enables coaches, sporting authorities, and pundits to determine the relative performance of individual athletes and teams in comparison to their peers. While ranking is relatively straightforward in sports that employ traditional leagues, it is more difficult in sports where competition is fragmented (e.g. athletics, boxing, etc., with not all competitors competing against each other. In such situations, complex points systems are often employed to rank athletes. However, these systems have the inherent weakness that they frequently rely on subjective assessments in order to gauge the calibre of the competitors involved. Here we show how two Internet derived algorithms, the PageRank (PR and user preference (UP algorithms, when utilised with a simple 'who beat who' matrix, can be used to accurately rank track athletes, avoiding the need for subjective assessment. We applied the PR and UP algorithms to the 2015 IAAF Diamond League men's 100m competition and compared their performance with the Keener, Colley and Massey ranking algorithms. The top five places computed by the PR and UP algorithms, and the Diamond League '2016' points system were all identical, with the Kendall's tau distance between the PR standings and '2016' points system standings being just 15, indicating that only 5.9% of pairs differed in their order between these two lists. By comparison, the UP and '2016' standings displayed a less strong relationship, with a tau distance of 95, indicating that 37.6% of the pairs differed in their order. When compared with the standings produced using the Keener, Colley and Massey algorithms, the PR standings appeared to be closest to the Keener standings (tau distance = 67, 26.5% pair order disagreement, whereas the UP standings were more similar to the Colley and Massey standings, with the tau distances between these ranking lists being only 48 (19.0% pair order disagreement and 59 (23.3% pair order disagreement respectively. In

  14. Application of RFID in the area of agricultural products quality traceability and tracking and the anti-collision algorithm

    Science.gov (United States)

    Wang, Zu-liang; Zhang, Ting; Xie, Shi-yang

    2017-01-01

    In order to improve the agricultural tracing efficiency and reduce tracking and monitoring cost, agricultural products quality tracking and tracing based on Radio-Frequency Identification(RFID) technology is studied, then tracing and tracking model is set up. Three-layer structure model is established to realize the high quality of agricultural products traceability and tracking. To solve the collision problems between multiple RFID tags and improve the identification efficiency a new reservation slot allocation mechanism is proposed. And then we analyze and optimize the parameter by numerical simulation method.

  15. Open-source sea ice drift algorithm for Sentinel-1 SAR imagery using a combination of feature-tracking and pattern-matching

    Science.gov (United States)

    Muckenhuber, Stefan; Sandven, Stein

    2017-04-01

    An open-source sea ice drift algorithm for Sentinel-1 SAR imagery is introduced based on the combination of feature-tracking and pattern-matching. A computational efficient feature-tracking algorithm produces an initial drift estimate and limits the search area for the pattern-matching, that provides small to medium scale drift adjustments and normalised cross correlation values as quality measure. The algorithm is designed to utilise the respective advantages of the two approaches and allows drift calculation at user defined locations. The pre-processing of the Sentinel-1 data has been optimised to retrieve a feature distribution that depends less on SAR backscatter peak values. A recommended parameter set for the algorithm has been found using a representative image pair over Fram Strait and 350 manually derived drift vectors as validation. Applying the algorithm with this parameter setting, sea ice drift retrieval with a vector spacing of 8 km on Sentinel-1 images covering 400 km x 400 km, takes less than 3.5 minutes on a standard 2.7 GHz processor with 8 GB memory. For validation, buoy GPS data, collected in 2015 between 15th January and 22nd April and covering an area from 81° N to 83.5° N and 12° E to 27° E, have been compared to calculated drift results from 261 corresponding Sentinel-1 image pairs. We found a logarithmic distribution of the error with a peak at 300 m. All software requirements necessary for applying the presented sea ice drift algorithm are open-source to ensure free implementation and easy distribution.

  16. Development and Application of an Objective Tracking Algorithm for Tropical Cyclones over the North-West Pacific purely based on Wind Speeds

    Science.gov (United States)

    Befort, Daniel J.; Kruschke, Tim; Leckebusch, Gregor C.

    2017-04-01

    Tropical Cyclones over East Asia have huge socio-economic impacts due to their strong wind fields and large rainfall amounts. Especially, the most severe events are associated with huge economic losses, e.g. Typhoon Herb in 1996 is related to overall losses exceeding 5 billion US (Munich Re, 2016). In this study, an objective tracking algorithm is applied to JRA55 reanalysis data from 1979 to 2014 over the Western North Pacific. For this purpose, a purely wind based algorithm, formerly used to identify extra-tropical wind storms, has been further developed. The algorithm is based on the exceedance of the local 98th percentile to define strong wind fields in gridded climate data. To be detected as a tropical cyclone candidate, the following criteria must be fulfilled: 1) the wind storm must exist for at least eight 6-hourly time steps and 2) the wind field must exceed a minimum size of 130.000km2 for each time step. The usage of wind information is motivated to focus on damage related events, however, a pre-selection based on the affected region is necessary to remove events of extra-tropical nature. Using IBTrACS Best Tracks for validation, it is found that about 62% of all detected tropical cyclone events in JRA55 reanalysis can be matched to an observed best track. As expected the relative amount of matched tracks increases with the wind intensity of the event, with a hit rate of about 98% for Violent Typhoons, above 90% for Very Strong Typhoons and about 75% for Typhoons. Overall these results are encouraging as the parameters used to detect tropical cyclones in JRA55, e.g. minimum area, are also suitable to detect TCs in most CMIP5 simulations and will thus allow estimates of potential future changes.

  17. Adaptive re-tracking algorithm for retrieval of water level variations and wave heights from satellite altimetry data for middle-sized inland water bodies

    Science.gov (United States)

    Troitskaya, Yuliya; Lebedev, Sergey; Soustova, Irina; Rybushkina, Galina; Papko, Vladislav; Baidakov, Georgy; Panyutin, Andrey

    One of the recent applications of satellite altimetry originally designed for measurements of the sea level [1] is associated with remote investigation of the water level of inland waters: lakes, rivers, reservoirs [2-7]. The altimetry data re-tracking algorithms developed for open ocean conditions (e.g. Ocean-1,2) [1] often cannot be used in these cases, since the radar return is significantly contaminated by reflection from the land. The problem of minimization of errors in the water level retrieval for inland waters from altimetry measurements can be resolved by re-tracking satellite altimetry data. Recently, special re-tracking algorithms have been actively developed for re-processing altimetry data in the coastal zone when reflection from land strongly affects echo shapes: threshold re-tracking, The other methods of re-tracking (threshold re-tracking, beta-re-tracking, improved threshold re-tracking) were developed in [9-11]. The latest development in this field is PISTACH product [12], in which retracking bases on the classification of typical forms of telemetric waveforms in the coastal zones and inland water bodies. In this paper a novel method of regional adaptive re-tracking based on constructing a theoretical model describing the formation of telemetric waveforms by reflection from the piecewise constant model surface corresponding to the geography of the region is considered. It was proposed in [13, 14], where the algorithm for assessing water level in inland water bodies and in the coastal zone of the ocean with an error of about 10-15 cm was constructed. The algorithm includes four consecutive steps: - constructing a local piecewise model of a reflecting surface in the neighbourhood of the reservoir; - solving a direct problem by calculating the reflected waveforms within the framework of the model; - imposing restrictions and validity criteria for the algorithm based on waveform modelling; - solving the inverse problem by retrieving a tracking point

  18. Open-source sea ice drift algorithm for Sentinel-1 SAR imagery using a combination of feature tracking and pattern matching

    Science.gov (United States)

    Muckenhuber, Stefan; Sandven, Stein

    2017-08-01

    An open-source sea ice drift algorithm for Sentinel-1 SAR imagery is introduced based on the combination of feature tracking and pattern matching. Feature tracking produces an initial drift estimate and limits the search area for the consecutive pattern matching, which provides small- to medium-scale drift adjustments and normalised cross-correlation values. The algorithm is designed to combine the two approaches in order to benefit from the respective advantages. The considered feature-tracking method allows for an efficient computation of the drift field and the resulting vectors show a high degree of independence in terms of position, length, direction and rotation. The considered pattern-matching method, on the other hand, allows better control over vector positioning and resolution. The preprocessing of the Sentinel-1 data has been adjusted to retrieve a feature distribution that depends less on SAR backscatter peak values. Applying the algorithm with the recommended parameter setting, sea ice drift retrieval with a vector spacing of 4 km on Sentinel-1 images covering 400 km × 400 km, takes about 4 min on a standard 2.7 GHz processor with 8 GB memory. The corresponding recommended patch size for the pattern-matching step that defines the final resolution of each drift vector is 34 × 34 pixels (2.7 × 2.7 km). To assess the potential performance after finding suitable search restrictions, calculated drift results from 246 Sentinel-1 image pairs have been compared to buoy GPS data, collected in 2015 between 15 January and 22 April and covering an area from 80.5 to 83.5° N and 12 to 27° E. We found a logarithmic normal distribution of the displacement difference with a median at 352.9 m using HV polarisation and 535.7 m using HH polarisation. All software requirements necessary for applying the presented sea ice drift algorithm are open-source to ensure free implementation and easy distribution.

  19. Precise 3D Track Reconstruction Algorithm for the ICARUS T600 Liquid Argon Time Projection Chamber Detector

    Directory of Open Access Journals (Sweden)

    M. Antonello

    2013-01-01

    Full Text Available Liquid Argon Time Projection Chamber (LAr TPC detectors offer charged particle imaging capability with remarkable spatial resolution. Precise event reconstruction procedures are critical in order to fully exploit the potential of this technology. In this paper we present a new, general approach to 3D reconstruction for the LAr TPC with a practical application to the track reconstruction. The efficiency of the method is evaluated on a sample of simulated tracks. We present also the application of the method to the analysis of stopping particle tracks collected during the ICARUS T600 detector operation with the CNGS neutrino beam.

  20. Precise 3D track reconstruction algorithm for the ICARUS T600 liquid argon time projection chamber detector

    CERN Document Server

    Antonello, M

    2013-01-01

    Liquid Argon Time Projection Chamber (LAr TPC) detectors offer charged particle imaging capability with remarkable spatial resolution. Precise event reconstruction procedures are critical in order to fully exploit the potential of this technology. In this paper we present a new, general approach of three-dimensional reconstruction for the LAr TPC with a practical application to track reconstruction. The efficiency of the method is evaluated on a sample of simulated tracks. We present also the application of the method to the analysis of real data tracks collected during the ICARUS T600 detector operation with the CNGS neutrino beam.

  1. Crystal Identification in Dual-Layer-Offset DOI-PET Detectors Using Stratified Peak Tracking Based on SVD and Mean-Shift Algorithm

    Science.gov (United States)

    Wei, Qingyang; Dai, Tiantian; Ma, Tianyu; Liu, Yaqiang; Gu, Yu

    2016-10-01

    An Anger-logic based pixelated PET detector block requires a crystal position map (CPM) to assign the position of each detected event to a most probable crystal index. Accurate assignments are crucial to PET imaging performance. In this paper, we present a novel automatic approach to generate the CPMs for dual-layer offset (DLO) PET detectors using a stratified peak tracking method. In which, the top and bottom layers are distinguished by their intensity difference and the peaks of the top and bottom layers are tracked based on a singular value decomposition (SVD) and mean-shift algorithm in succession. The CPM is created by classifying each pixel to its nearest peak and assigning the pixel with the crystal index of that peak. A Matlab-based graphical user interface program was developed including the automatic algorithm and a manual interaction procedure. The algorithm was tested for three DLO PET detector blocks. Results show that the proposed method exhibits good performance as well as robustness for all the three blocks. Compared to the existing methods, our approach can directly distinguish the layer and crystal indices using the information of intensity and offset grid pattern.

  2. Algorithmic Skin: Health-Tracking Technologies, Personal Analytics and the Biopedagogies of Digitized Health and Physical Education

    Science.gov (United States)

    Williamson, Ben

    2015-01-01

    The emergence of digitized health and physical education, or "eHPE", embeds software algorithms in the organization of health and physical education pedagogies. Particularly with the emergence of wearable and mobile activity trackers, biosensors and personal analytics apps, algorithmic processes have an increasingly powerful part to play…

  3. Pareto design of state feedback tracking control of a biped robot via multiobjective PSO in comparison with sigma method and genetic algorithms: modified NSGAII and MATLAB's toolbox.

    Science.gov (United States)

    Mahmoodabadi, M J; Taherkhorsandi, M; Bagheri, A

    2014-01-01

    An optimal robust state feedback tracking controller is introduced to control a biped robot. In the literature, the parameters of the controller are usually determined by a tedious trial and error process. To eliminate this process and design the parameters of the proposed controller, the multiobjective evolutionary algorithms, that is, the proposed method, modified NSGAII, Sigma method, and MATLAB's Toolbox MOGA, are employed in this study. Among the used evolutionary optimization algorithms to design the controller for biped robots, the proposed method operates better in the aspect of designing the controller since it provides ample opportunities for designers to choose the most appropriate point based upon the design criteria. Three points are chosen from the nondominated solutions of the obtained Pareto front based on two conflicting objective functions, that is, the normalized summation of angle errors and normalized summation of control effort. Obtained results elucidate the efficiency of the proposed controller in order to control a biped robot.

  4. Maximum power point tracking algorithm based on sliding mode and fuzzy logic for photovoltaic sources under variable environmental conditions

    Science.gov (United States)

    Atik, L.; Petit, P.; Sawicki, J. P.; Ternifi, Z. T.; Bachir, G.; Della, M.; Aillerie, M.

    2017-02-01

    Solar panels have a nonlinear voltage-current characteristic, with a distinct maximum power point (MPP), which depends on the environmental factors, such as temperature and irradiation. In order to continuously harvest maximum power from the solar panels, they have to operate at their MPP despite the inevitable changes in the environment. Various methods for maximum power point tracking (MPPT) were developed and finally implemented in solar power electronic controllers to increase the efficiency in the electricity production originate from renewables. In this paper we compare using Matlab tools Simulink, two different MPP tracking methods, which are, fuzzy logic control (FL) and sliding mode control (SMC), considering their efficiency in solar energy production.

  5. Structured Tracking for Safety, Security, and Privacy: Algorithms for Fusing Noisy Estimates from Sensor, Robot, and Camera Networks

    Science.gov (United States)

    2009-07-23

    Data gathering tours in sensor networks,” in Proceedings on Information Processing in Sensor Networks (IPSN), April 2006. [129] T. Meltzer, C...Shrobe, and A. Grue , “Simultaneous localization, calibration, and tracking in an ad hoc sensor network,” in Pro- ceedings of Information processing in

  6. Confronting the improvements to track reconstruction algorithms for the ATLAS inner detector with run 2 data from the LHC

    CERN Document Server

    AUTHOR|(INSPIRE)INSPIRE-00389298; The ATLAS collaboration

    2016-01-01

    With the increase in energy of the LHC to $\\sqrt{s}=13$~TeV for run 2, events with dense environments become much more abundant. These environments are characterized by charged particle separations of the order of ATLAS inner detector sensor dimensions and can be created by the decay of boosted objects. The performance of the track reconstruction in these extreme conditions is presented using Monte Carlo Simulation. Further, the inefficiency of the track reconstruction in the core of jets as a function of the transverse momentum of the jet between 200 GeV and 1600 GeV, using proton-proton data collected by the ATLAS experiment at a center-of-mass energy of $\\sqrt{s}=13$~TeV is discussed.

  7. Genetic algorithm with maximum-minimum crossover (GA-MMC) applied in optimization of radiation pattern control of phased-array radars for rocket tracking systems.

    Science.gov (United States)

    Silva, Leonardo W T; Barros, Vitor F; Silva, Sandro G

    2014-08-18

    In launching operations, Rocket Tracking Systems (RTS) process the trajectory data obtained by radar sensors. In order to improve functionality and maintenance, radars can be upgraded by replacing antennas with parabolic reflectors (PRs) with phased arrays (PAs). These arrays enable the electronic control of the radiation pattern by adjusting the signal supplied to each radiating element. However, in projects of phased array radars (PARs), the modeling of the problem is subject to various combinations of excitation signals producing a complex optimization problem. In this case, it is possible to calculate the problem solutions with optimization methods such as genetic algorithms (GAs). For this, the Genetic Algorithm with Maximum-Minimum Crossover (GA-MMC) method was developed to control the radiation pattern of PAs. The GA-MMC uses a reconfigurable algorithm with multiple objectives, differentiated coding and a new crossover genetic operator. This operator has a different approach from the conventional one, because it performs the crossover of the fittest individuals with the least fit individuals in order to enhance the genetic diversity. Thus, GA-MMC was successful in more than 90% of the tests for each application, increased the fitness of the final population by more than 20% and reduced the premature convergence.

  8. Genetic Algorithm with Maximum-Minimum Crossover (GA-MMC) Applied in Optimization of Radiation Pattern Control of Phased-Array Radars for Rocket Tracking Systems

    Science.gov (United States)

    Silva, Leonardo W. T.; Barros, Vitor F.; Silva, Sandro G.

    2014-01-01

    In launching operations, Rocket Tracking Systems (RTS) process the trajectory data obtained by radar sensors. In order to improve functionality and maintenance, radars can be upgraded by replacing antennas with parabolic reflectors (PRs) with phased arrays (PAs). These arrays enable the electronic control of the radiation pattern by adjusting the signal supplied to each radiating element. However, in projects of phased array radars (PARs), the modeling of the problem is subject to various combinations of excitation signals producing a complex optimization problem. In this case, it is possible to calculate the problem solutions with optimization methods such as genetic algorithms (GAs). For this, the Genetic Algorithm with Maximum-Minimum Crossover (GA-MMC) method was developed to control the radiation pattern of PAs. The GA-MMC uses a reconfigurable algorithm with multiple objectives, differentiated coding and a new crossover genetic operator. This operator has a different approach from the conventional one, because it performs the crossover of the fittest individuals with the least fit individuals in order to enhance the genetic diversity. Thus, GA-MMC was successful in more than 90% of the tests for each application, increased the fitness of the final population by more than 20% and reduced the premature convergence. PMID:25196013

  9. Genetic Algorithm with Maximum-Minimum Crossover (GA-MMC Applied in Optimization of Radiation Pattern Control of Phased-Array Radars for Rocket Tracking Systems

    Directory of Open Access Journals (Sweden)

    Leonardo W. T. Silva

    2014-08-01

    Full Text Available In launching operations, Rocket Tracking Systems (RTS process the trajectory data obtained by radar sensors. In order to improve functionality and maintenance, radars can be upgraded by replacing antennas with parabolic reflectors (PRs with phased arrays (PAs. These arrays enable the electronic control of the radiation pattern by adjusting the signal supplied to each radiating element. However, in projects of phased array radars (PARs, the modeling of the problem is subject to various combinations of excitation signals producing a complex optimization problem. In this case, it is possible to calculate the problem solutions with optimization methods such as genetic algorithms (GAs. For this, the Genetic Algorithm with Maximum-Minimum Crossover (GA-MMC method was developed to control the radiation pattern of PAs. The GA-MMC uses a reconfigurable algorithm with multiple objectives, differentiated coding and a new crossover genetic operator. This operator has a different approach from the conventional one, because it performs the crossover of the fittest individuals with the least fit individuals in order to enhance the genetic diversity. Thus, GA-MMC was successful in more than 90% of the tests for each application, increased the fitness of the final population by more than 20% and reduced the premature convergence.

  10. SU-G-BRA-05: Application of a Feature-Based Tracking Algorithm to KV X-Ray Fluoroscopic Images Toward Marker-Less Real-Time Tumor Tracking

    Energy Technology Data Exchange (ETDEWEB)

    Nakamura, M; Matsuo, Y; Mukumoto, N; Iizuka, Y; Yokota, K; Mizowaki, T; Hiraoka, M [Kyoto University, Graduate School of Medicine, Kyoto (Japan); Nakao, M [Kyoto University, Graduate School of Informatics, Kyoto (Japan)

    2016-06-15

    Purpose: To detect target position on kV X-ray fluoroscopic images using a feature-based tracking algorithm, Accelerated-KAZE (AKAZE), for markerless real-time tumor tracking (RTTT). Methods: Twelve lung cancer patients treated with RTTT on the Vero4DRT (Mitsubishi Heavy Industries, Japan, and Brainlab AG, Feldkirchen, Germany) were enrolled in this study. Respiratory tumor movement was greater than 10 mm. Three to five fiducial markers were implanted around the lung tumor transbronchially for each patient. Before beam delivery, external infrared (IR) markers and the fiducial markers were monitored for 20 to 40 s with the IR camera every 16.7 ms and with an orthogonal kV x-ray imaging subsystem every 80 or 160 ms, respectively. Target positions derived from the fiducial markers were determined on the orthogonal kV x-ray images, which were used as the ground truth in this study. Meanwhile, tracking positions were identified by AKAZE. Among a lot of feature points, AKAZE found high-quality feature points through sequential cross-check and distance-check between two consecutive images. Then, these 2D positional data were converted to the 3D positional data by a transformation matrix with a predefined calibration parameter. Root mean square error (RMSE) was calculated to evaluate the difference between 3D tracking and target positions. A total of 393 frames was analyzed. The experiment was conducted on a personal computer with 16 GB RAM, Intel Core i7-2600, 3.4 GHz processor. Results: Reproducibility of the target position during the same respiratory phase was 0.6 +/− 0.6 mm (range, 0.1–3.3 mm). Mean +/− SD of the RMSEs was 0.3 +/− 0.2 mm (range, 0.0–1.0 mm). Median computation time per frame was 179 msec (range, 154–247 msec). Conclusion: AKAZE successfully and quickly detected the target position on kV X-ray fluoroscopic images. Initial results indicate that the differences between 3D tracking and target position would be clinically acceptable.

  11. An in situ optical imaging system for measuring lipid uptake, vessel contraction, and lymph flow in small animal lymphatic vessels

    Science.gov (United States)

    Kassis, Timothy; Weiler, Michael J.; Dixon, J. Brandon

    2012-03-01

    All dietary lipids are transported to venous circulation through the lymphatic system, yet the underlying mechanisms that regulate this process remain unclear. Understanding how the lymphatics functionally respond to changes in lipid load is important in the diagnosis and treatment of lipid and lymphatic related diseases such as obesity, hypercholesterolemia, and lymphedema. Therefore, we sought to develop an in situ imaging system to quantify and correlate lymphatic function as it relates to lipid transport. A custom-built optical set-up provides us with the capability of dual-channel imaging of both high-speed bright-field video and fluorescence simultaneously. This is achieved by dividing the light path into two optical bands. Utilizing high-speed and back-illuminated CCD cameras and post-acquisition image processing algorithms, we have the potential quantify correlations between vessel contraction, lymph flow and lipid concentration of mesenteric lymphatic vessels in situ. Local flow velocity is measured through lymphocyte tracking, vessel contraction through measurements of the vessel walls and lipid uptake through fluorescence intensity tracking of a fluorescent long chain fatty acid analogue, Bodipy FL C16. This system will prove to be an invaluable tool for both scientists studying lymphatic function in health and disease, and those investigating strategies for targeting the lymphatic system with orally delivered drugs.

  12. New Technique for Voltage Tracking Control of a Boost Converter Based on the PSO Algorithm and LTspice

    DEFF Research Database (Denmark)

    Farhang, Peyman; Drimus, Alin; Mátéfi-Tempfli, Stefan

    2015-01-01

    In this paper, a new technique is proposed to design a Modified PID (MPID) controller for a Boost converter. An interface between LTspice and MATLAB is carried out to implement the Particle Swarm Optimization (PSO) algorithm. The PSO algorithm which has the appropriate capability to find out...... the optimal solutions is run in MATLAB while it is interfaced with LTspice for simulation of the circuit using actual component models obtained from manufacturers. The PSO is utilized to solve the optimization problem in order to find the optimal parameters of MPID and PID controllers. The performances...... of the controllers are evaluated for a wide range of operating conditions and different disturbances. The comprehensive simulation results demonstrate the effectiveness and robustness of the proposed method which are also explained through some performance indices....

  13. Improving pulmonary vessel image quality with a full model-based iterative reconstruction algorithm in 80kVp low-dose chest CT for pediatric patients aged 0-6 years.

    Science.gov (United States)

    Sun, Jihang; Zhang, Qifeng; Hu, Di; Duan, Xiaomin; Peng, Yun

    2015-06-01

    Full model-based iterative reconstruction (MBIR) algorithm decreasing image noise and improving spatial resolution significantly, combined with low voltage scan may improve image and vessels quality. To evaluate the image quality improvement of pulmonary vessels using a full MBIR in low-dose chest computed tomography (CT) for children. This study was institutional review board approved. Forty-one children (age range, 28 days-6 years, mean age, 2.0 years) who underwent 80 kVp low-dose CT scans were included. Age-dependent noise index (NI) for a 5-mm slice thickness image was used for the acquisition: NI = 11 for 0-12 months old, NI = 13 for 1-2 years old, and NI = 15 for 3-6 years old. Images were retrospectively reconstructed into thin slice thickness of 0.625 mm using the MBIR and a conventional filtered back projection (FBP) algorithm. Two radiologists independently evaluated images subjectively focusing on the ability to display small arteries and diagnosis confidence on a 5-point scale with 3 being clinically acceptable. CT value and image noise in the descending aorta, muscle and fat were measured and statistically compared between the two reconstruction groups. The ability to display small vessels was significantly improved with the MBIR reconstruction. The subjective scores of displaying small vessels were 5.0 and 3.7 with MBIR and FBP, respectively, while the respective diagnosis confidence scores were 5.0 and 3.8. Quantitative image noise for the 0.625 mm slice thickness images in the descending aorta was 15.8 ± 3.8 HU in MBIR group, 57.3% lower than the 37.0 ± 7.3 HU in FBP group. The signal-to-noise ratio and contrast-to-noise ratio for the descending aorta were 28.3 ± 7.9 and 24.05 ± 7.5 in MBIR group, and 12.1 ± 3.7 and 10.6 ± 3.5 in FBP group, respectively. These values were improved by 133.9% and 132.1%, respectively, with MBIR reconstruction compared to FBP reconstruction. Compared to the conventional FBP reconstruction, the image quality and

  14. Research vessels

    Digital Repository Service at National Institute of Oceanography (India)

    Rao, P.S.

    by the research vessels RV Gaveshani and ORV Sagar Kanya are reported. The work carried out by the three charted ships is also recorded. A short note on cruise plans for the study of ferromanganese nodules is added...

  15. High-resolution 3D coronary vessel wall imaging with near 100% respiratory efficiency using epicardial fat tracking: reproducibility and comparison with standard methods.

    Science.gov (United States)

    Scott, Andrew D; Keegan, Jennifer; Firmin, David N

    2011-01-01

    To quantitatively assess the performance and reproducibility of 3D spiral coronary artery wall imaging with beat-to-beat respiratory-motion-correction (B2B-RMC) compared to navigator gated 2D spiral and turbo-spin-echo (TSE) acquisitions. High-resolution (0.7 × 0.7 mm) cross-sectional right coronary wall acquisitions were performed in 10 subjects using four techniques (B2B-RMC 3D spiral with alternate (2RR) and single (1RR) R-wave gating, navigator-gated 2D spiral (2RR) and navigator-gated 2D TSE (2RR)) on two occasions. Wall thickness measurements were compared with repeated measures analysis of variance (ANOVA). Reproducibility was assessed with the intraclass correlation coefficient (ICC). In all, 91% (73/80) of acquisitions were successful (failures: four TSE, two 3D spiral (1RR) and one 3D spiral (2RR)). Respiratory efficiency of the B2B-RMC was less variable and substantially higher than for navigator gating (99.6 ± 1.2% vs. 39.0 ± 7.5%, P B2B-RMC permits coronary vessel wall assessment over multiple thin contiguous slices in a clinically feasible duration. Excellent reproducibility of the technique potentially enables studies of disease progression/regression. Copyright © 2010 Wiley-Liss, Inc.

  16. An Enhanced Satellite-Based Algorithm for Detecting and Tracking Dust Outbreaks by Means of SEVIRI Data

    Directory of Open Access Journals (Sweden)

    Francesco Marchese

    2017-05-01

    Full Text Available Dust outbreaks are meteorological phenomena of great interest for scientists and authorities (because of their impact on the climate, environment, and human activities, which may be detected, monitored, and characterized from space using different methods and procedures. Among the recent dust detection algorithms, the RSTDUST multi-temporal technique has provided good results in different geographic areas (e.g., Mediterranean basin; Arabian Peninsula, exhibiting a better performance than traditional split window methods, in spite of some limitations. In this study, we present an optimized configuration of this technique, which better exploits data provided by Spinning Enhanced Visible and Infrared Imager (SEVIRI aboard Meteosat Second Generation (MSG satellites to address those issues (e.g., sensitivity reduction over arid and semi-arid regions; dependence on some meteorological clouds. Three massive dust events affecting Europe and the Mediterranean basin in May 2008/2010 are analysed in this work, using information provided by some independent and well-established aerosol products to assess the achieved results. The study shows that the proposed algorithm, christened eRSTDUST (i.e., enhanced RSTDUST, which provides qualitative information about dust outbreaks, is capable of increasing the trade-off between reliability and sensitivity. The results encourage further experimentations of this method in other periods of the year, also exploiting data provided by different satellite sensors, for better evaluating the advantages arising from the use of this dust detection technique in operational scenarios.

  17. Thermal Tracking of Sports Players

    DEFF Research Database (Denmark)

    Gade, Rikke; Moeslund, Thomas B.

    2014-01-01

    We present here a real-time tracking algorithm for thermal video from a sports game. Robust detection of people includes routines for handling occlusions and noise before tracking each detected person with a Kalman filter. This online tracking algorithm is compared with a state-of-the-art offline...

  18. The optimal monochromatic spectral computed tomographic imaging plus adaptive statistical iterative reconstruction algorithm can improve the superior mesenteric vessel image quality.

    Science.gov (United States)

    Yin, Xiao-Ping; Zuo, Zi-Wei; Xu, Ying-Jin; Wang, Jia-Ning; Liu, Huai-Jun; Liang, Guang-Lu; Gao, Bu-Lang

    2017-04-01

    To investigate the effect of the optimal monochromatic spectral computed tomography (CT) plus adaptive statistical iterative reconstruction on the improvement of the image quality of the superior mesenteric artery and vein. The gemstone spectral CT angiographic data of 25 patients were reconstructed in the following three groups: 70KeV, the optimal monochromatic imaging, and the optimal monochromatic plus 40%iterative reconstruction mode. The CT value, image noises (IN), background CT value and noises, contrast-to-noise ratio (CNR), signal-to-noise ratio (SNR) and image scores of the vessels and surrounding tissues were analyzed. In the 70KeV, the optimal monochromatic and the optimal monochromatic images plus 40% iterative reconstruction group, the mean scores of image quality were 3.86, 4.24 and 4.25 for the superior mesenteric artery and 3.46, 3.78 and 3.81 for the superior mesenteric vein, respectively. The image quality scores for the optimal monochromatic and the optimal monochromatic plus 40% iterative reconstruction groups were significantly greater than for the 70KeV group (Piterative reconstruction group than in the 70KeV group. The optimal monochromatic plus 40% iterative reconstruction group had significantly (Piterative reconstruction using low-contrast agent dosage and low injection rate can significantly improve the image quality of the superior mesenteric artery and vein. Copyright © 2017 Elsevier B.V. All rights reserved.

  19. Adaptive state multiple-hypothesis tracking

    NARCIS (Netherlands)

    Kleef, J. van; Kester, L.J.H.M.

    2006-01-01

    In tracking algorithms where measurements from various sensors are combined the track state representation is usually dependent on the type of sensor information that is received. When a multi-hypothesis tracking algorithm is used the probabilities of the different hypotheses containing tracks in

  20. Thermal Tracking of Sports Players

    Directory of Open Access Journals (Sweden)

    Rikke Gade

    2014-07-01

    Full Text Available We present here a real-time tracking algorithm for thermal video from a sports game. Robust detection of people includes routines for handling occlusions and noise before tracking each detected person with a Kalman filter. This online tracking algorithm is compared with a state-of-the-art offline multi-target tracking algorithm. Experiments are performed on a manually annotated 2-minutes video sequence of a real soccer game. The Kalman filter shows a very promising result on this rather challenging sequence with a tracking accuracy above 70% and is superior compared with the offline tracking approach. Furthermore, the combined detection and tracking algorithm runs in real time at 33 fps, even with large image sizes of 1920 × 480 pixels.

  1. Satellite and acoustic tracking device

    KAUST Repository

    Berumen, Michael L.

    2014-02-20

    The present invention relates a method and device for tracking movements of marine animals or objects in large bodies of water and across significant distances. The method and device can track an acoustic transmitter attached to an animal or object beneath the ocean surface by employing an unmanned surface vessel equipped with a hydrophone array and GPS receiver.

  2. Cardiovascular magnetic resonance myocardial feature tracking using a non-rigid, elastic image registration algorithm: assessment of variability in a real-life clinical setting.

    Science.gov (United States)

    Morais, Pedro; Marchi, Alberto; Bogaert, Julie A; Dresselaers, Tom; Heyde, Brecht; D'hooge, Jan; Bogaert, Jan

    2017-02-17

    Cardiovascular magnetic resonance myocardial feature tracking (CMR-FT) is a promising technique for quantification of myocardial strain from steady-state free precession (SSFP) cine images. We sought to determine the variability of CMR-FT using a non-rigid elastic registration algorithm recently available in a commercial software package (Segment, Medviso) in a real-life clinical setting. Firstly, we studied the variability in a healthy volunteer who underwent 10 CMR studies over five consecutive days. Secondly, 10 patients were selected from our CMR database yielding normal findings (normal group). Finally, we prospectively studied 10 patients with known or suspected myocardial pathology referred for further investigation to CMR (patient group). In the patient group a second study was performed respecting an interval of 30 min between studies. All studies were manually segmented at the end-diastolic phase by three observers. In all subjects left ventricular (LV) circumferential and radial strain were calculated in the short-axis direction (EccSAX and ErrSAX, respectively) and longitudinal strain in the long-axis direction (EllLAX). The level of CMR experience of the observers was 2 weeks, 6 months and >20 years. Mean contouring time was 7 ± 1 min, mean FT calculation time 13 ± 2 min. Intra- and inter-observer variability was good to excellent with an coefficient of reproducibility (CR) ranging 1.6% to 11.5%, and 1.7% to 16.0%, respectively and an intraclass correlation coefficient (ICC) ranging 0.89 to 1.00 and 0.74 to 0.99, respectively. Variability considerably increased in the test-retest setting with a CR ranging 4.2% to 29.1% and an ICC ranging 0.66 to 0.95 in the patient group. Variability was not influenced by level of expertise of the observers. Neither did the presence of myocardial pathology at CMR negatively impact variability. However, compared to global myocardial strain, segmental myocardial strain variability increased with a factor

  3. Vessel Operator System

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — Operator cards are required for any operator of a charter/party boat and or a commercial vessel (including carrier and processor vessels) issued a vessel permit from...

  4. Pareto design of state feedback tracking control of a biped robot via multiobjective PSO in comparison with sigma method and genetic algorithms: modified NSGAII and MATLAB's toolbox

    National Research Council Canada - National Science Library

    Mahmoodabadi, M J; Taherkhorsandi, M; Bagheri, A

    2014-01-01

    .... To eliminate this process and design the parameters of the proposed controller, the multiobjective evolutionary algorithms, that is, the proposed method, modified NSGAII, Sigma method, and MATLAB's...

  5. Trajectory tracking control of underactuated USV based on modified backstepping approach

    Directory of Open Access Journals (Sweden)

    Zaopeng Dong

    2015-09-01

    Full Text Available This paper presents a state feedback based backstepping control algorithm to address the trajectory tracking problem of an underactuated Unmanned Surface Vessel (USV in the horizontal plane. A nonlinear three Degree of Freedom (DOF underactuated dynamic model for USV is considered, and trajectory tracking controller that can track both curve trajectory and straight line trajectory with high accuracy is designed as the well known Persistent Exciting (PE conditions of yaw velocity is completely relaxed in our study. The proposed controller has further been enriched by incorporating an integral action additionally for enhancing the steady state performance and control precision of the USV trajectory tracking control system. Global stability of the overall system is proved by Lyapunov theory and Barbalat’s Lemma, and then simulation experiments are carried out to demonstrate the effectiveness of the controller designed.

  6. New algorithms for motion error detection of numerical control machine tool by laser tracking measurement on the basis of GPS principle

    Science.gov (United States)

    Wang, Jindong; Chen, Peng; Deng, Yufen; Guo, Junjie

    2018-01-01

    As a three-dimensional measuring instrument, the laser tracker is widely used in industrial measurement. To avoid the influence of angle measurement error on the overall measurement accuracy, the multi-station and time-sharing measurement with a laser tracker is introduced on the basis of the global positioning system (GPS) principle in this paper. For the proposed method, how to accurately determine the coordinates of each measuring point by using a large amount of measured data is a critical issue. Taking detecting motion error of a numerical control machine tool, for example, the corresponding measurement algorithms are investigated thoroughly. By establishing the mathematical model of detecting motion error of a machine tool with this method, the analytical algorithm concerning on base station calibration and measuring point determination is deduced without selecting the initial iterative value in calculation. However, when the motion area of the machine tool is in a 2D plane, the coefficient matrix of base station calibration is singular, which generates a distortion result. In order to overcome the limitation of the original algorithm, an improved analytical algorithm is also derived. Meanwhile, the calibration accuracy of the base station with the improved algorithm is compared with that with the original analytical algorithm and some iterative algorithms, such as the Gauss-Newton algorithm and Levenberg-Marquardt algorithm. The experiment further verifies the feasibility and effectiveness of the improved algorithm. In addition, the different motion areas of the machine tool have certain influence on the calibration accuracy of the base station, and the corresponding influence of measurement error on the calibration result of the base station depending on the condition number of coefficient matrix are analyzed.

  7. Flattening maps for the visualization of multibranched vessels.

    Science.gov (United States)

    Zhu, Lei; Haker, Steven; Tannenbaum, Allen

    2005-02-01

    In this paper, we present two novel algorithms which produce flattened visualizations of branched physiological surfaces, such as vessels. The first approach is a conformal mapping algorithm based on the minimization of two Dirichlet functionals. From a triangulated representation of vessel surfaces, we show how the algorithm can be implemented using a finite element technique. The second method is an algorithm which adjusts the conformal mapping to produce a flattened representation of the original surface while preserving areas. This approach employs the theory of optimal mass transport. Furthermore, a new way of extracting center lines for vessel fly-throughs is provided.

  8. Bioinspired Coordinated Path Following for Vessels with Speed Saturation Based on Virtual Leader

    Directory of Open Access Journals (Sweden)

    Mingyu Fu

    2016-01-01

    Full Text Available This paper investigates the coordinated path following of multiple marine vessels with speed saturation. Based on virtual leader strategy, the authors show how the neural dynamic model and passivity-based techniques are brought together to yield a distributed control strategy. The desired path following is achieved by means of a virtual dynamic leader, whose controller is designed based on the biological neural shunting model. Utilizing the characteristic of bounded and smooth output of neural dynamic model, the tracking error jump is avoided and speed saturation problem is solved in straight path. Meanwhile, the coordinated path following of multiple vessels with a desired spatial formation is achieved through defining the formation reference point. The consensus of formation reference point is realized by using the synchronization controller based on passivity. Finally, simulation results validate the effectiveness of the proposed coordinated algorithm.

  9. Slab track

    OpenAIRE

    Golob, Tina

    2014-01-01

    The last 160 years has been mostly used conventional track with ballasted bed, sleepers and steel rail. Ensuring the high speed rail traffic, increasing railway track capacities, providing comfortable and safe ride as well as high reliability and availability railway track, has led to development of innovative systems for railway track. The so-called slab track was first built in 1972 and since then, they have developed many different slab track systems around the world. Slab track was also b...

  10. Development of ROV System for FOSAR in Reactor Vessel

    Energy Technology Data Exchange (ETDEWEB)

    Choi, Young Soo; Kim, Tae Won; Lee, Sung Uk; Jeong, Kyung Min [Korea Atomic Energy Research Institute, Daejeon (Korea, Republic of); Kim, Nam Kyun [Korea Plant Service and Engineering Co., Seongnam (Korea, Republic of)

    2011-10-15

    Foreign object in the reactor vessel is susceptible to damage the fuel. Prior to reloading fuel assemblies into the core, FOSAR(Foreign Object Search And Retrieval) activities were performed on and beneath the lower core plate with conventional equipment. However, the reactor vessel is limited to humans who are susceptible to radiation exposure, and conventional equipment is hard to access because of the complexity of the structure. To improve the convenience of use and retrieval ability in the under-core plate region, we are developing a FOSAR system carried by ROV (Remotely Operated Vehicle). In this paper, we describe a ROV system developed. The ROV system is composed of robot vehicle and remote control unit. The vehicle has 4 thrusters, tilt, camera, light and depth sensor, etc. Considering radiation damage, processors are not equipped on the vehicle. Control signals and sensing signals are transferred through umbilical cable. Remote control unit is composed of electric driving module and two computers which one is for the control and the other is for the detection of robot position. Control computer has a joystick user input and video/signal input, and transmit motor control signal and lens control signal via CAN/RS485 communication. And the other computers transmit information of vehicle position to the control computer via serial communication. Information of vehicle position is obtained through image processing algorithm. The acquiring camera of vehicle is on the flange of reactor vessel. Simulations on the detection of vehicle position are performed at the reactor vessel mockup which scaled down by 6 and verified to use in the control of robot by visual tracking. And functional test has been performed on the air condition. In the future, performance test will be carried out real sized mockup and underwater condition

  11. Modified Clipped LMS Algorithm

    Directory of Open Access Journals (Sweden)

    Lotfizad Mojtaba

    2005-01-01

    Full Text Available Abstract A new algorithm is proposed for updating the weights of an adaptive filter. The proposed algorithm is a modification of an existing method, namely, the clipped LMS, and uses a three-level quantization ( scheme that involves the threshold clipping of the input signals in the filter weight update formula. Mathematical analysis shows the convergence of the filter weights to the optimum Wiener filter weights. Also, it can be proved that the proposed modified clipped LMS (MCLMS algorithm has better tracking than the LMS algorithm. In addition, this algorithm has reduced computational complexity relative to the unmodified one. By using a suitable threshold, it is possible to increase the tracking capability of the MCLMS algorithm compared to the LMS algorithm, but this causes slower convergence. Computer simulations confirm the mathematical analysis presented.

  12. BIOASSAY VESSEL FAILURE ANALYSIS

    Energy Technology Data Exchange (ETDEWEB)

    Vormelker, P

    2008-09-22

    Two high-pressure bioassay vessels failed at the Savannah River Site during a microwave heating process for biosample testing. Improper installation of the thermal shield in the first failure caused the vessel to burst during microwave heating. The second vessel failure is attributed to overpressurization during a test run. Vessel failure appeared to initiate in the mold parting line, the thinnest cross-section of the octagonal vessel. No material flaws were found in the vessel that would impair its structural performance. Content weight should be minimized to reduce operating temperature and pressure. Outer vessel life is dependent on actual temperature exposure. Since thermal aging of the vessels can be detrimental to their performance, it was recommended that the vessels be used for a limited number of cycles to be determined by additional testing.

  13. Algebraic Riccati equation based Q and R matrices selection algorithm for optimal LQR applied to tracking control of 3rd order magnetic levitation system

    Directory of Open Access Journals (Sweden)

    Kumare Vinodh

    2016-03-01

    Full Text Available This paper presents an analytical approach for solving the weighting matrices selection problem of a linear quadratic regulator (LQR for the trajectory tracking application of a magnetic levitation system. One of the challenging problems in the design of LQR for tracking applications is the choice of Q and R matrices. Conventionally, the weights of a LQR controller are chosen based on a trial and error approach to determine the optimum state feedback controller gains. However, it is often time consuming and tedious to tune the controller gains via a trial and error method. To address this problem, by utilizing the relation between the algebraic Riccati equation (ARE and the Lagrangian optimization principle, an analytical methodology for selecting the elements of Q and R matrices has been formulated. The novelty of the methodology is the emphasis on the synthesis of time domain design specifications for the formulation of the cost function of LQR, which directly translates the system requirement into a cost function so that the optimal performance can be obtained via a systematic approach. The efficacy of the proposed methodology is tested on the benchmark Quanser magnetic levitation system and a detailed simulation and experimental results are presented. Experimental results prove that the proposed methodology not only provides a systematic way of selecting the weighting matrices but also significantly improves the tracking performance of the system.

  14. Algorithms and Algorithmic Languages.

    Science.gov (United States)

    Veselov, V. M.; Koprov, V. M.

    This paper is intended as an introduction to a number of problems connected with the description of algorithms and algorithmic languages, particularly the syntaxes and semantics of algorithmic languages. The terms "letter, word, alphabet" are defined and described. The concept of the algorithm is defined and the relation between the algorithm and…

  15. Fast Compressive Tracking.

    Science.gov (United States)

    Zhang, Kaihua; Zhang, Lei; Yang, Ming-Hsuan

    2014-10-01

    It is a challenging task to develop effective and efficient appearance models for robust object tracking due to factors such as pose variation, illumination change, occlusion, and motion blur. Existing online tracking algorithms often update models with samples from observations in recent frames. Despite much success has been demonstrated, numerous issues remain to be addressed. First, while these adaptive appearance models are data-dependent, there does not exist sufficient amount of data for online algorithms to learn at the outset. Second, online tracking algorithms often encounter the drift problems. As a result of self-taught learning, misaligned samples are likely to be added and degrade the appearance models. In this paper, we propose a simple yet effective and efficient tracking algorithm with an appearance model based on features extracted from a multiscale image feature space with data-independent basis. The proposed appearance model employs non-adaptive random projections that preserve the structure of the image feature space of objects. A very sparse measurement matrix is constructed to efficiently extract the features for the appearance model. We compress sample images of the foreground target and the background using the same sparse measurement matrix. The tracking task is formulated as a binary classification via a naive Bayes classifier with online update in the compressed domain. A coarse-to-fine search strategy is adopted to further reduce the computational complexity in the detection procedure. The proposed compressive tracking algorithm runs in real-time and performs favorably against state-of-the-art methods on challenging sequences in terms of efficiency, accuracy and robustness.

  16. Guam Abandoned Vessel Inventory

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — NOAA Abandoned Vessel Project Data for Guam. Abandoned vessels pose a significant threat to the NOAA Trust resources through physical destruction of coral habitats...

  17. Florida Abandoned Vessel Inventory

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — NOAA Abandoned Vessel Project Data for Florida. Abandoned vessels pose a significant threat to the NOAA Trust resources through physical destruction of coral...

  18. Vessel Arrival Info - Legacy

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — The Vessel Arrival Info is a spreadsheet that gets filled out during the initial stage of the debriefing process by the debriefer. It contains vessel name, trip...

  19. ALICE HMPID Radiator Vessel

    CERN Multimedia

    2003-01-01

    View of the radiator vessels of the ALICE/HMPID mounted on the support frame. Each HMPID module is equipped with 3 indipendent radiator vessels made out of neoceram and fused silica (quartz) windows glued together. The spacers inside the vessel are needed to stand the hydrostatic pressure. http://alice-hmpid.web.cern.ch/alice-hmpid

  20. The Retina Algorithm

    CERN Multimedia

    CERN. Geneva; PUNZI, Giovanni

    2015-01-01

    Charge particle reconstruction is one of the most demanding computational tasks found in HEP, and it becomes increasingly important to perform it in real time. We envision that HEP would greatly benefit from achieving a long-term goal of making track reconstruction happen transparently as part of the detector readout ("detector-embedded tracking"). We describe here a track-reconstruction approach based on a massively parallel pattern-recognition algorithm, inspired by studies of the processing of visual images by the brain as it happens in nature ('RETINA algorithm'). It turns out that high-quality tracking in large HEP detectors is possible with very small latencies, when this algorithm is implemented in specialized processors, based on current state-of-the-art, high-speed/high-bandwidth digital devices.

  1. Algorithmic Self

    DEFF Research Database (Denmark)

    Markham, Annette

    layered set of accounts to help build our understanding of how individuals relate to their devices, search systems, and social network sites. This work extends critical analyses of the power of algorithms in implicating the social self by offering narrative accounts from multiple perspectives. It also......This paper takes an actor network theory approach to explore some of the ways that algorithms co-construct identity and relational meaning in contemporary use of social media. Based on intensive interviews with participants as well as activity logging and data tracking, the author presents a richly...... contributes an innovative method for blending actor network theory with symbolic interaction to grapple with the complexity of everyday sensemaking practices within networked global information flows....

  2. Structural Sparse Tracking

    KAUST Repository

    Zhang, Tianzhu

    2015-06-01

    Sparse representation has been applied to visual tracking by finding the best target candidate with minimal reconstruction error by use of target templates. However, most sparse representation based trackers only consider holistic or local representations and do not make full use of the intrinsic structure among and inside target candidates, thereby making the representation less effective when similar objects appear or under occlusion. In this paper, we propose a novel Structural Sparse Tracking (SST) algorithm, which not only exploits the intrinsic relationship among target candidates and their local patches to learn their sparse representations jointly, but also preserves the spatial layout structure among the local patches inside each target candidate. We show that our SST algorithm accommodates most existing sparse trackers with the respective merits. Both qualitative and quantitative evaluations on challenging benchmark image sequences demonstrate that the proposed SST algorithm performs favorably against several state-of-the-art methods.

  3. Maximum Power Point tracking algorithm based on I-V characteristic of PV array under uniform and non-uniform conditions

    DEFF Research Database (Denmark)

    Kouchaki, Alireza; Iman-Eini, H.; Asaei, B.

    2012-01-01

    This paper presents a new algorithm based on characteristic equation of solar cells to determine the Maximum Power Point (MPP) of PV modules under partially shaded conditions (PSC). To achieve this goal, an analytic condition is introduced to determine uniform or non-uniform atmospheric conditions...... quickly. This paper also proposes an effective and quick response technique to find the MPP of PV array among Global Peak (GP) and local peaks when PSC occurs based on the analytic condition. It also can perform in a manner like conventional MPPT method when the insolation conditions are uniform. In order...

  4. Research on risk long range identification for vessel traffic dynamic system

    Science.gov (United States)

    Qi, Ji; Guo, Ruijuan; Wang, Xiaoyu; Zhang, Hainan

    2017-09-01

    Vessel Long-range identification and tracking system has already been widely installed and applied in vessel. In this paper AIS system, vessel reporting system and LRIT in China are compared and analyzed based on the coverage area, confidentiality and accuracy of the LRIT information. Vessel Long-range identification and tracking model is established through a combination of AIS with LRIT system, which is applied to the research of vessel traffic dynamic system risk long range identification. Finally, the application of LRIT in the maritime field is discussed.

  5. Vessel discoloration detection in malarial retinopathy

    Science.gov (United States)

    Agurto, C.; Nemeth, S.; Barriga, S.; Soliz, P.; MacCormick, I.; Taylor, T.; Harding, S.; Lewallen, S.; Joshi, V.

    2016-03-01

    Cerebral malaria (CM) is a life-threatening clinical syndrome associated with malarial infection. It affects approximately 200 million people, mostly sub-Saharan African children under five years of age. Malarial retinopathy (MR) is a condition in which lesions such as whitening and vessel discoloration that are highly specific to CM appear in the retina. Other unrelated diseases can present with symptoms similar to CM, therefore the exact nature of the clinical symptoms must be ascertained in order to avoid misdiagnosis, which can lead to inappropriate treatment and, potentially, death. In this paper we outline the first system to detect the presence of discolored vessels associated with MR as a means to improve the CM diagnosis. We modified and improved our previous vessel segmentation algorithm by incorporating the `a' channel of the CIELab color space and noise reduction. We then divided the segmented vasculature into vessel segments and extracted features at the wall and in the centerline of the segment. Finally, we used a regression classifier to sort the segments into discolored and not-discolored vessel classes. By counting the abnormal vessel segments in each image, we were able to divide the analyzed images into two groups: normal and presence of vessel discoloration due to MR. We achieved an accuracy of 85% with sensitivity of 94% and specificity of 67%. In clinical practice, this algorithm would be combined with other MR retinal pathology detection algorithms. Therefore, a high specificity can be achieved. By choosing a different operating point in the ROC curve, our system achieved sensitivity of 67% with specificity of 100%.

  6. An Efficient, Scalable Time-Frequency Method for Tracking Energy Usage of Domestic Appliances Using a Two-Step Classification Algorithm

    Directory of Open Access Journals (Sweden)

    Paula Meehan

    2014-10-01

    Full Text Available Load monitoring is the practice of measuring electrical signals in a domestic environment in order to identify which electrical appliances are consuming power. One reason for developing a load monitoring system is to reduce power consumption by increasing consumers’ awareness of which appliances consume the most energy. Another example of an application of load monitoring is activity sensing in the home for the provision of healthcare services. This paper outlines the development of a load disaggregation method that measures the aggregate electrical signals of a domestic environment and extracts features to identify each power consuming appliance. A single sensor is deployed at the main incoming power point, to sample the aggregate current signal. The method senses when an appliance switches ON or OFF and uses a two-step classification algorithm to identify which appliance has caused the event. Parameters from the current in the temporal and frequency domains are used as features to define each appliance. These parameters are the steady-state current harmonics and the rate of change of the transient signal. Each appliance’s electrical characteristics are distinguishable using these parameters. There are three Types of loads that an appliance can fall into, linear nonreactive, linear reactive or nonlinear reactive. It has been found that by identifying the load type first and then using a second classifier to identify individual appliances within these Types, the overall accuracy of the identification algorithm is improved.

  7. Large Radius Tracking at the ATLAS Experiment

    CERN Document Server

    Lutz, Margaret Susan; The ATLAS collaboration

    2017-01-01

    Many exotics and SUSY models include particles which are long lived resulting in decays which are highly displaced from the proton-proton interaction point (IP). The standard track reconstruction algorithm used by the ATLAS collaboration is optimized for tracks from “primary” particles, which originate close to the IP. Thus, tight restrictions on the transverse and longitudinal impact parameters, as well as on several other tracking variables, are applied to improve the track reconstruction performance and to reduce the fake rate. This track reconstruction is very efficient for primary particles, but not for the non-prompt particles mentioned above.  In order to reconstruct tracks with large impact parameters due to displaced decays, a tracking algorithm has been optimized to re-run with loosened requirements over the hits left over after standard track reconstruction has finished. Enabling this “retracking” has significantly increased the efficiency of reconstructing tracks from displaced decays, wh...

  8. Persistent Aerial Tracking

    KAUST Repository

    Mueller, Matthias

    2016-04-13

    In this thesis, we propose a new aerial video dataset and benchmark for low altitude UAV target tracking, as well as, a photo-realistic UAV simulator that can be coupled with tracking methods. Our benchmark provides the rst evaluation of many state of-the-art and popular trackers on 123 new and fully annotated HD video sequences captured from a low-altitude aerial perspective. Among the compared trackers, we determine which ones are the most suitable for UAV tracking both in terms of tracking accuracy and run-time. We also present a simulator that can be used to evaluate tracking algorithms in real-time scenarios before they are deployed on a UAV "in the field", as well as, generate synthetic but photo-realistic tracking datasets with free ground truth annotations to easily extend existing real-world datasets. Both the benchmark and simulator will be made publicly available to the vision community to further research in the area of object tracking from UAVs. Additionally, we propose a persistent, robust and autonomous object tracking system for unmanned aerial vehicles (UAVs) called Persistent Aerial Tracking (PAT). A computer vision and control strategy is applied to a diverse set of moving objects (e.g. humans, animals, cars, boats, etc.) integrating multiple UAVs with a stabilized RGB camera. A novel strategy is employed to successfully track objects over a long period, by \\'handing over the camera\\' from one UAV to another. We integrate the complete system into an off-the-shelf UAV, and obtain promising results showing the robustness of our solution in real-world aerial scenarios.

  9. Online Tracking

    Science.gov (United States)

    ... for other purposes, such as research, measurement, and fraud prevention. Mobile browsers work much like traditional web ... users’ Do Not Track preferences. Can I block online tracking? Consumers can learn about tracker-blocking browser ...

  10. Pressure vessel design manual

    CERN Document Server

    Moss, Dennis R

    2013-01-01

    Pressure vessels are closed containers designed to hold gases or liquids at a pressure substantially different from the ambient pressure. They have a variety of applications in industry, including in oil refineries, nuclear reactors, vehicle airbrake reservoirs, and more. The pressure differential with such vessels is dangerous, and due to the risk of accident and fatality around their use, the design, manufacture, operation and inspection of pressure vessels is regulated by engineering authorities and guided by legal codes and standards. Pressure Vessel Design Manual is a solutions-focused guide to the many problems and technical challenges involved in the design of pressure vessels to match stringent standards and codes. It brings together otherwise scattered information and explanations into one easy-to-use resource to minimize research and take readers from problem to solution in the most direct manner possible. * Covers almost all problems that a working pressure vessel designer can expect to face, with ...

  11. Maury Journals - German Vessels

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — German vessels observations, after the 1853 Brussels Conference that set International Maritime Standards, modeled after Maury Marine Standard Observations.

  12. Particle tracking

    CERN Document Server

    Safarík, K; Newby, J; Sørensen, P

    2002-01-01

    In this lecture we will present a short historical overview of different tracking detectors. Then we will describe currently used gaseous and silicon detectors and their performance. In the second part we will discuss how to estimate tracking precision, how to design a tracker and how the track finding works. After a short description of the LHC the main attention is drawn to the ALICE experiment since it is dedicated to study new states in hadronic matter at the LHC. The ALICE tracking procedure is discussed in detail. A comparison to the tracking in ATLAS, CMS and LHCb is given. (5 refs).

  13. PRESSURE-RESISTANT VESSEL

    NARCIS (Netherlands)

    Beukers, A.; De Jong, T.

    1997-01-01

    Abstract of WO 9717570 (A1) The invention is directed to a wheel-shaped pressure-resistant vessel for gaseous, liquid or liquefied material having a substantially rigid shape, said vessel comprising a substantially continuous shell of a fiber-reinforced resin having a central opening, an inner

  14. Development of a radiation track structure clustering algorithm for the prediction of DNA DSB yields and radiation induced cell death in Eukaryotic cells.

    Science.gov (United States)

    Douglass, Michael; Bezak, Eva; Penfold, Scott

    2015-04-21

    The preliminary framework of a combined radiobiological model is developed and calibrated in the current work. The model simulates the production of individual cells forming a tumour, the spatial distribution of individual ionization events (using Geant4-DNA) and the stochastic biochemical repair of DNA double strand breaks (DSBs) leading to the prediction of survival or death of individual cells. In the current work, we expand upon a previously developed tumour generation and irradiation model to include a stochastic ionization damage clustering and DNA lesion repair model. The Geant4 code enabled the positions of each ionization event in the cells to be simulated and recorded for analysis. An algorithm was developed to cluster the ionization events in each cell into simple and complex double strand breaks. The two lesion kinetic (TLK) model was then adapted to predict DSB repair kinetics and the resultant cell survival curve. The parameters in the cell survival model were then calibrated using experimental cell survival data of V79 cells after low energy proton irradiation. A monolayer of V79 cells was simulated using the tumour generation code developed previously. The cells were then irradiated by protons with mean energies of 0.76 MeV and 1.9 MeV using a customized version of Geant4. By replicating the experimental parameters of a low energy proton irradiation experiment and calibrating the model with two sets of data, the model is now capable of predicting V79 cell survival after low energy (cell survival probability, the cell survival probability is calculated for each cell in the geometric tumour model developed in the current work. This model uses fundamental measurable microscopic quantities such as genome length rather than macroscopic radiobiological quantities such as alpha/beta ratios. This means that the model can be theoretically used under a wide range of conditions with a single set of input parameters once calibrated for a given cell line.

  15. Containment vessel drain system

    Energy Technology Data Exchange (ETDEWEB)

    Harris, Scott G.

    2018-01-30

    A system for draining a containment vessel may include a drain inlet located in a lower portion of the containment vessel. The containment vessel may be at least partially filled with a liquid, and the drain inlet may be located below a surface of the liquid. The system may further comprise an inlet located in an upper portion of the containment vessel. The inlet may be configured to insert pressurized gas into the containment vessel to form a pressurized region above the surface of the liquid, and the pressurized region may operate to apply a surface pressure that forces the liquid into the drain inlet. Additionally, a fluid separation device may be operatively connected to the drain inlet. The fluid separation device may be configured to separate the liquid from the pressurized gas that enters the drain inlet after the surface of the liquid falls below the drain inlet.

  16. 4D Cellular Automaton Track Finder in the CBM Experiment

    Directory of Open Access Journals (Sweden)

    Akishina Valentina

    2016-01-01

    The FLES reconstruction and selection package consists of several modules: track finding, track fitting, short-lived particles finding, event building and event selection. The Cellular Automaton (CA track finder algorithm was adapted towards time-based reconstruction. In this article, we describe in detail the modification done to the algorithm, as well as the performance of the developed time-based CA approach.

  17. Retinal vessel detection and measurement for computer-aided medical diagnosis.

    Science.gov (United States)

    Li, Xiaokun; Wee, William G

    2014-02-01

    Since blood vessel detection and characteristic measurement for ocular retinal images is a fundamental problem in computer-aided medical diagnosis, automated algorithms/systems for vessel detection and measurement are always demanded. To support computer-aided diagnosis, an integrated approach/solution for vessel detection and diameter measurement is presented and validated. In the proposed approach, a Dempster-Shafer (D-S)-based edge detector is developed to obtain initial vessel edge information and an accurate vascular map for a retinal image. Then, the appropriate path and the centerline of a vessel of interest are identified automatically through graph search. Once the vessel path has been identified, the diameter of the vessel will be measured accordingly by the algorithm in real time. To achieve more accurate edge detection and diameter measurement, mixed Gaussian-matched filters are designed to refine the initial detection and measures. Other important medical indices of retinal vessels can also be calculated accordingly based on detection and measurement results. The efficiency of the proposed algorithm was validated by the retinal images obtained from different public databases. Experimental results show that the vessel detection rate of the algorithm is 100 % for large vessels and 89.9 % for small vessels, and the error rate on vessel diameter measurement is less than 5 %, which are all well within the acceptable range of deviation among the human graders.

  18. McGill algorithm for precipitation nowcasting by lagrangian extrapolation (MAPLE) applied to the South Korean radar network. Part I: Sensitivity studies of the Variational Echo Tracking (VET) technique

    Science.gov (United States)

    Bellon, Aldo; Zawadzki, Isztar; Kilambi, Alamelu; Lee, Hee Choon; Lee, Yong Hee; Lee, Gyuwon

    2010-08-01

    A Variational Echo Tracking (VET) technique has been applied to four months of archived data from the South Korean radar network in order to examine the influence of the various user-selectable parameters on the skill of the resulting 20-min to 4-h nowcasts. The latter are computed over a (512 × 512) array at 2-km resolution. After correcting the original algorithm to take into account the motion of precipitation across the boundaries of such a smaller radar network, we concluded that the set of default input parameters initially assumed is very close to the optimum combination. Decreasing to (5 sx 5) or increasing to (50 × 50) the default vector density of (25 × 25), using two or three maps for velocity determination, varying the relative weights for the constraints of conservation of reflectivity and of the smoothing of the velocity vectors, and finally the application of temporal smoothing all had only marginal effects on the skill of the forecasts. The relatively small sensitivity to significant variations of the VET default parameters is a direct consequence of the fact that the major source of the loss in forecast skill cannot be attributed to errors in the forecast motion, but to the unpredictable nature of the storm growth and decay. Changing the time interval between maps, from 20 to 10 minutes, and significantly increasing the reflectivity threshold from 15 to 30 dBZ had a more noticeable reduction on the forecast skill. Comparisons with the Eulerian "zero velocity" forecast and with a "single" vector forecast have also been performed in order to determine the accrued skill of the VET algorithm. Because of the extensive stratiform nature of the precipitation areas affecting the Korean peninsula, the increased skill is not as large as may have been anticipated. This can be explained by the greater extent of the precipitation systems relative to the size of the radar coverage domain.

  19. Algorithming the Algorithm

    DEFF Research Database (Denmark)

    Mahnke, Martina; Uprichard, Emma

    2014-01-01

    changes: it’s not the ocean, it’s the internet we’re talking about, and it’s not a TV show producer, but algorithms that constitute a sort of invisible wall. Building on this assumption, most research is trying to ‘tame the algorithmic tiger’. While this is a valuable and often inspiring approach, we...... would like to emphasize another side to the algorithmic everyday life. We argue that algorithms can instigate and facilitate imagination, creativity, and frivolity, while saying something that is simultaneously old and new, always almost repeating what was before but never quite returning. We show...... this by threading together stimulating quotes and screenshots from Google’s autocomplete algorithms. In doing so, we invite the reader to re-explore Google’s autocomplete algorithms in a creative, playful, and reflexive way, thereby rendering more visible some of the excitement and frivolity that comes from being...

  20. Algorithms Introduction to Algorithms

    Indian Academy of Sciences (India)

    Home; Journals; Resonance – Journal of Science Education; Volume 1; Issue 1. Algorithms Introduction to Algorithms. R K Shyamasundar. Series Article Volume 1 Issue 1 January 1996 pp 20-27. Fulltext. Click here to view fulltext PDF. Permanent link: http://www.ias.ac.in/article/fulltext/reso/001/01/0020-0027 ...

  1. Timber tracking

    DEFF Research Database (Denmark)

    Düdder, Boris; Ross, Omry

    2017-01-01

    Managing and verifying forest products in a value chain is often reliant on easily manipulated document or digital tracking methods - Chain of Custody Systems. We aim to create a new means of tracking timber by developing a tamper proof digital system based on Blockchain technology. Blockchain...

  2. 2013 Vessel Density

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — Automatic Identification Systems (AIS) are a navigation safety device that transmits and monitors the location and characteristics of many vessels in U.S. and...

  3. 2011 Passenger Vessel Density

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — Automatic Identification Systems (AIS) are a navigation safety device that transmits and monitors the location and characteristics of many vessels in U.S. and...

  4. 2011 Vessel Density

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — Automatic Identification Systems (AIS) are a navigation safety device that transmits and monitors the location and characteristics of many vessels in U.S. and...

  5. 2013 Passenger Vessel Density

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — Automatic Identification Systems (AIS) are a navigation safety device that transmits and monitors the location and characteristics of many vessels in U.S. and...

  6. 2013 Tanker Vessel Density

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — Automatic Identification Systems (AIS) are a navigation safety device that transmits and monitors the location and characteristics of many vessels in U.S. and...

  7. 2013 Cargo Vessel Density

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — Automatic Identification Systems (AIS) are a navigation safety device that transmits and monitors the location and characteristics of many vessels in U.S. and...

  8. High Performance Marine Vessels

    CERN Document Server

    Yun, Liang

    2012-01-01

    High Performance Marine Vessels (HPMVs) range from the Fast Ferries to the latest high speed Navy Craft, including competition power boats and hydroplanes, hydrofoils, hovercraft, catamarans and other multi-hull craft. High Performance Marine Vessels covers the main concepts of HPMVs and discusses historical background, design features, services that have been successful and not so successful, and some sample data of the range of HPMVs to date. Included is a comparison of all HPMVs craft and the differences between them and descriptions of performance (hydrodynamics and aerodynamics). Readers will find a comprehensive overview of the design, development and building of HPMVs. In summary, this book: Focuses on technology at the aero-marine interface Covers the full range of high performance marine vessel concepts Explains the historical development of various HPMVs Discusses ferries, racing and pleasure craft, as well as utility and military missions High Performance Marine Vessels is an ideal book for student...

  9. Cheboygan Vessel Base

    Data.gov (United States)

    Federal Laboratory Consortium — Cheboygan Vessel Base (CVB), located in Cheboygan, Michigan, is a field station of the USGS Great Lakes Science Center (GLSC). CVB was established by congressional...

  10. Maury Journals - US Vessels

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — U.S. vessels observations, after the 1853 Brussels Conference that set International Maritime Standards, modeled after Maury Marine Standard Observations.

  11. 2011 Cargo Vessel Density

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — Automatic Identification Systems (AIS) are a navigation safety device that transmits and monitors the location and characteristics of many vessels in U.S. and...

  12. 2011 Tanker Vessel Density

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — Automatic Identification Systems (AIS) are a navigation safety device that transmits and monitors the location and characteristics of many vessels in U.S. and...

  13. 2013 Fishing Vessel Density

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — Automatic Identification Systems (AIS) are a navigation safety device that transmits and monitors the location and characteristics of many vessels in U.S. and...

  14. Coastal Logbook Survey (Vessels)

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains catch (landed catch) and effort for fishing trips made by vessels that have been issued a Federal permit for the Gulf of Mexico reef fish,...

  15. Track-stitching using graphical models and message passing

    CSIR Research Space (South Africa)

    Van der Merwe, LJ

    2013-07-01

    Full Text Available track graph trellis (lattice) structure. This graph is then solved using a Viterbi data association algorithm. A Kalman filter is used to perform tracking, as well as in gating operations and in determining the track-to-track association probability...

  16. Model of passage of vessels through the waterway section forming the schedule in the course of its implementation

    Directory of Open Access Journals (Sweden)

    S. N. Plotnikov

    2017-01-01

    Full Text Available The model of passage of vessels through a section of the waterway is considered, which independently determines the order of passage of vessels with limited capacity of sections of the track. Such a model will consist of a number of standard algorithmic networks. When composing the schedule in the model, the following preference rules were used: first-come-first-served (that is, if the ship occupied the workplace, this decision is not canceled; The rule of the shortest operation; For the swamps the priority of vessels going downstream (the direction of flow from the source to the drain. An algorithmic network that implements the search for an acceptable schedule must implement the following for conflicting operations: the operation that has started is not interrupted; If several operations simultaneously claim for one workplace (port, reach and their number is greater than its throughput, then the conflict resolution is carried out in accordance with predefined preference rules or based on the user's decision; If the operation is waiting for the release of the workplace, it does not occupy the resource; The resource is returned immediately after the operation is completed. The considered design of algorithmic networks allows to resolve the conflict, with a simultaneous resource request, to take the resource once, remember that it was received and return it after the end of the operation, then the resource receives a contra-controlling operation for execution. However, the use of this design introduces redundancy into the model, even if it is used only for conflicting operations. The model is presented in the language of algorithmic networks and is implemented in the system of modeling automation KOGNITRON.

  17. LANL Robotic Vessel Scanning

    Energy Technology Data Exchange (ETDEWEB)

    Webber, Nels W. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

    2015-11-25

    Los Alamos National Laboratory in J-1 DARHT Operations Group uses 6ft spherical vessels to contain hazardous materials produced in a hydrodynamic experiment. These contaminated vessels must be analyzed by means of a worker entering the vessel to locate, measure, and document every penetration mark on the vessel. If the worker can be replaced by a highly automated robotic system with a high precision scanner, it will eliminate the risks to the worker and provide management with an accurate 3D model of the vessel presenting the existing damage with the flexibility to manipulate the model for better and more in-depth assessment.The project was successful in meeting the primary goal of installing an automated system which scanned a 6ft vessel with an elapsed time of 45 minutes. This robotic system reduces the total time for the original scope of work by 75 minutes and results in excellent data accumulation and transmission to the 3D model imaging program.

  18. Extending Track Analysis from Animals in the Lab to Moving Objects Anywhere

    NARCIS (Netherlands)

    Dommelen, W. van; Laar, P.J.L.J. van de; Noldus, L.P.J.J.

    2013-01-01

    In this chapter we compare two application domains in which the tracking of objects and the analysis of their movements are core activities, viz. animal tracking and vessel tracking. More specifically, we investigate whether EthoVision XT, a research tool for video tracking and analysis of the

  19. The new Passive microwave Neural network Precipitation Retrieval (PNPR algorithm for the cross-track scanning ATMS radiometer: description and verification study over Europe and Africa using GPM and TRMM spaceborne radars

    Directory of Open Access Journals (Sweden)

    P. Sanò

    2016-11-01

    Full Text Available The objective of this paper is to describe the development and evaluate the performance of a completely new version of the Passive microwave Neural network Precipitation Retrieval (PNPR v2, an algorithm based on a neural network approach, designed to retrieve the instantaneous surface precipitation rate using the cross-track Advanced Technology Microwave Sounder (ATMS radiometer measurements. This algorithm, developed within the EUMETSAT H-SAF program, represents an evolution of the previous version (PNPR v1, developed for AMSU/MHS radiometers (and used and distributed operationally within H-SAF, with improvements aimed at exploiting the new precipitation-sensing capabilities of ATMS with respect to AMSU/MHS. In the design of the neural network the new ATMS channels compared to AMSU/MHS, and their combinations, including the brightness temperature differences in the water vapor absorption band, around 183 GHz, are considered. The algorithm is based on a single neural network, for all types of surface background, trained using a large database based on 94 cloud-resolving model simulations over the European and the African areas. The performance of PNPR v2 has been evaluated through an intercomparison of the instantaneous precipitation estimates with co-located estimates from the TRMM Precipitation Radar (TRMM-PR and from the GPM Core Observatory Ku-band Precipitation Radar (GPM-KuPR. In the comparison with TRMM-PR, over the African area the statistical analysis was carried out for a 2-year (2013–2014 dataset of coincident observations over a regular grid at 0.5°  ×  0.5° resolution. The results have shown a good agreement between PNPR v2 and TRMM-PR for the different surface types. The correlation coefficient (CC was equal to 0.69 over ocean and 0.71 over vegetated land (lower values were obtained over arid land and coast, and the root mean squared error (RMSE was equal to 1.30 mm h−1 over ocean and 1.11 mm h−1 over

  20. Application of a Strong Tracking Finite-Difference Extended Kalman Filter to Eye Tracking

    OpenAIRE

    Zhang, Zutao; Zhang, Jiashu

    2010-01-01

    This paper proposes a new eye tracking method using strong finite-difference Kalman filter. Firstly, strong tracking factor is introduced to modify priori covariance matrix to improve the accuracy of the eye tracking algorithm. Secondly, the finite-difference method is proposed to replace partial derivatives of nonlinear functions to eye tracking. From above deduction, the new strong finite-difference Kalman filter becomes very simple because of replacing partial derivatives calculation using...

  1. Data Association Algorithms for Tracking Satellites

    Science.gov (United States)

    2013-03-27

    Geo- physical Research: Solid Earth, Vol. 107, No. B4, April 2002, pp. ETG 3–1–ETG 3.26. [23] Buffett, B. A., Mathews, P. M., and Herring, T. A...Methodology for the combination of sub-daily Earth rotation from GPS and BLBI observations,” Journal of Geodesy , Vol. 86, No. 3, March 2012, pp. 221–239

  2. Tracking FEMA

    OpenAIRE

    Leskanic, Tyler; Kays, Kevin; Maier, Emily; Cannon, Seth

    2015-01-01

    The zip archive attached to this project is the compressed TrackingFEMA Git repository. It contains the CMS (RefineryCMS - Rails), processing scripts, as well as visualization sample code. The processing scripts are in a folder called TrackingFEMAProcessing. The visualizations are contained in Visualization. The rest of the rails files are contained within the usual Ruby on Rails file system structure. The finished product is a website visualizing the efforts of disaster response organizat...

  3. Tracking Deforming Objects using Particle Filtering for Geometric Active Contours

    National Research Council Canada - National Science Library

    Rathi, Yogesh; Vaswani, Namrata; Tannenbaum, Allen; Yezzi, Anthony

    2007-01-01

    .... Tracking algorithms using Kalman filters or particle filters have been proposed for finite dimensional representations of shape, but these are dependent on the chosen parametrization and cannot...

  4. Enhancing supply vessel safety

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    2002-07-01

    A supply-vessel bridge installation consists of a navigating bridge and a control position aft, from which operators control the ship when close to rigs or platforms, and operate winches and other loading equipment. The international Convention for Safety of I Ale at Sea (SOLAS) does not regulate the layout, so design varies to a large degree, often causing an imperfect working environment. As for other types of ships, more than half the offshore service vessel accidents at sea are caused by bridge system failures. A majority can be traced back to technical design, and operational errors. The research and development project NAUT-OSV is a response to the offshore industry's safety concerns. Analysis of 24 incidents involving contact or collision between supply vessels and offshore installations owned or operated by Norwegian companies indicated that failures in the bridge system were often the cause.

  5. Bayesian approach to avoiding track seduction

    Science.gov (United States)

    Salmond, David J.; Everett, Nicholas O.

    2002-08-01

    The problem of maintaining track on a primary target in the presence spurious objects is addressed. Recursive and batch filtering approaches are developed. For the recursive approach, a Bayesian track splitting filter is derived which spawns candidate tracks if there is a possibility of measurement misassociation. The filter evaluates the probability of each candidate track being associated with the primary target. The batch filter is a Markov-chain Monte Carlo (MCMC) algorithm which fits the observed data sequence to models of target dynamics and measurement-track association. Simulation results are presented.

  6. VeloTT tracking for LHCb Run II

    CERN Document Server

    Bowen, Espen Eie; Tresch, Marco

    2016-01-01

    This note describes track reconstruction in the LHCb tracking system upstream of the magnet, combining VELO tracks with hits in the TT sub-detector. The implementation of the VeloTT algorithm and its performance in terms of track reconstruction efficiency, ghost rate and execution time are presented. The algorithm has been rewritten for use in the first software trigger level for LHCb Run II. The momentum and charge information obtained for the VeloTT tracks (due to a fringe magnetic field between the VELO and TT sub-detectors) can reduce the total execution time for the full tracking sequence.

  7. GOLD PRESSURE VESSEL SEAL

    Science.gov (United States)

    Smith, A.E.

    1963-11-26

    An improved seal between the piston and die member of a piston-cylinder type pressure vessel is presented. A layer of gold, of sufficient thickness to provide an interference fit between the piston and die member, is plated on the contacting surface of at least one of the members. (AEC)

  8. Network of endocardial vessels.

    Science.gov (United States)

    Lee, Byung-Cheon; Kim, Hong Bae; Sung, Baeckkyoung; Kim, Ki Woo; Sohn, Jamin; Son, Boram; Chang, Byung-Joon; Soh, Kwang-Sup

    2011-01-01

    Although there have been reports on threadlike structures inside the heart, they have received little attention. We aimed to develop a method for observing such structures and to reveal their ultrastructures. An in situ staining method, which uses a series of procedures of 0.2-0.4% trypan blue spraying and washing, was applied to observe threadlike structures on the surfaces of endocardia. The threadlike structures were isolated and observed by using confocal laser scanning microscopy (CLSM) and transmission electron microscopy (TEM). Networks of endocardial vessels (20 μm in thickness) with expansions (40-100 μm in diameter) were visualized; they were movable on the endocardium of the bovine atrium and ventricle. CLSM showed that (1) rod-shaped nuclei were aligned along the longitudinal direction of the endocardial vessel and (2) there were many cells inside the expansion. TEM on the endocardial vessel revealed that (1) there existed multiple lumens (1-7 μm in diameter) and (2) the extracellular matrices mostly consisted of collagen fibers, which were aligned along the longitudinal direction of the endocardial vessel or were locally organized in reticular structures. We investigated the endocardial circulatory system in bovine cardiac chambers and its ultrastructures, such as nucleic distributions, microlumens, and collagenous extracellular matrices. Copyright © 2011 S. Karger AG, Basel.

  9. Pressurized Vessel Slurry Pumping

    Energy Technology Data Exchange (ETDEWEB)

    Pound, C.R.

    2001-09-17

    This report summarizes testing of an alternate ''pressurized vessel slurry pumping'' apparatus. The principle is similar to rural domestic water systems and ''acid eggs'' used in chemical laboratories in that material is extruded by displacement with compressed air.

  10. Group Targets Tracking Using Multiple Models GGIW-CPHD Based on Best-Fitting Gaussian Approximation and Strong Tracking Filter

    Directory of Open Access Journals (Sweden)

    Yun Wang

    2016-01-01

    Full Text Available Gamma Gaussian inverse Wishart cardinalized probability hypothesis density (GGIW-CPHD algorithm was always used to track group targets in the presence of cluttered measurements and missing detections. A multiple models GGIW-CPHD algorithm based on best-fitting Gaussian approximation method (BFG and strong tracking filter (STF is proposed aiming at the defect that the tracking error of GGIW-CPHD algorithm will increase when the group targets are maneuvering. The best-fitting Gaussian approximation method is proposed to implement the fusion of multiple models using the strong tracking filter to correct the predicted covariance matrix of the GGIW component. The corresponding likelihood functions are deduced to update the probability of multiple tracking models. From the simulation results we can see that the proposed tracking algorithm MM-GGIW-CPHD can effectively deal with the combination/spawning of groups and the tracking error of group targets in the maneuvering stage is decreased.

  11. Identifying Tracks Duplicates via Neural Network

    CERN Document Server

    Sunjerga, Antonio; CERN. Geneva. EP Department

    2017-01-01

    The goal of the project is to study feasibility of state of the art machine learning techniques in track reconstruction. Machine learning techniques provide promising ways to speed up the pattern recognition of tracks by adding more intelligence in the algorithms. Implementation of neural network to process of track duplicates identifying will be discussed. Different approaches are shown and results are compared to method that is currently in use.

  12. Research on Agricultural Surveillance Video of Intelligent Tracking

    Science.gov (United States)

    Cai, Lecai; Xu, Jijia; Liangping, Jin; He, Zhiyong

    Intelligent video tracking technology is the digital video processing and analysis of an important field of application in the civilian and military defense have a wide range of applications. In this paper, a systematic study on the surveillance video of the Smart in the agricultural tracking, particularly in target detection and tracking problem of the study, respectively for the static background of the video sequences of moving targets detection and tracking algorithm, the goal of agricultural production for rapid detection and tracking algorithm and Mean Shift-based translation and rotation of the target tracking algorithm. Experimental results show that the system can effectively and accurately track the target in the surveillance video. Therefore, in agriculture for the intelligent video surveillance tracking study, whether it is from the environmental protection or social security, economic efficiency point of view, are very meaningful.

  13. New track finding based on cellar automaton for AMS-02 detector

    Science.gov (United States)

    Qu, Zhaoyi; Haino, Sadakazu; Zuccon, Paolo; Zhao, Minggang

    2017-10-01

    We present a new track reconstruction algorithm based on cellular automaton for AMS-02 experiment. This algorithm has already become one of the standard method in AMS-02 Monte Carlo simulation and data production. The performance of new track finding is shown in terms of CPU time, track efficiency, fake rate and charge confusion. With the new track finding algorithm, track reconstruction efficiency of 99% is achieved for both electron Monte Carlo simulation and ISS data. A comparison of new track finding and previous track finding for nuclei and γ event sample is shown as well.

  14. Tracking Information

    NARCIS (Netherlands)

    van Benthem, J.; Bimbó, K.

    2016-01-01

    Depending on a relevant task at hand, information can be represented at different levels, less or more detailed, each supporting its own appropriate logical languages. We discuss a few of these levels and their connections, and investigate when and how information growth at one level can be tracked

  15. NucliTrack: an integrated nuclei tracking application.

    Science.gov (United States)

    Cooper, Sam; Barr, Alexis R; Glen, Robert; Bakal, Chris

    2017-10-15

    Live imaging studies give unparalleled insight into dynamic single cell behaviours and fate decisions. However, the challenge of reliably tracking single cells over long periods of time limits both the throughput and ease with which such studies can be performed. Here, we present NucliTrack, a cross platform solution for automatically segmenting, tracking and extracting features from fluorescently labelled nuclei. NucliTrack performs similarly to other state-of-the-art cell tracking algorithms, but NucliTrack's interactive, graphical interface makes it significantly more user friendly. NucliTrack is available as a free, cross platform application and open source Python package. Installation details and documentation are at: http://nuclitrack.readthedocs.io/en/latest/ A video guide can be viewed online: https://www.youtube.com/watch?v=J6e0D9F-qSU Source code is available through Github: https://github.com/samocooper/nuclitrack. A Matlab toolbox is also available at: https://uk.mathworks.com/matlabcentral/fileexchange/61479-samocooper-nuclitrack-matlab. sam@socooper.com. Supplementary data are available at Bioinformatics online.

  16. Hawaii Abandoned Vessel Inventory, Kauai

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — NOAA Abandoned Vessel Project Data for Kauai. Abandoned vessels pose a significant threat to the NOAA Trust resources through physical destruction of coral habitats...

  17. CNMI Abandoned Vessel Inventory, Tinian

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — NOAA Abandoned Vessel Project Data for Tinian. Abandoned vessels pose a significant threat to the NOAA Trust resources through physical destruction of coral habitats...

  18. Puerto Rico Abandoned Vessel Inventory

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — NOAA Abandoned Vessel Project Data for Puerto Rico. Abandoned vessels pose a significant threat to the NOAA Trust resources through physical destruction of coral...

  19. American Samoa Abandoned Vessel Inventory

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — NOAA Abandoned Vessel Project Data for American Samoa. Abandoned vessels pose a significant threat to the NOAA Trust resources through physical destruction of coral...

  20. Hawaii Abandoned Vessel Inventory, Oahu

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — NOAA Abandoned Vessel Project Data for Oahu, Hawaii. Abandoned vessels pose a significant threat to the NOAA Trust resources through physical destruction of coral...

  1. Hawaii Abandoned Vessel Inventory, Molokai

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — NOAA Abandoned Vessel Project Data for Molokai, Hawaii. Abandoned vessels pose a significant threat to the NOAA Trust resources through physical destruction of coral...

  2. CNMI Abandoned Vessel Inventory, Rota

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — NOAA Abandoned Vessel Project Data for Rota. Abandoned vessels pose a significant threat to the NOAA Trust resources through physical destruction of coral habitats...

  3. Hawaii Abandoned Vessel Inventory, Lanai

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — NOAA Abandoned Vessel Project Data for Lanai. Abandoned vessels pose a significant threat to the NOAA Trust resources through physical destruction of coral habitats...

  4. For-Hire Vessel Directory

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — The Vessel Directory is maintained as the sample frame for the For-Hire Survey. I contains data on for-hire vessels on the Atlantic and Gulf coasts. Data include...

  5. CNMI Abandoned Vessel Inventory, Saipan

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — NOAA Abandoned Vessel Project Data for Saipan. Abandoned vessels pose a significant threat to the NOAA Trust resources through physical destruction of coral habitats...

  6. Hawaii Abandoned Vessel Inventory, Maui

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — NOAA Abandoned Vessel Project Data for Maui. Abandoned vessels pose a significant threat to the NOAA Trust resources through physical destruction of coral habitats...

  7. Vessels in Transit - Web Tool

    Data.gov (United States)

    Department of Transportation — A web tool that provides real-time information on vessels transiting the Saint Lawrence Seaway. Visitors may sort by order of turn, vessel name, or last location in...

  8. Pressure vessel design manual

    Energy Technology Data Exchange (ETDEWEB)

    Moss, D.R.

    1987-01-01

    The first section of the book covers types of loadings, failures, and stress theories, and how they apply to pressure vessels. The book delineates the procedures for designing typical components as well as those for designing large openings in cylindrical shells, ring girders, davits, platforms, bins and elevated tanks. The techniques for designing conical transitions, cone-cylinder intersections, intermediate heads, flat heads, and spherically dished covers are also described. The book covers the design of vessel supports subject to wind and seismic loads and one section is devoted to the five major ways of analyzing loads on shells and heads. Each procedure is detailed enough to size all welds, bolts, and plate thicknesses and to determine actual stresses.

  9. New research vessels

    Science.gov (United States)

    1984-04-01

    Two “new” ocean-going research vessels operated by the Scripps Institution of Oceanography and the National Science Foundation (NSF) will soon begin full-time scientific duties off the coast of California and in the Antarctic, respectively. The 37.5-m Scripps vessel, named Robert Gordon Sprout in honor of the ex-president of the University of California, replaces the smaller ship Ellen B. Scripps, which had served the institution since 1965. The new ship is a slightly modified Gulf Coast workboat. Under the name of Midnight Alaskan, it had been used for high-resolution geophysical surveys in American and Latin American waters by such firms as Arco Oil & Gas, Exxon, Pennzoil, and Racal-Decca before its purchase by Scripps from a Lousiana chartering firm last summer.

  10. Vessel-guided airway tree segmentation

    DEFF Research Database (Denmark)

    Lo, Pechin Chien Pau; Sporring, Jon; Ashraf, Haseem

    2010-01-01

    method is evaluated on 250 low dose computed tomography images from a lung cancer screening trial. Our experiments showed that applying the region growing algorithm on the airway appearance model produces more complete airway segmentations, leading to on average 20% longer trees, and 50% less leakage......This paper presents a method for airway tree segmentation that uses a combination of a trained airway appearance model, vessel and airway orientation information, and region growing. We propose a voxel classification approach for the appearance model, which uses a classifier that is trained...... to differentiate between airway and non-airway voxels. This is in contrast to previous works that use either intensity alone or hand crafted models of airway appearance. We show that the appearance model can be trained with a set of easily acquired, incomplete, airway tree segmentations. A vessel orientation...

  11. Detection of Blood Vessels in Color Fundus Images using a Local Radon Transform

    Directory of Open Access Journals (Sweden)

    Reza Pourreza

    2010-09-01

    Full Text Available Introduction: This paper addresses a method for automatic detection of blood vessels in color fundus images which utilizes two main tools: image partitioning and local Radon transform. Material and Methods: The input images are firstly divided into overlapping windows and then the Radon transform is applied to each. The maximum of the Radon transform in each window corresponds to the probable available sub-vessel. To verify the detected sub-vessel, the maximum is compared with a predefined threshold. The verified sub-vessels are reconstructed using the Radon transform information. All detected and reconstructed sub-vessels are finally combined to make the final vessel tree. Results: The algorithm’s performance was evaluated numerically by applying it to 40 images of DRIVE database, a standard retinal image database. The vessels were extracted manually by two physicians. This database was used to test and compare the available and proposed algorithms for vessel detection in color fundus images. By comparing the output of the algorithm with the manual results, the two parameters TPR and FPR were calculated for each image and the average of TPRs and FPRs were used to plot the ROC curve. Discussion and Conclusion: Comparison of the ROC curve of this algorithm with other algorithms demonstrated the high achieved accuracy. Beside the high accuracy, the Radon transform which is integral-based makes the algorithm robust against noise.

  12. Large vessel vasculitides

    OpenAIRE

    Morović-Vergles, Jadranka; Pukšić, Silva; Gudelj Gračanin, Ana

    2013-01-01

    Large vessel vasculitis includes Giant cell arteritis and Takayasu arteritis. Giant cell arteritis is the most common form of vasculitis affect patients aged 50 years or over. The diagnosis should be considered in older patients who present with new onset of headache, visual disturbance, polymyalgia rheumatica and/or fever unknown cause. Glucocorticoides remain the cornerstone of therapy. Takayasu arteritis is a chronic panarteritis of the aorta ant its major branches presenting commonly in y...

  13. Very Versatile Vessel

    Science.gov (United States)

    2009-09-01

    data. This source provides information on aluminum hydrofoil vessels without the added weight of foil structures. The composite armor around the...seating compartment. The sides should also limit wave splash on the deck. The freeboard should contribute reserve buoyancy , increasing large-angle and...Resistance, Powering, and Propulsion Savitsky’s Method Since model testing data or other reliable performance data was unavailable for the proposed

  14. RF Emitter Tracking and Intent Assessment

    Science.gov (United States)

    2013-03-21

    remained in the same cell, as the next time-stamp was accessed. 37 A segment of MATLAB® code is included to illustrate how the dwell algorithm was...6 AOA Angle of Arrival . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 DOA ...using wireless sensors and an estimation algorithm . These position tracks were to be employed as training data for the intent assessment system

  15. Tracking correction for portable coal inventory instrument

    Science.gov (United States)

    Yang, Deshan; Dong, Lili; Liang, Qianqian; Zhang, Wang; Xu, Wenhai

    2017-03-01

    In the process of measuring the tracking of portable coal inventory instrument, the location accuracy is reduced and the tracking is broken due to float solution of RTK. A tracking correction method based on RTK localization data is proposed. First, the location data of the float solution is filtered by the median filtering algorithm, which reduces the location err and dispersion of the float solution. Then the forward and inverse position estimation is performed by using the fixed solution data before and after the track breakage. The filtering of the float solution positioning data for translation and rotation, make the first point and the end point coincidence with the point estimated. Complete measurement track stitching. In the actual coal inventory experiment, the measurement error is improved from 12.6% to 0.79% after tracking corrected. By using this method we can effectively solve the tracking deviation of actual measurement of coal, improve the portable coal inventory instrument measuring accuracy and adaptability.

  16. Photovoltaic Cells Mppt Algorithm and Design of Controller Monitoring System

    Science.gov (United States)

    Meng, X. Z.; Feng, H. B.

    2017-10-01

    This paper combined the advantages of each maximum power point tracking (MPPT) algorithm, put forward a kind of algorithm with higher speed and higher precision, based on this algorithm designed a maximum power point tracking controller with ARM. The controller, communication technology and PC software formed a control system. Results of the simulation and experiment showed that the process of maximum power tracking was effective, and the system was stable.

  17. Study of Track Reconstruction for DAMPE

    Science.gov (United States)

    Lu, Tong-suo; Lei, Shi-jun; Zang, Jing-jing; Chang, Jin; Wu, Jian

    2017-07-01

    The Dark Matter Particle Explorer (DAMPE) is aimed to study the existence and distribution of dark matter via the observation of high-energy particles in space with a large energy bandwidth, high energy resolution, and high spatial resolution. The track reconstruction is to restore the positions and angles of the incident particles using the multiple observations of different channels at different positions, and its accuracy determines the angular resolution of the explorer. The track reconstruction is mainly based on the observations of two sub-detectors, namely, the Silicon Tracker (STK) and the BGO (Bi4Ge3O12) calorimeter. In accordance with the design and structure of the two sub-detectors, and using the data collected during the beam tests and ground tests of cosmic rays, we discuss in detail the method of track reconstruction for the DAMPE, which includes mainly three basic procedures: the selection of track hits, the fitting of track hits, and the judgement of the optimal track. Since an energetic particle most probably leaves multiple hits in different layers of the STK and BGO crystals, we first provide a method to obtain a rough track in the BGO calorimeter by the centroid method, and hereby to constrain the track hits in the STK. Then for the selected one group of possible track hits in the STK, we apply two different algorithms, the Kalman filter and the least square linear fitting, to fit these track hits. The consistency of the results obtained independently via the two algorithms confirms the validity of our track reconstruction results. Finally, several criteria for picking out the most possible track among all the tracks found in the reconstruction by combining the results of the BGO calorimeter and STK are discussed. Using the track reconstruction method proposed in this article and the beam test data, we confirm that the angular resolution of the DAMPE satisfies its design requirement.

  18. Compression-tracking photoacoustic perfusion and microvascular pressure measurements

    Science.gov (United States)

    Choi, Min; Zemp, Roger

    2017-03-01

    We propose a method to measure blood pressure of small vessels non-invasively and in-vivo: by combining PA imaging with compression US. Using this method, we have shown pressure-lumen area tracking, as well as estimation of the internal vessel pressure, located 2 mm deep in tissue. Additionally, reperfusion can be tracked by measuring the total PA signal within a region of interest (ROI) after compression has been released. The ROI is updated using cross-correlation based displacement tracking1. The change in subcutaneous perfusion rates can be seen when the temperature of the hand of a human subject drops below the normal.

  19. Algorithm design

    CERN Document Server

    Kleinberg, Jon

    2006-01-01

    Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches students a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.

  20. Genetic algorithms

    Science.gov (United States)

    Wang, Lui; Bayer, Steven E.

    1991-01-01

    Genetic algorithms are mathematical, highly parallel, adaptive search procedures (i.e., problem solving methods) based loosely on the processes of natural genetics and Darwinian survival of the fittest. Basic genetic algorithms concepts are introduced, genetic algorithm applications are introduced, and results are presented from a project to develop a software tool that will enable the widespread use of genetic algorithm technology.

  1. Track finding using GPUs

    CERN Document Server

    Schmitt, C; The ATLAS collaboration

    2011-01-01

    Track finding using GPUs The reconstruction and simulation of collision events is a major task in modern HEP experiments involving several ten thousands of standard CPUs. On the other hand the graphics processors (GPUs) have become much more powerful and are by far outperforming the standard CPUs in terms of floating point operations due to their massive parallel approach. The usage of these GPUs could therefore significantly reduce the overall reconstruction time per event or allow for the usage of more sophisticated algorithms. In this contribution the track finding in the ATLAS experiment will be used as an example on how the GPUs can be used in this context: the seed finding alone shows already a speed increase of one order of magnitude compared to the same implementation on a standard CPU. On the other hand the implementation on the GPU requires a change in the algorithmic flow to allow the code to work in the rather limited environment on the GPU in terms of memory, cache, and transfer speed from and to...

  2. Doppler tracking

    Science.gov (United States)

    Thomas, Christopher Jacob

    This study addresses the development of a methodology using the Doppler Effect for high-resolution, short-range tracking of small projectiles and vehicles. Minimal impact on the design of the moving object is achieved by incorporating only a transmitter in it and using ground stations for all other components. This is particularly useful for tracking objects such as sports balls that have configurations and materials that are not conducive to housing onboard instrumentation. The methodology developed here uses four or more receivers to monitor a constant frequency signal emitted by the object. Efficient and accurate schemes for filtering the raw signals, determining the instantaneous frequencies, time synching the frequencies from each receiver, smoothing the synced frequencies, determining the relative velocity and radius of the object and solving the nonlinear system of equations for object position in three dimensions as a function of time are developed and described here.

  3. Model-Based Real-Time Head Tracking

    Directory of Open Access Journals (Sweden)

    Ström Jacob

    2002-01-01

    Full Text Available This paper treats real-time tracking of a human head using an analysis by synthesis approach. The work is based on the Structure from Motion (SfM algorithm from Azarbayejani and Pentland (1995. We will analyze the convergence properties of the SfM algorithm for planar objects, and extend it to handle new points. The extended algorithm is then used for head tracking. The system tracks feature points in the image using a texture mapped three-dimensional model of the head. The texture is updated adaptively so that points in the ear region can be tracked when the user′s head is rotated far, allowing out-of-plane rotation of up to without losing track. The covariance of the - and the -coordinates are estimated and forwarded to the Kalman filter, making the tracker robust to occlusion. The system automatically detects tracking failure and reinitializes the algorithm using information gathered in the original initialization process.

  4. Tracking Porters

    DEFF Research Database (Denmark)

    Bruun, Maja Hojer; Krause-Jensen, Jakob; Saltofte, Margit

    2015-01-01

    Anthropology attempts to gain insight into people's experiential life-worlds through long-term fieldwork. The quality of anthropological knowledge production, however, does not depend solely on the duration of the stay in the field, but also on a particular way of seeing social situations. The an...... the students followed the work of a group of porters. Drawing on anthropological concepts and research strategies the students gained crucial insights about the potential effects of using tracking technologies in the hospital....

  5. A Measure of Similarity Between Trajectories of Vessels

    Directory of Open Access Journals (Sweden)

    Le QI

    2016-03-01

    Full Text Available The measurement of similarity between trajectories of vessels is one of the kernel problems that must be addressed to promote the development of maritime intelligent traffic system (ITS. In this study, a new model of trajectory similarity measurement was established to improve the data processing efficiency in dynamic application and to reflect actual sailing behaviors of vessels. In this model, a feature point detection algorithm was proposed to extract feature points, reduce data storage space and save computational resources. A new synthesized distance algorithm was also created to measure the similarity between trajectories by using the extracted feature points. An experiment was conducted to measure the similarity between the real trajectories of vessels. The growth of these trajectories required measurements to be conducted under different voyages. The results show that the similarity measurement between the vessel trajectories is efficient and correct. Comparison of the synthesized distance with the sailing behaviors of vessels proves that results are consistent with actual situations. The experiment results demonstrate the promising application of the proposed model in studying vessel traffic and in supplying reliable data for the development of maritime ITS.

  6. Retinal vessel centerline extraction using multiscale matched filters, confidence and edge measures.

    Science.gov (United States)

    Sofka, Michal; Stewart, Charles V

    2006-12-01

    Motivated by the goals of improving detection of low-contrast and narrow vessels and eliminating false detections at nonvascular structures, a new technique is presented for extracting vessels in retinal images. The core of the technique is a new likelihood ratio test that combines matched-filter responses, confidence measures and vessel boundary measures. Matched filter responses are derived in scale-space to extract vessels of widely varying widths. A vessel confidence measure is defined as a projection of a vector formed from a normalized pixel neighborhood onto a normalized ideal vessel profile. Vessel boundary measures and associated confidences are computed at potential vessel boundaries. Combined, these responses form a six-dimensional measurement vector at each pixel. A training technique is used to develop a mapping of this vector to a likelihood ratio that measures the "vesselness" at each pixel. Results comparing this vesselness measure to matched filters alone and to measures based on the Hessian of intensities show substantial improvements, both qualitatively and quantitatively. The Hessian can be used in place of the matched filter to obtain similar but less-substantial improvements or to steer the matched filter by preselecting kernel orientations. Finally, the new vesselness likelihood ratio is embedded into a vessel tracing framework, resulting in an efficient and effective vessel centerline extraction algorithm.

  7. Apparatus and method for tracking a molecule or particle in three dimensions

    Science.gov (United States)

    Werner, James H [Los Alamos, NM; Goodwin, Peter M [Los Alamos, NM; Lessard, Guillaume [Santa Fe, NM

    2009-03-03

    An apparatus and method were used to track the movement of fluorescent particles in three dimensions. Control software was used with the apparatus to implement a tracking algorithm for tracking the motion of the individual particles in glycerol/water mixtures. Monte Carlo simulations suggest that the tracking algorithms in combination with the apparatus may be used for tracking the motion of single fluorescent or fluorescently labeled biomolecules in three dimensions.

  8. Lagrangian displacement tracking using a polar grid between endocardial and epicardial contours for cardiac strain imaging.

    Science.gov (United States)

    Ma, Chi; Varghese, Tomy

    2012-04-01

    Accurate cardiac deformation analysis for cardiac displacement and strain imaging over time requires Lagrangian description of deformation of myocardial tissue structures. Failure to couple the estimated displacement and strain information with the correct myocardial tissue structures will lead to erroneous result in the displacement and strain distribution over time. Lagrangian based tracking in this paper divides the tissue structure into a fixed number of pixels whose deformation is tracked over the cardiac cycle. An algorithm that utilizes a polar-grid generated between the estimated endocardial and epicardial contours for cardiac short axis images is proposed to ensure Lagrangian description of the pixels. Displacement estimates from consecutive radiofrequency frames were then mapped onto the polar grid to obtain a distribution of the actual displacement that is mapped to the polar grid over time. A finite element based canine heart model coupled with an ultrasound simulation program was used to verify this approach. Segmental analysis of the accumulated displacement and strain over a cardiac cycle demonstrate excellent agreement between the ideal result obtained directly from the finite element model and our Lagrangian approach to strain estimation. Traditional Eulerian based estimation results, on the other hand, show significant deviation from the ideal result. An in vivo comparison of the displacement and strain estimated using parasternal short axis views is also presented. Lagrangian displacement tracking using a polar grid provides accurate tracking of myocardial deformation demonstrated using both finite element and in vivo radiofrequency data acquired on a volunteer. In addition to the cardiac application, this approach can also be utilized for transverse scans of arteries, where a polar grid can be generated between the contours delineating the outer and inner wall of the vessels from the blood flowing though the vessel.

  9. Sea State Estimation Using Vessel Response in Dynamic Positioning

    DEFF Research Database (Denmark)

    H. Brodtkorb, Astrid; Nielsen, Ulrik Dam; J. Sørensen, Asgeir

    2017-01-01

    This paper presents a novel method for estimating the sea state parameters based on the heave, roll and pitch response of a vessel in dynamic positioning (DP), i.e., without forward speed. The algorithm finds the wave spectrum estimate from the response measurements by directly solving a set...

  10. Markerless 3D Face Tracking

    DEFF Research Database (Denmark)

    Walder, Christian; Breidt, Martin; Bulthoff, Heinrich

    2009-01-01

    We present a novel algorithm for the markerless tracking of deforming surfaces such as faces. We acquire a sequence of 3D scans along with color images at 40Hz. The data is then represented by implicit surface and color functions, using a novel partition-of-unity type method of efficiently...... the scanned surface, using the variation of both shape and color as features in a dynamic energy minimization problem. Our prototype system yields high-quality animated 3D models in correspondence, at a rate of approximately twenty seconds per timestep. Tracking results for faces and other objects...

  11. Vessel Traffic Services.

    Science.gov (United States)

    1982-12-01

    Yorker" articles titled Silent Spring by Rachel Carson in 1963 produced a unifying effect, "the sort of rallying point of the movement to protect the...6232, 92d Cong., 1st. sess., 1971, p. 2. 15. Carson , Rachel L. , The Sea Around Us, New York: Oxford Univesity Press, 195-, p. IV. 16. U.S., Congress...Government Printing Office, 1974. 63. Buhler, L. and Geiger, J., Vessel Traffic Data Extraction MethodoloqX, Silver Spring , Maryland, O6erFae-tns

  12. Vanishing corneal vessels

    Science.gov (United States)

    Nicholson, Luke; Chana, Rupinder

    2013-01-01

    We wish to highlight the importance of acknowledging the accompanying effects of topical phenylephrine drops on the eye other than its intended mydriasis. We reported a case of a 92-year-old woman with a corneal graft who was noted to have superficial corneal vascularisation which was not documented previously. After the instillation of topical tropicamide 1% and phenylephrine 2.5%, for funduscopy, the corneal vascularisation was not visible. When reassessed on another visit, tropicamide had no effect on the vessels and only phenylephrine did. We wish to highlight that when reviewing patients in cornea clinics, instilling phenylephrine prior to being seen may mask important corneal vascularisation. PMID:24121816

  13. Histological evaluation and optimization of surgical vessel sealing systems

    Science.gov (United States)

    Lathrop, Robert; Ryan, Thomas; Gaspredes, Jonathan; Woloszko, Jean; Coad, James E.

    2017-02-01

    Surgical vessel sealing systems are widely used to achieve hemostasis and dissection in open surgery and minimally invasive, laparoscopic surgery. This enabling technology was developed about 17 years ago and continues to evolve with new devices and systems achieving improved outcomes. Histopathological assessment of thermally sealed tissues is a valuable tool for refining and comparing performance among surgical vessel sealing systems. Early work in this field typically assessed seal time, burst rate, and failure rate (in-situ). Later work compared histological staining methods with birefringence to assess the extent of thermal damage to tissues adjacent to the device. Understanding the microscopic architecture of a sealed vessel is crucial to optimizing the performance of power delivery algorithms and device design parameters. Manufacturers rely on these techniques to develop new products. A system for histopathological evaluation of vessels and sealing performance was established, to enable the direct assessment of a treatment's tissue effects. The parameters included the commonly used seal time, pressure burst rate and failure rate, as well as extensions of the assessment to include its likelihood to form steam vacuoles, adjacent thermal effect near the device, and extent of thermally affected tissue extruded back into the vessel lumen. This comprehensive assessment method provides an improved means of assessing the quality of a sealed vessel and understanding the exact mechanisms which create an optimally sealed vessel.

  14. Algorithmic cryptanalysis

    CERN Document Server

    Joux, Antoine

    2009-01-01

    Illustrating the power of algorithms, Algorithmic Cryptanalysis describes algorithmic methods with cryptographically relevant examples. Focusing on both private- and public-key cryptographic algorithms, it presents each algorithm either as a textual description, in pseudo-code, or in a C code program.Divided into three parts, the book begins with a short introduction to cryptography and a background chapter on elementary number theory and algebra. It then moves on to algorithms, with each chapter in this section dedicated to a single topic and often illustrated with simple cryptographic applic

  15. 46 CFR 289.2 - Vessels included.

    Science.gov (United States)

    2010-10-01

    ... CONSTRUCTION-DIFFERENTIAL SUBSIDY VESSELS, OPERATING-DIFFERENTIAL SUBSIDY VESSELS AND OF VESSELS SOLD OR ADJUSTED UNDER THE MERCHANT SHIP SALES ACT 1946 § 289.2 Vessels included. Vessels subject to the provisions of this part are: (a) All vessels which may in the future be constructed or sold with construction...

  16. Blood flow reprograms lymphatic vessels to blood vessels.

    Science.gov (United States)

    Chen, Chiu-Yu; Bertozzi, Cara; Zou, Zhiying; Yuan, Lijun; Lee, John S; Lu, MinMin; Stachelek, Stan J; Srinivasan, Sathish; Guo, Lili; Vicente, Andres; Vincente, Andres; Mericko, Patricia; Levy, Robert J; Makinen, Taija; Oliver, Guillermo; Kahn, Mark L

    2012-06-01

    Human vascular malformations cause disease as a result of changes in blood flow and vascular hemodynamic forces. Although the genetic mutations that underlie the formation of many human vascular malformations are known, the extent to which abnormal blood flow can subsequently influence the vascular genetic program and natural history is not. Loss of the SH2 domain-containing leukocyte protein of 76 kDa (SLP76) resulted in a vascular malformation that directed blood flow through mesenteric lymphatic vessels after birth in mice. Mesenteric vessels in the position of the congenital lymphatic in mature Slp76-null mice lacked lymphatic identity and expressed a marker of blood vessel identity. Genetic lineage tracing demonstrated that this change in vessel identity was the result of lymphatic endothelial cell reprogramming rather than replacement by blood endothelial cells. Exposure of lymphatic vessels to blood in the absence of significant flow did not alter vessel identity in vivo, but lymphatic endothelial cells exposed to similar levels of shear stress ex vivo rapidly lost expression of PROX1, a lymphatic fate-specifying transcription factor. These findings reveal that blood flow can convert lymphatic vessels to blood vessels, demonstrating that hemodynamic forces may reprogram endothelial and vessel identity in cardiovascular diseases associated with abnormal flow.

  17. Testbeam results of the first real-time embedded tracking system with artificial retina

    Energy Technology Data Exchange (ETDEWEB)

    Neri, N., E-mail: nicola.neri@mi.infn.it; Abba, A.; Caponio, F.; Citterio, M.; Coelli, S.; Fu, J.; Merli, A.; Monti, M.; Petruzzo, M.

    2017-02-11

    We present the testbeam results of the first real-time embedded tracking system based on artificial retina algorithm. The tracking system prototype is capable of fast track reconstruction with a latency of the response below 1 μs and track parameter resolutions that are comparable with the offline results. The artificial retina algorithm was implemented in hardware in a custom data acquisition board based on commercial FPGA. The system was tested successfully using a 180 GeV/c proton beam at the CERN SPS with a maximum track rate of about 280 kHz. Online track parameters were found in good agreement with offline results and with the simulated response. - Highlights: • First real-time tracking system based on artificial retina algorithm tested on beam. • Fast track reconstruction within one microsecond latency and offline like quality. • Fast tracking algorithm implemented in commercial FPGAs.

  18. RFID Location Algorithm

    Directory of Open Access Journals (Sweden)

    Wang Zi Min

    2016-01-01

    Full Text Available With the development of social services, people’s living standards improve further requirements, there is an urgent need for a way to adapt to the complex situation of the new positioning technology. In recent years, RFID technology have a wide range of applications in all aspects of life and production, such as logistics tracking, car alarm, security and other items. The use of RFID technology to locate, it is a new direction in the eyes of the various research institutions and scholars. RFID positioning technology system stability, the error is small and low-cost advantages of its location algorithm is the focus of this study.This article analyzes the layers of RFID technology targeting methods and algorithms. First, RFID common several basic methods are introduced; Secondly, higher accuracy to political network location method; Finally, LANDMARC algorithm will be described. Through this it can be seen that advanced and efficient algorithms play an important role in increasing RFID positioning accuracy aspects.Finally, the algorithm of RFID location technology are summarized, pointing out the deficiencies in the algorithm, and put forward a follow-up study of the requirements, the vision of a better future RFID positioning technology.

  19. INNER TRACKING

    CERN Multimedia

    P. Sharp

    The CMS Inner Tracking Detector continues to make good progress. The Objective for 2006 was to complete all of the CMS Tracker sub-detectors and to start the integration of the sub-detectors into the Tracker Support Tube (TST). The Objective for 2007 is to deliver to CMS a completed, installed, commissioned and calibrated Tracking System (Silicon Strip and Pixels) aligned to < 100µ in April 2008 ready for the first physics collisions at LHC. In November 2006 all of the sub-detectors had been delivered to the Tracker Integration facility (TIF) at CERN and the tests and QA procedures to be carried out on each sub-detector before integration had been established. In December 2006, TIB/TID+ was integrated into TOB+, TIB/TID- was being prepared for integration, and TEC+ was undergoing tests at the final tracker operating temperature (-100 C) in the Lyon cold room. In February 2007, TIB/TID- has been integrated into TOB-, and the installation of the pixel support tube and the services for TI...

  20. Comparative investigation into Viterbi based and multiple hypothesis based track stitching

    CSIR Research Space (South Africa)

    Van der Merwe, LJ

    2016-12-01

    Full Text Available In this study a comparative analysis is performed between a novel Viterbi based and multiple hypothesis based track stitching algorithms. The track fragments in the Viterbi based track stitching algorithm are modelled as nodes in a trellis structure...

  1. Energy Efficient Hybrid Dual Axis Solar Tracking System

    OpenAIRE

    Rashid Ahammed Ferdaus; Mahir Asif Mohammed; Sanzidur Rahman; Sayedus Salehin; Mohammad Abdul Mannan

    2014-01-01

    This paper describes the design and implementation of an energy efficient solar tracking system from a normal mechanical single axis to a hybrid dual axis. For optimizing the solar tracking mechanism electromechanical systems were evolved through implementation of different evolutional algorithms and methodologies. To present the tracker, a hybrid dual-axis solar tracking system is designed, built, and tested based on both the solar map and light sensor based continuous tracking mechanism. Th...

  2. Algorithmic mathematics

    CERN Document Server

    Hougardy, Stefan

    2016-01-01

    Algorithms play an increasingly important role in nearly all fields of mathematics. This book allows readers to develop basic mathematical abilities, in particular those concerning the design and analysis of algorithms as well as their implementation. It presents not only fundamental algorithms like the sieve of Eratosthenes, the Euclidean algorithm, sorting algorithms, algorithms on graphs, and Gaussian elimination, but also discusses elementary data structures, basic graph theory, and numerical questions. In addition, it provides an introduction to programming and demonstrates in detail how to implement algorithms in C++. This textbook is suitable for students who are new to the subject and covers a basic mathematical lecture course, complementing traditional courses on analysis and linear algebra. Both authors have given this "Algorithmic Mathematics" course at the University of Bonn several times in recent years.

  3. LHCb: The LHCb tracking concept and performance

    CERN Multimedia

    Rodrigues, E

    2009-01-01

    The LHCb tracking system is designed to reconstruct charged particle trajectories in the forward spectrometer, in view of high precision studies of CP-violating phenomena and searches for rare b-hadron decays at the LHC. The system is composed of four major subdetectors and a dedicated magnet, providing an excellent momentum resolution just above 0.4%. The tracking model is based on the innovative trajectories concept introduced by the BaBar collaboration to reconstruct and fit the tracks, and has been further developed and improved. It is now able to cope with realistic geometries and misalignments in a sophisticated, robust and detector-independent way. The LHCb tracking concept including the interplay of various complementary pattern recognition algorithms and the bi-directional Kalman fitter will be described. The current performance of the tracking, based on the latest simulations, will be presented. Recent results obtained with the first LHC beam tracks from injection tests will be discussed.

  4. Hypersonic sliding target tracking in near space

    Directory of Open Access Journals (Sweden)

    Xiang-yu Zhang

    2015-12-01

    Full Text Available To improve the tracking accuracy of hypersonic sliding target in near space, the influence of target hypersonic movement on radar detection and tracking is analyzed, and an IMM tracking algorithm is proposed based on radial velocity compensating and cancellation processing of high dynamic biases under the earth centered earth fixed (ECEF coordinate. Based on the analysis of effect of target hypersonic movement, a measurement model is constructed to reduce the filter divergence which is caused by the model mismatch. The high dynamic biases due to the target hypersonic movement are approximately compensated through radial velocity estimation to achieve the hypersonic target tracking at low systematic biases in near space. The high dynamic biases are further eliminated by the cancellation processing of different radars, in which the track association problem can be solved when the dynamic biases are low. An IMM algorithm based on constant acceleration (CA, constant turning (CT and Singer models is used to achieve the hypersonic sliding target tracking in near space. Simulation results show that the target tracking in near space can be achieved more effectively by using the proposed algorithm.

  5. Automatic Segmentation of Vessels in In-Vivo Ultrasound Scans

    DEFF Research Database (Denmark)

    Tamimi-Sarnikowski, Philip; Brink-Kjær, Andreas; Moshavegh, Ramin

    2017-01-01

    presents a fully automatic segmentation algorithm, for robustly segmenting the vessel lumen in longitudinal B-mode ultrasound images. The automatic segmentation is performed using a combination of B-mode and power Doppler images. The proposed algorithm includes a series of preprocessing steps, and performs...... a vessel segmentation by use of the marker-controlled watershed transform. The ultrasound images used in the study were acquired using the bk3000 ultrasound scanner (BK Ultrasound, Herlev, Denmark) with two transducers ”8L2 Linear” and ”10L2w Wide Linear” (BK Ultrasound, Herlev, Denmark). The algorithm...... was evaluated empirically and applied to a dataset of in-vivo 1770 images recorded from 8 healthy subjects. The segmentation results were compared to manual delineation performed by two experienced users. The results showed a sensitivity and specificity of 90.41 ± 11.2 % and 97.93 ± 5.7 % (mean ± standard...

  6. The vessel fluence; Fluence cuve

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    2001-07-01

    This book presents the proceedings of the technical meeting on the reactors vessels fluence. They are grouped in eight sessions: the industrial context and the stakes of the vessels control; the organization and the methodology for the fluence computation; the concerned physical properties; the reference computation methods; the fluence monitoring in an industrial context; vessels monitoring under irradiation; others methods in the world; the research and development programs. (A.L.B.)

  7. Total algorithms

    NARCIS (Netherlands)

    Tel, G.

    We define the notion of total algorithms for networks of processes. A total algorithm enforces that a "decision" is taken by a subset of the processes, and that participation of all processes is required to reach this decision. Total algorithms are an important building block in the design of

  8. [Large vessel vasculitides].

    Science.gov (United States)

    Morović-Vergles, Jadranka; Puksić, Silva; Gracanin, Ana Gudelj

    2013-01-01

    Large vessel vasculitis includes Giant cell arteritis and Takayasu arteritis. Giant cell arteritis is the most common form of vasculitis affect patients aged 50 years or over. The diagnosis should be considered in older patients who present with new onset of headache, visual disturbance, polymyalgia rheumatica and/or fever unknown cause. Glucocorticoides remain the cornerstone of therapy. Takayasu arteritis is a chronic panarteritis of the aorta ant its major branches presenting commonly in young ages. Although all large arteries can be affected, the aorta, subclavian and carotid arteries are most commonly involved. The most common symptoms included upper extremity claudication, hypertension, pain over the carotid arteries (carotidynia), dizziness and visual disturbances. Early diagnosis and treatment has improved the outcome in patients with TA.

  9. Vessel segmentation in screening mammograms

    Science.gov (United States)

    Mordang, J. J.; Karssemeijer, N.

    2015-03-01

    Blood vessels are a major cause of false positives in computer aided detection systems for the detection of breast cancer. Therefore, the purpose of this study is to construct a framework for the segmentation of blood vessels in screening mammograms. The proposed framework is based on supervised learning using a cascade classifier. This cascade classifier consists of several stages where in each stage a GentleBoost classifier is trained on Haar-like features. A total of 30 cases were included in this study. In each image, vessel pixels were annotated by selecting pixels on the centerline of the vessel, control samples were taken by annotating a region without any visible vascular structures. This resulted in a total of 31,000 pixels marked as vascular and over 4 million control pixels. After training, the classifier assigns a vesselness likelihood to the pixels. The proposed framework was compared to three other vessel enhancing methods, i) a vesselness filter, ii) a gaussian derivative filter, and iii) a tubeness filter. The methods were compared in terms of area under the receiver operating characteristics curves, the Az values. The Az value of the cascade approach is 0:85. This is superior to the vesselness, Gaussian, and tubeness methods, with Az values of 0:77, 0:81, and 0:78, respectively. From these results, it can be concluded that our proposed framework is a promising method for the detection of vessels in screening mammograms.

  10. Americium behaviour in plastic vessels

    Energy Technology Data Exchange (ETDEWEB)

    Legarda, F.; Herranz, M. [Departamento de Ingenieria Nuclear y Mecanica de Fluidos, Escuela Tecnica Superior de Ingenieria de Bilbao, Universidad del Pais Vasco (UPV/EHU), Alameda de Urquijo s/n, 48013 Bilbao (Spain); Idoeta, R., E-mail: raquel.idoeta@ehu.e [Departamento de Ingenieria Nuclear y Mecanica de Fluidos, Escuela Tecnica Superior de Ingenieria de Bilbao, Universidad del Pais Vasco (UPV/EHU), Alameda de Urquijo s/n, 48013 Bilbao (Spain); Abelairas, A. [Departamento de Ingenieria Nuclear y Mecanica de Fluidos, Escuela Tecnica Superior de Ingenieria de Bilbao, Universidad del Pais Vasco (UPV/EHU), Alameda de Urquijo s/n, 48013 Bilbao (Spain)

    2010-07-15

    The adsorption of {sup 241}Am dissolved in water in different plastic storage vessels was determined. Three different plastics were investigated with natural and distilled waters and the retention of {sup 241}Am by these plastics was studied. The same was done by varying vessel agitation time, vessel agitation speed, surface/volume ratio of water in the vessels and water pH. Adsorptions were measured to be between 0% and 70%. The adsorption of {sup 241}Am is minimized with no water agitation, with PET or PVC plastics, and by water acidification.

  11. Physical Models for Particle Tracking Simulations in the RF Gap

    Energy Technology Data Exchange (ETDEWEB)

    Shishlo, Andrei P. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Holmes, Jeffrey A. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

    2015-06-01

    This document describes the algorithms that are used in the PyORBIT code to track the particles accelerated in the Radio-Frequency cavities. It gives the mathematical description of the algorithms and the assumptions made in each case. The derived formulas have been implemented in the PyORBIT code. The necessary data for each algorithm are described in detail.

  12. Extending Comprehensive Maritime Awareness to Disconnected Vessels and Users

    Science.gov (United States)

    2007-09-01

    is defined as “all areas and things of, on, under, relating to, adjacent to, or bordering on a sea, ocean or other navigable waterway, including all...System (AIS) and Long Range Identification and Tracking ( LRIT ) system, incorporated important capabilities into the MDA. The AIS was identified as a...maritime transponder for all vessels 300 gross tons or greater. The LRIT , mandated by the International Maritime Organization as part of the Safety of

  13. Particle Filtering Applied to Musical Tempo Tracking

    Directory of Open Access Journals (Sweden)

    Malcolm D. Macleod

    2004-11-01

    Full Text Available This paper explores the use of particle filters for beat tracking in musical audio examples. The aim is to estimate the time-varying tempo process and to find the time locations of beats, as defined by human perception. Two alternative algorithms are presented, one which performs Rao-Blackwellisation to produce an almost deterministic formulation while the second is a formulation which models tempo as a Brownian motion process. The algorithms have been tested on a large and varied database of examples and results are comparable with the current state of the art. The deterministic algorithm gives the better performance of the two algorithms.

  14. Vessels Route Planning Problem with Uncertain Data

    Directory of Open Access Journals (Sweden)

    Tomasz Neumann

    2016-09-01

    Full Text Available The purpose of this paper is to find a solution for route planning in a transport networks, where the costs of tracks, factor of safety and travel time are ambiguous. This approach is based on the Dempster-Shafer theory and well known Dijkstra's algorithm. In this approach important are the influencing factors of the mentioned coefficients using uncertain possibilities presented by probability intervals. Based on these intervals the quality intervals of each route can be determined. Applied decision rules can be described by the end user.

  15. A fast meteor detection algorithm

    Science.gov (United States)

    Gural, P.

    2016-01-01

    A low latency meteor detection algorithm for use with fast steering mirrors had been previously developed to track and telescopically follow meteors in real-time (Gural, 2007). It has been rewritten as a generic clustering and tracking software module for meteor detection that meets both the demanding throughput requirements of a Raspberry Pi while also maintaining a high probability of detection. The software interface is generalized to work with various forms of front-end video pre-processing approaches and provides a rich product set of parameterized line detection metrics. Discussion will include the Maximum Temporal Pixel (MTP) compression technique as a fast thresholding option for feeding the detection module, the detection algorithm trade for maximum processing throughput, details on the clustering and tracking methodology, processing products, performance metrics, and a general interface description.

  16. Feature-based respiratory motion tracking in native fluoroscopic sequences for dynamic roadmaps during minimally invasive procedures in the thorax and abdomen

    Science.gov (United States)

    Wagner, Martin G.; Laeseke, Paul F.; Schubert, Tilman; Slagowski, Jordan M.; Speidel, Michael A.; Mistretta, Charles A.

    2017-03-01

    Fluoroscopic image guidance for minimally invasive procedures in the thorax and abdomen suffers from respiratory and cardiac motion, which can cause severe subtraction artifacts and inaccurate image guidance. This work proposes novel techniques for respiratory motion tracking in native fluoroscopic images as well as a model based estimation of vessel deformation. This would allow compensation for respiratory motion during the procedure and therefore simplify the workflow for minimally invasive procedures such as liver embolization. The method first establishes dynamic motion models for both the contrast-enhanced vasculature and curvilinear background features based on a native (non-contrast) and a contrast-enhanced image sequence acquired prior to device manipulation, under free breathing conditions. The model of vascular motion is generated by applying the diffeomorphic demons algorithm to an automatic segmentation of the subtraction sequence. The model of curvilinear background features is based on feature tracking in the native sequence. The two models establish the relationship between the respiratory state, which is inferred from curvilinear background features, and the vascular morphology during that same respiratory state. During subsequent fluoroscopy, curvilinear feature detection is applied to determine the appropriate vessel mask to display. The result is a dynamic motioncompensated vessel mask superimposed on the fluoroscopic image. Quantitative evaluation of the proposed methods was performed using a digital 4D CT-phantom (XCAT), which provides realistic human anatomy including sophisticated respiratory and cardiac motion models. Four groups of datasets were generated, where different parameters (cycle length, maximum diaphragm motion and maximum chest expansion) were modified within each image sequence. Each group contains 4 datasets consisting of the initial native and contrast enhanced sequences as well as a sequence, where the respiratory motion is

  17. Width Criterion For Weld-Seam-Tracking Data

    Science.gov (United States)

    Lincir, Mark R.

    1993-01-01

    Image-processing algorithm in "through-torch-vision" (T3V) system developed to guide gas/tungsten arc welding robot along weld seam modified, according to proposal, reducing incidence of inaccurate tracking of weld seam. Developmental system intended to provide closed-loop control of motion of welding robot along weld seam on basis of lines in T3V image identified by use of image-processing algorithm and assumed to coincide with edges of weld seam. Use of width criterion prevents tracking of many false pairs of lines, with consequent decrease in incidence of inaccurate tracking and increase in confidence in weld-tracking capability of robotic welding system.

  18. Research on infrared small-target tracking technology under complex background

    Science.gov (United States)

    Liu, Lei; Wang, Xin; Chen, Jilu; Pan, Tao

    2012-10-01

    In this paper, some basic principles and the implementing flow charts of a series of algorithms for target tracking are described. On the foundation of above works, a moving target tracking software base on the OpenCV is developed by the software developing platform MFC. Three kinds of tracking algorithms are integrated in this software. These two tracking algorithms are Kalman Filter tracking method and Camshift tracking method. In order to explain the software clearly, the framework and the function are described in this paper. At last, the implementing processes and results are analyzed, and those algorithms for tracking targets are evaluated from the two aspects of subjective and objective. This paper is very significant in the application of the infrared target tracking technology.

  19. INNER TRACKING

    CERN Multimedia

    P. Sharp

    The CMS Inner Tracking Detector continues to make good progress. The successful commissioning of ~ 25% of the Silicon Strip Tracker was completed in the Tracker Integration Facility (TIF) at CERN in July 2007 and the Tracker has since been prepared for moving and installation into CMS at P5. The Tracker was ready to move on schedule in September 2007. The Installation of the Tracker cooling pipes and LV cables between Patch Panel 1 (PP1) on the inside the CMS magnet cryostat, and the cooling plants and power system racks on the balconies has been completed. The optical fibres from PP1 to the readout FEDs in the USC have been installed, together with the Tracker cable channels, in parallel with the installation of the EB/HB services. All of the Tracker Safety, Power, DCS and the VME Readout Systems have been installed at P5 and are being tested and commissioned with CMS. It is planned to install the Tracker into CMS before Christmas. The Tracker will then be connected to the pre-installed services on Y...

  20. INNER TRACKING

    CERN Multimedia

    P. Sharp

    The CMS Inner Tracking Detector continues to make good progress. The successful commissioning of ~ 25% of the Silicon Strip Tracker was completed in the Tracker Integration Facility (TIF) at CERN on 18 July 2007 and the Tracker has since been prepared for moving and installation into CMS at P5. The Tracker will be ready to move on schedule in September 2007. The Installation of the Tracker cooling pipes and LV cables between Patch Panel 1 (PP1) on the inside the CMS magnet cryostat, and the cooling plants and power system racks on the balconies has been completed. The optical fibres from PP1 to the readout FEDs in the USC will be installed in parallel with the installation of the EB/HB services, and will be completed in October. It is planned to install the Tracker into CMS at the end of October, after the completion of the installation of the EB/HB services. The Tracker will then be connected to the pre-installed services on YB0 and commissioned with CMS in December. The FPix and BPix continue to make ...

  1. Novel Method to Detect Corneal Lymphatic Vessels In Vivo by Intrastromal Injection of Fluorescein.

    Science.gov (United States)

    Le, Viet Nhat Hung; Hou, Yanhong; Horstmann, Jens; Bock, Felix; Cursiefen, Claus

    2017-11-09

    Corneal lymphatic vessels are clinically invisible because of their thin walls and clear lymph fluid. There is no easy and established method for in vivo imaging of corneal lymphatic vessels so far. In this study, we present a novel approach to visualize corneal lymphatic vessels in vivo by injecting intrastromal fluorescein sodium. Six- to eight-week-old female BALB/c mice were used in the mouse model of suture-induced corneal neovascularization. Two weeks after the suture placement, fluorescein sodium was injected intrastromally. The fluorescein, taken up by the presumed lymphatic vessels, was then tracked using a clinically used Spectralis HRA + OCT device. Immunohistochemistry staining with specific lymphatic marker LYVE-1 and pan-endothelial marker CD31 was used to confirm the indirect lymphangiography findings. By injecting fluorescein intrastromally, both corneal blood and lymphatic vessels were detected. While the lymphatic vessels were visible as bright vessel-like structures using HRA, the blood vessels appeared as dark networks. Fluorescein-labeled lymphatic vessels were colocalized with LYVE-1 in immunohistochemically stained sections of the same specimen. Corneal lymphatic vessels can be easily imaged in vivo in the murine model using intrastromal fluorescein injection.

  2. 50 CFR 648.8 - Vessel identification.

    Science.gov (United States)

    2010-10-01

    ... 50 Wildlife and Fisheries 8 2010-10-01 2010-10-01 false Vessel identification. 648.8 Section 648.8... identification. (a) Vessel name and official number. Each fishing vessel subject to this part and over 25 ft (7.6... or ocean quahog vessels licensed under New Jersey law may use the appropriate vessel identification...

  3. Kalman Filter Tracking on Parallel Architectures

    Directory of Open Access Journals (Sweden)

    Cerati Giuseppe

    2016-01-01

    Full Text Available Power density constraints are limiting the performance improvements of modern CPUs. To address this we have seen the introduction of lower-power, multi-core processors such as GPGPU, ARM and Intel MIC. In order to achieve the theoretical performance gains of these processors, it will be necessary to parallelize algorithms to exploit larger numbers of lightweight cores and specialized functions like large vector units. Track finding and fitting is one of the most computationally challenging problems for event reconstruction in particle physics. At the High-Luminosity Large Hadron Collider (HL-LHC, for example, this will be by far the dominant problem. The need for greater parallelism has driven investigations of very different track finding techniques such as Cellular Automata or Hough Transforms. The most common track finding techniques in use today, however, are those based on a Kalman filter approach. Significant experience has been accumulated with these techniques on real tracking detector systems, both in the trigger and offline. They are known to provide high physics performance, are robust, and are in use today at the LHC. Given the utility of the Kalman filter in track finding, we have begun to port these algorithms to parallel architectures, namely Intel Xeon and Xeon Phi. We report here on our progress towards an end-to-end track reconstruction algorithm fully exploiting vectorization and parallelization techniques in a simplified experimental environment.

  4. Visual tracking via robust multitask sparse prototypes

    Science.gov (United States)

    Zhang, Huanlong; Hu, Shiqiang; Yu, Junyang

    2015-03-01

    Sparse representation has been applied to an online subspace learning-based tracking problem. To handle partial occlusion effectively, some researchers introduce l1 regularization to principal component analysis (PCA) reconstruction. However, in these traditional tracking methods, the representation of each object observation is often viewed as an individual task so the inter-relationship between PCA basis vectors is ignored. We propose a new online visual tracking algorithm with multitask sparse prototypes, which combines multitask sparse learning with PCA-based subspace representation. We first extend a visual tracking algorithm with sparse prototypes in multitask learning framework to mine inter-relations between subtasks. Then, to avoid the problem that enforcing all subtasks to share the same structure may result in degraded tracking results, we impose group sparse constraints on the coefficients of PCA basis vectors and element-wise sparse constraints on the error coefficients, respectively. Finally, we show that the proposed optimization problem can be effectively solved using the accelerated proximal gradient method with the fast convergence. Experimental results compared with the state-of-the-art tracking methods demonstrate that the proposed algorithm achieves favorable performance when the object undergoes partial occlusion, motion blur, and illumination changes.

  5. Discriminative feature selection for visual tracking

    Science.gov (United States)

    Ma, Junkai; Luo, Haibo; Zhou, Wei; Song, Yingchao; Hui, Bin; Chang, Zheng

    2017-06-01

    Visual tracking is an important role in computer vision tasks. The robustness of tracking algorithm is a challenge. Especially in complex scenarios such as clutter background, illumination variation and appearance changes etc. As an important component in tracking algorithm, the appropriateness of feature is closed related to the tracking precision. In this paper, an online discriminative feature selection is proposed to provide the tracker the most discriminative feature. Firstly, a feature pool which contains different information of the image such as gradient, gray value and edge is built. And when every frame is processed during tracking, all of these features will be extracted. Secondly, these features are ranked depend on their discrimination between target and background and the highest scored feature is chosen to represent the candidate image patch. Then, after obtaining the tracking result, the target model will be update to adapt the appearance variation. The experiment show that our method is robust when compared with other state-of-the-art algorithms.

  6. Fourier cross-sectional profile for vessel detection on retinal images.

    Science.gov (United States)

    Zhu, Tao

    2010-04-01

    Retinal blood vessels are important objects in ophthalmologic images. In spite of many attempts for vessel detection, it appears that existing methodologies are based on edge detection or modeling of vessel cross-sectional profiles in intensity. The application of these methodologies is hampered by the presence of a wide range of retinal vessels. In this paper we define a universal representation for upward and downward vessel cross-sectional profiles with varying boundary sharpness. This expression is used to define a new scheme of vessel detection based on symmetry and asymmetry in the Fourier domain. Phase congruency is utilized for measuring symmetry and asymmetry so that our scheme is invariant to vessel brightness variations. We have performed experiments on fluorescein images and color fundus images to show the efficiency of the proposed algorithm technique. We also have performed a width measurement study, using an optimal medial axis skeletonization scheme as a post-processing step, to compare the technique with the generalized Gaussian profile modeling. The new algorithm technique is promising for automated vessel detection where optimizing profile models is difficult and preserving vessel width information is necessary. Copyright (c) 2009 Elsevier Ltd. All rights reserved.

  7. Motion Model Employment using interacting Motion Model Algorithm

    DEFF Research Database (Denmark)

    Hussain, Dil Muhammad Akbar

    2006-01-01

    The paper presents a simulation study to track a maneuvering target using a selective approach in choosing Interacting Multiple Models (IMM) algorithm to provide a wider coverage to track such targets.  Initially, there are two motion models in the system to track a target.  Probability of each...

  8. Bidirectional MIMO Channel Tracking Based on PASTd and Performance Evaluation

    Directory of Open Access Journals (Sweden)

    Shayevitz Ofer

    2010-01-01

    Full Text Available Abstract We consider a bidirectional time division duplex (TDD multiple-input multiple-output (MIMO communication system with time-varying channel and additive white Gaussian noise (AWGN. A blind bidirectional channel tracking algorithm, based on the projection approximation subspace tracking (PAST algorithm, is applied in both terminals. The resulting singular value decomposition (SVD of the channel matrix is then used to approximately diagonalize the channel. The proposed method is applied to an orthogonal frequency-division multiplexing-(OFDM-MIMO setting with a typical indoor time-domain reflection model. The computational cost of the proposed algorithm, compared with other state-of-the-art algorithms, is relatively small. The Kalman filter is utilized for establishing a benchmark for the obtained performance of the proposed tracking algorithm. The performance degradation relative to a full channel state information (CSI due to the application of the tracking algorithm is evaluated in terms of average effective rate and the outage probability and compared with alternative tracking algorithms. The obtained results are also compared with a benchmark obtained by the Kalman filter with known input signal and channel characteristics. It is shown that the expected degradation in performance of frequency-domain algorithms (which do not exploit the smooth frequency response of the channel is only minor compared with time-domain algorithms in a range of reasonable signal-to-noise ratio (SNR levels. The proposed bidirectional frequency-domain tracking algorithm, proposed in this paper, is shown to attain communication rates close to the benchmark and to outperform a competing algorithm. The paper is concluded by evaluating the proposed blind tracking method in terms of the outage probability and the symbol error rate (SER versus. SNR for binary phase shift keying (BPSK and 4-Quadrature amplitude modulation (QAM constellations.

  9. Study of Track Irregularity Time Series Calibration and Variation Pattern at Unit Section

    Directory of Open Access Journals (Sweden)

    Chaolong Jia

    2014-01-01

    Full Text Available Focusing on problems existing in track irregularity time series data quality, this paper first presents abnormal data identification, data offset correction algorithm, local outlier data identification, and noise cancellation algorithms. And then proposes track irregularity time series decomposition and reconstruction through the wavelet decomposition and reconstruction approach. Finally, the patterns and features of track irregularity standard deviation data sequence in unit sections are studied, and the changing trend of track irregularity time series is discovered and described.

  10. Symmetric Kullback-Leibler Metric Based Tracking Behaviors for Bioinspired Robotic Eyes

    OpenAIRE

    Hengli Liu; Jun Luo; Peng Wu; Shaorong Xie; Hengyu Li

    2015-01-01

    A symmetric Kullback-Leibler metric based tracking system, capable of tracking moving targets, is presented for a bionic spherical parallel mechanism to minimize a tracking error function to simulate smooth pursuit of human eyes. More specifically, we propose a real-time moving target tracking algorithm which utilizes spatial histograms taking into account symmetric Kullback-Leibler metric. In the proposed algorithm, the key spatial histograms are extracted and taken into particle filtering f...

  11. 2D Fast Vessel Visualization Using a Vessel Wall Mask Guiding Fine Vessel Detection

    Directory of Open Access Journals (Sweden)

    Sotirios Raptis

    2010-01-01

    and then try to approach the ridges and branches of the vasculature's using fine detection. Fine vessel screening looks into local structural inconsistencies in vessels properties, into noise, or into not expected intensity variations observed inside pre-known vessel-body areas. The vessels are first modelled sufficiently but not precisely by their walls with a tubular model-structure that is the result of an initial segmentation. This provides a chart of likely Vessel Wall Pixels (VWPs yielding a form of a likelihood vessel map mainly based on gradient filter's intensity and spatial arrangement parameters (e.g., linear consistency. Specific vessel parameters (centerline, width, location, fall-away rate, main orientation are post-computed by convolving the image with a set of pre-tuned spatial filters called Matched Filters (MFs. These are easily computed as Gaussian-like 2D forms that use a limited range sub-optimal parameters adjusted to the dominant vessel characteristics obtained by Spatial Grey Level Difference statistics limiting the range of search into vessel widths of 16, 32, and 64 pixels. Sparse pixels are effectively eliminated by applying a limited range Hough Transform (HT or region growing. Major benefits are limiting the range of parameters, reducing the search-space for post-convolution to only masked regions, representing almost 2% of the 2D volume, good speed versus accuracy/time trade-off. Results show the potentials of our approach in terms of time for detection ROC analysis and accuracy of vessel pixel (VP detection.

  12. Trigger tracking for the LHCb upgrade

    CERN Multimedia

    Dungs, K

    2014-01-01

    This poster presents a trigger system for the upgraded LHCb detector, scheduled to begin operation in 2020. The proposed trigger system is implemented entirely in software. We show that track reconstruction of a similar quality to that available in the offline algorithms can be performed on the full inelastic pp-collision rate. A track finding efficiency of 98.8% relative to offline can be achieved for good trigger tracks. The CPU time required for this reconstruction is less than 60% of the available budget.

  13. BY FRUSTUM CONFINING VESSEL

    Directory of Open Access Journals (Sweden)

    Javad Khazaei

    2016-09-01

    Full Text Available Helical piles are environmentally friendly and economical deep foundations that, due to environmental considerations, are excellent additions to a variety of deep foundation alternatives available to the practitioner. Helical piles performance depends on soil properties, the pile geometry and soil-pile interaction. Helical piles can be a proper alternative in sensitive environmental sites if their bearing capacity is sufficient to support applied loads. The failure capacity of helical piles in this study was measured via an experimental research program that was carried out by Frustum Confining Vessel (FCV. FCV is a frustum chamber by approximately linear increase in vertical and lateral stresses along depth from top to bottom. Due to special geometry and applied bottom pressure, this apparatus is a proper choice to test small model piles which can simulate field stress conditions. Small scale helical piles are made with either single helix or more helixes and installed in fine grained sand with three various densities. Axial loading tests including compression and tension tests were performed to achieve pile ultimate capacity. The results indicate the helical piles behavior depends essentially on pile geometric characteristics, i.e. helix configuration and soil properties. According to the achievements, axial uplift capacity of helical model piles is about equal to usual steel model piles that have the helixes diameter. Helical pile compression bearing capacity is too sufficient to act as a medium pile, thus it can be substituted other piles in special geoenvironmental conditions. The bearing capacity also depends on spacing ratio, S/D, and helixes diameter.

  14. Southeast Region Headboat Survey-Vessel list/Vessel Directory

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — This is a database of vessels that have been on the SRHS through time, their owners/operators, marinas/docks and their contact information. This assists in...

  15. Simulation and Track Reconstruction for Beam Telescopes

    CERN Document Server

    Maqbool, Salman

    2017-01-01

    Beam telescopes are an important tool to test new detectors under development in a particle beam. To test these novel detectors and determine their properties, the particle tracks need to be reconstructed from the known detectors in the telescope. Based on the reconstructed track, its predicted position on the Device under Test (DUT) are compared with the actual hits on the DUT. Several methods exist for track reconstruction, but most of them do not account for the effects of multiple scattering. General Broken Lines is one such algorithm which incorporates these effects during reconstruction. The aim of this project was to simulate the beam telescope and extend the track reconstruction framework for the FE-I4 telescope, which takes these effects into account. Section 1 introduces the problem, while section 2 focuses on beam telescopes. This is followed by the Allpix2 simulation framework in Section 3. And finally, Section 4 introduces the Proteus track reconstruction framework along with the General Broken ...

  16. An improved likelihood model for eye tracking

    DEFF Research Database (Denmark)

    Hammoud, Riad I.; Hansen, Dan Witzner

    2007-01-01

    While existing eye detection and tracking algorithms can work reasonably well in a controlled environment, they tend to perform poorly under real world imaging conditions where the lighting produces shadows and the person's eyes can be occluded by e.g. glasses or makeup. As a result, pixel clusters...... associated with the eyes tend to be grouped together with background-features. This problem occurs both for eye detection and eye tracking. Problems that especially plague eye tracking include head movement, eye blinking and light changes, all of which can cause the eyes to suddenly disappear. The usual...... approach in such cases is to abandon the tracking routine and re-initialize eye detection. Of course this may be a difficult process due to missed data problem. Accordingly, what is needed is an efficient method of reliably tracking a person's eyes between successively produced video image frames, even...

  17. Kalman Filter Tracking on Parallel Architectures

    Science.gov (United States)

    Cerati, Giuseppe; Elmer, Peter; Lantz, Steven; McDermott, Kevin; Riley, Dan; Tadel, Matevž; Wittich, Peter; Würthwein, Frank; Yagil, Avi

    2015-12-01

    Power density constraints are limiting the performance improvements of modern CPUs. To address this we have seen the introduction of lower-power, multi-core processors, but the future will be even more exciting. In order to stay within the power density limits but still obtain Moore's Law performance/price gains, it will be necessary to parallelize algorithms to exploit larger numbers of lightweight cores and specialized functions like large vector units. Example technologies today include Intel's Xeon Phi and GPGPUs. Track finding and fitting is one of the most computationally challenging problems for event reconstruction in particle physics. At the High Luminosity LHC, for example, this will be by far the dominant problem. The need for greater parallelism has driven investigations of very different track finding techniques including Cellular Automata or returning to Hough Transform. The most common track finding techniques in use today are however those based on the Kalman Filter [2]. Significant experience has been accumulated with these techniques on real tracking detector systems, both in the trigger and offline. They are known to provide high physics performance, are robust and are exactly those being used today for the design of the tracking system for HL-LHC. Our previous investigations showed that, using optimized data structures, track fitting with Kalman Filter can achieve large speedup both with Intel Xeon and Xeon Phi. We report here our further progress towards an end-to-end track reconstruction algorithm fully exploiting vectorization and parallelization techniques in a realistic simulation setup.

  18. L0 Confirmation with fast, Tsa based tracking in the T-stations

    CERN Document Server

    Albrecht, J; Terrier, H

    2007-01-01

    A fast tracking algorithm to confirm the high $p_T$ L0 trigger objects with tracks from the T-stations is presented. The L0 trigger candidate is used to define a search window to a potential track. Using this, a seeded track search is performed. The track finding algorithm is based on the \\textit{TsaSeeding} algorithm~\\cite{bib:Tsa}. The efficiency to confirm a true L0 trigger signal is around 96\\%, the momentum can be measured up to $\\Delta p/p$=3\\%.

  19. Tissue Tracking: Applications for Brain MRI Classification

    Science.gov (United States)

    2007-01-01

    previous work on Bayesian classification algorithms. First, we present work by Haker et al.4 which outlines the general structure of Bayesian...groups have previously proposed Bayesian classification algorithms. Most relevant to our work is the work by Haker et al. on the tracking of objects in 2D...Segmentation,” Massachusetts Institute of Technology , 1999. 4. S. Haker , G. Sapiro, and A. Tannenbaum, “Knowledge-based segmentation of SAR data with

  20. Strong Tracking Spherical Simplex-Radial Cubature Kalman Filter for Maneuvering Target Tracking.

    Science.gov (United States)

    Liu, Hua; Wu, Wen

    2017-03-31

    Conventional spherical simplex-radial cubature Kalman filter (SSRCKF) for maneuvering target tracking may decline in accuracy and even diverge when a target makes abrupt state changes. To overcome this problem, a novel algorithm named strong tracking spherical simplex-radial cubature Kalman filter (STSSRCKF) is proposed in this paper. The proposed algorithm uses the spherical simplex-radial (SSR) rule to obtain a higher accuracy than cubature Kalman filter (CKF) algorithm. Meanwhile, by introducing strong tracking filter (STF) into SSRCKF and modifying the predicted states' error covariance with a time-varying fading factor, the gain matrix is adjusted on line so that the robustness of the filter and the capability of dealing with uncertainty factors is improved. In this way, the proposed algorithm has the advantages of both STF's strong robustness and SSRCKF's high accuracy. Finally, a maneuvering target tracking problem with abrupt state changes is used to test the performance of the proposed filter. Simulation results show that the STSSRCKF algorithm can get better estimation accuracy and greater robustness for maneuvering target tracking.

  1. Monterey Area Ship Tracks (MAST) MODIS Airborne Simulator (MAS) Level-1B Data Products

    Data.gov (United States)

    National Aeronautics and Space Administration — The objective of the Monterey Area Ship Tracks (MAST) campaign was to study cloud formation from ocean vessels off of the central California coast. The data was...

  2. Pattern Recognition Of Blood Vessel Networks In Ocular Fundus Images

    Science.gov (United States)

    Akita, K.; Kuga, H.

    1982-11-01

    We propose a computer method of recognizing blood vessel networks in color ocular fundus images which are used in the mass diagnosis of adult diseases such as hypertension and diabetes. A line detection algorithm is applied to extract the blood vessels, and the skeleton patterns of them are made to analyze and describe their structures. The recognition of line segments of arteries and/or veins in the vessel networks consists of three stages. First, a few segments which satisfy a certain constraint are picked up and discriminated as arteries or veins. This is the initial labeling. Then the remaining unknown ones are labeled by utilizing the physical level knowledge. We propose two schemes for this stage : a deterministic labeling and a probabilistic relaxation labeling. Finally the label of each line segment is checked so as to minimize the total number of labeling contradictions. Some experimental results are also presented.

  3. FPGA-Based Approach to Level-1 Track Finding at CMS for the HL-LHC

    CERN Document Server

    Bartz, Edward Hugo; Gershtein, Yury; Halkiadakis, Eva; Hildreth, Michael; Kyriacou, Savvas; Lannon, Kevin Patrick; Lefeld, Anthony James; Ryd, Anders Per Erik; Skinnari, Louise; Stone, Robert; Strohman, Charles Ralph; Tao, Zhengcheng; Winer, Brian; Wittich, Peter; Zientek, Margaret Eldridge

    2017-01-01

    During the High Luminosity LHC, to maintain a manageable trigger rate and achieve its physics goals, the CMS detector will need charged particle tracking at the hardware trigger level. The tracklet approach is a track-finding algorithm based on a road-search algorithm that has been implemented on commercially available FPGA technology. This algorithm has achieved high performance in track-finding and completes tracking within 3.4 $\\mu$s on a Xilinx Virtex-7 FPGA. An overview of the algorithm and its implementation on an FPGA is given, results are shown from a demonstrator test stand and system performance studies are presented.

  4. Estimating clandestine activities from partially observed processes: illegal transhipment of fish catches among vessels

    Science.gov (United States)

    Wilcox, C.; Ford, J.

    2016-12-01

    Crimes involving fishers impose significant costs on fisheries, managers and national governments. These crimes also lead to unsustainable harvesting practices, as they undermine both knowledge of the status of fisheries stocks and limits on their harvesting. One of the greatest contributors to fisheries crimes globally is transfer of fish catch among vessels, otherwise known as transshipment. While legal transshipment provides economic advantages to vessels by increasing their efficiency, illegal transshipment can allow them to avoid regulations, catch prohibited species, and fish with impunity in prohibited locations such as waters of foreign countries. Despite the presence of a number of monitoring technologies for tracking fishing vessels, transshipment is frequently done clandestinely. Here we present a statistical model for transshipment in a Southeast Asian tuna fishery. We utilize both spatial and temporal information on vessel movement patterns in a statistical model to infer unobserved transshipment events among vessels. We provide a risk analysis framework for forecasting likely transshipment events, based on our analysis of vessel movement patterns. The tools we present are widely applicable to a variety of fisheries and types of tracking data, allowing managers to more effectively screen the large volume of data tracking systems create and quickly identify suspicious behavior.

  5. TrackMate: An open and extensible platform for single-particle tracking.

    Science.gov (United States)

    Tinevez, Jean-Yves; Perry, Nick; Schindelin, Johannes; Hoopes, Genevieve M; Reynolds, Gregory D; Laplantine, Emmanuel; Bednarek, Sebastian Y; Shorte, Spencer L; Eliceiri, Kevin W

    2017-02-15

    We present TrackMate, an open source Fiji plugin for the automated, semi-automated, and manual tracking of single-particles. It offers a versatile and modular solution that works out of the box for end users, through a simple and intuitive user interface. It is also easily scriptable and adaptable, operating equally well on 1D over time, 2D over time, 3D over time, or other single and multi-channel image variants. TrackMate provides several visualization and analysis tools that aid in assessing the relevance of results. The utility of TrackMate is further enhanced through its ability to be readily customized to meet specific tracking problems. TrackMate is an extensible platform where developers can easily write their own detection, particle linking, visualization or analysis algorithms within the TrackMate environment. This evolving framework provides researchers with the opportunity to quickly develop and optimize new algorithms based on existing TrackMate modules without the need of having to write de novo user interfaces, including visualization, analysis and exporting tools. The current capabilities of TrackMate are presented in the context of three different biological problems. First, we perform Caenorhabditis-elegans lineage analysis to assess how light-induced damage during imaging impairs its early development. Our TrackMate-based lineage analysis indicates the lack of a cell-specific light-sensitive mechanism. Second, we investigate the recruitment of NEMO (NF-κB essential modulator) clusters in fibroblasts after stimulation by the cytokine IL-1 and show that photodamage can generate artifacts in the shape of TrackMate characterized movements that confuse motility analysis. Finally, we validate the use of TrackMate for quantitative lifetime analysis of clathrin-mediated endocytosis in plant cells. Copyright © 2016 The Author(s). Published by Elsevier Inc. All rights reserved.

  6. 2013 East Coast Vessel Tracklines

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — Automatic Identification Systems (AIS) are a navigation safety device that transmits and monitors the location and characteristics of many vessels in U.S. and...

  7. SC/OQ Vessel Database

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — Data tables holding information for the Surf Clam/Ocean Quahog vessel and dealer/processor logbooks (negative and positive), as well as individual tag information...

  8. 2011 Great Lakes Vessel Tracklines

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — Automatic Identification Systems (AIS) are a navigation safety device that transmits and monitors the location and characteristics of many vessels in U.S. and...

  9. 2011 West Coast Vessel Tracklines

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — Automatic Identification Systems (AIS) are a navigation safety device that transmits and monitors the location and characteristics of many vessels in U.S. and...

  10. 2013 Great Lakes Vessel Tracklines

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — Automatic Identification Systems (AIS) are a navigation safety device that transmits and monitors the location and characteristics of many vessels in U.S. and...

  11. 2011 East Coast Vessel Tracklines

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — Automatic Identification Systems (AIS) are a navigation safety device that transmits and monitors the location and characteristics of many vessels in U.S. and...

  12. Integrin binding: Sticking around vessels

    Science.gov (United States)

    Blatchley, Michael R.; Gerecht, Sharon

    2017-09-01

    A study demonstrates that controlled integrin binding on a biomaterial was capable of promoting vascular cell sprouting and formation of a non-leaky blood vessel network in a healthy and diseased state.

  13. Transposition of the great vessels

    Science.gov (United States)

    ... vessel called the ductus arteriosus open, allowing some mixing of the 2 blood circulations. A procedure using ... they are not already immune. Eating well, avoiding alcohol, and controlling diabetes both before and during pregnancy ...

  14. 2013 West Coast Vessel Tracklines

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — Automatic Identification Systems (AIS) are a navigation safety device that transmits and monitors the location and characteristics of many vessels in U.S. and...

  15. Vessel Permit System Data Set

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — GARFO issues federal fishing permits annually to owners of fishing vessels who fish in the Greater Atlantic region, as required by federal regulation. These permits...

  16. 2011 Tug Towing Vessel Density

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — Automatic Identification Systems (AIS) are a navigation safety device that transmits and monitors the location and characteristics of many vessels in U.S. and...

  17. Caribbean PR Logbook Survey (Vessels)

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains catch (landed catch) and effort for fishing trips made by vessels fishing in Puerto Rico. The catch and effort data for the entire trip are...

  18. Coastal Discard Logbook Survey (Vessels)

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains data on the type and amount of marine resources that are discarded or interacted with by vessels that are selected to report to the Southeast...

  19. Cerebral vessels segmentation for light-sheet microscopy image using convolutional neural networks

    Science.gov (United States)

    Hu, Chaoen; Hui, Hui; Wang, Shuo; Dong, Di; Liu, Xia; Yang, Xin; Tian, Jie

    2017-03-01

    Cerebral vessel segmentation is an important step in image analysis for brain function and brain disease studies. To extract all the cerebrovascular patterns, including arteries and capillaries, some filter-based methods are used to segment vessels. However, the design of accurate and robust vessel segmentation algorithms is still challenging, due to the variety and complexity of images, especially in cerebral blood vessel segmentation. In this work, we addressed a problem of automatic and robust segmentation of cerebral micro-vessels structures in cerebrovascular images acquired by light-sheet microscope for mouse. To segment micro-vessels in large-scale image data, we proposed a convolutional neural networks (CNNs) architecture trained by 1.58 million pixels with manual label. Three convolutional layers and one fully connected layer were used in the CNNs model. We extracted a patch of size 32x32 pixels in each acquired brain vessel image as training data set to feed into CNNs for classification. This network was trained to output the probability that the center pixel of input patch belongs to vessel structures. To build the CNNs architecture, a series of mouse brain vascular images acquired from a commercial light sheet fluorescence microscopy (LSFM) system were used for training the model. The experimental results demonstrated that our approach is a promising method for effectively segmenting micro-vessels structures in cerebrovascular images with vessel-dense, nonuniform gray-level and long-scale contrast regions.

  20. Fast blood-flow simulation for large arterial trees containing thousands of vessels.

    Science.gov (United States)

    Muller, Alexandre; Clarke, Richard; Ho, Harvey

    2017-02-01

    Blood flow modelling has previously been successfully carried out in arterial trees to study pulse wave propagation using nonlinear or linear flow solvers. However, the number of vessels used in the simulations seldom grows over a few hundred. The aim of this work is to present a computationally efficient solver coupled with highly detailed arterial trees containing thousands of vessels. The core of the solver is based on a modified transmission line method, which exploits the analogy between electrical current in finite-length conductors and blood flow in vessels. The viscoelastic behaviour of the arterial-wall is taken into account using a complex elastic modulus. The flow is solved vessel by vessel in the frequency domain and the calculated output pressure is then used as an input boundary condition for daughter vessels. The computational results yield pulsatile blood pressure and flow rate for every segment in the tree. This solver is coupled with large arterial trees generated from a three-dimensional constrained constructive optimisation algorithm. The tree contains thousands of blood vessels with radii spanning ~1 mm in the root artery to ~30 μm in leaf vessels. The computation takes seconds to complete for a vasculature of 2048 vessels and less than 2 min for a vasculature of 4096 vessels on a desktop computer.

  1. Prosopomorphic vessels from Moesia Superior

    Directory of Open Access Journals (Sweden)

    Nikolić Snežana

    2008-01-01

    Full Text Available The prosopomorphic vessels from Moesia Superior had the form of beakers varying in outline but similar in size. They were wheel-thrown, mould-made or manufactured by using a combination of wheel-throwing and mould-made appliqués. Given that face vessels are considerably scarcer than other kinds of pottery, more than fifty finds from Moesia Superior make an enviable collection. In this and other provinces face vessels have been recovered from military camps, civilian settlements and necropolises, which suggests that they served more than one purpose. It is generally accepted that the faces-masks gave a protective role to the vessels, be it to protect the deceased or the family, their house and possessions. More than forty of all known finds from Moesia Superior come from Viminacium, a half of that number from necropolises. Although tangible evidence is lacking, there must have been several local workshops producing face vessels. The number and technological characteristics of the discovered vessels suggest that one of the workshops is likely to have been at Viminacium, an important pottery-making centre in the second and third centuries.

  2. Tracking filter and multi-sensor data fusion

    Indian Academy of Sciences (India)

    sensor data fusion; Kalman filtering; tracking. Abstract. In this paper factorization filtering, fusion filtering strategy and related algorithms are presented. Some results ofimplementation and validation using realistic data are given. Author Affiliations.

  3. Evaluation of official tropical cyclone track forecast over north Indian ...

    Indian Academy of Sciences (India)

    itoring forecast improvements resulting from new algorithms, techniques and observing systems;. • Evaluation of ... available forecast techniques, perhaps including stratification into different synoptic, latitudinal, or seasonal ... mentioned track forecast error measures represents an important factor in the overall decision pro-.

  4. Solar tracking system

    Science.gov (United States)

    Okandan, Murat; Nielson, Gregory N.

    2016-07-12

    Solar tracking systems, as well as methods of using such solar tracking systems, are disclosed. More particularly, embodiments of the solar tracking systems include lateral supports horizontally positioned between uprights to support photovoltaic modules. The lateral supports may be raised and lowered along the uprights or translated to cause the photovoltaic modules to track the moving sun.

  5. Game theory-based visual tracking approach focusing on color and texture features.

    Science.gov (United States)

    Jin, Zefenfen; Hou, Zhiqiang; Yu, Wangsheng; Chen, Chuanhua; Wang, Xin

    2017-07-20

    It is difficult for a single-feature tracking algorithm to achieve strong robustness under a complex environment. To solve this problem, we proposed a multifeature fusion tracking algorithm that is based on game theory. By focusing on color and texture features as two gamers, this algorithm accomplishes tracking by using a mean shift iterative formula to search for the Nash equilibrium of the game. The contribution of different features is always keeping the state of optical balance, so that the algorithm can fully take advantage of feature fusion. According to the experiment results, this algorithm proves to possess good performance, especially under the condition of scene variation, target occlusion, and similar interference.

  6. ATLAS FTK: Fast Track Trigger

    CERN Document Server

    Volpi, Guido; The ATLAS collaboration

    2015-01-01

    An overview of the ATLAS Fast Tracker processor is presented, reporting the design of the system, its expected performance, and the integration status. The next LHC runs, with a significant increase in instantaneous luminosity, will provide a big challenge to the trigger and data acquisition systems of all the experiments. An intensive use of the tracking information at the trigger level will be important to keep high efficiency in interesting events, despite the increase in multiple p-p collisions per bunch crossing (pile-up). In order to increase the use of tracks within the High Level Trigger (HLT), the ATLAS experiment planned the installation of an hardware processor dedicated to tracking: the Fast TracKer (FTK) processor. The FTK is designed to perform full scan track reconstruction at every Level-1 accept. To achieve this goal, the FTK uses a fully parallel architecture, with algorithms designed to exploit the computing power of custom VLSI chips, the Associative Memory, as well as modern FPGAs. The FT...

  7. Design of novel hybrid control solar tracking system

    Science.gov (United States)

    Chao, Jiang; Wu, Zhu; Yun, Hu Yu; Xuan, Tu Yun; Yu, Wu Jun

    2017-06-01

    This paper describes a hybrid control solar tracking system consisted of sunlight gathering platform, mechanical structure and MCU controller system which is mainly based on time and light dependent resistors module. An adaptive calibration and operating algorithm are proposed to solve accumulated error for inaccuracy sun position model and servo system error of single axis solar tracking system, which can make the focused sunlight matching the solar evacuated tube well. The proposed system and algorithm effectively will improve the utilization of solar energy.

  8. ACTS: from ATLAS software towards a common track reconstruction software

    CERN Document Server

    Gumpert, Christian; The ATLAS collaboration

    2016-01-01

    The reconstruction of charged particles trajectories is a crucial task for most particle physics experiments. The high instantaneous luminosity achieved at the LHC leads to a high number of proton-proton collisions per bunch crossing, which has put the track reconstruction software of the LHC experiments through a thorough test. Preserving track reconstruction performance under increasingly difficult experimental conditions, while keeping the usage of computational resources at a reasonable level, is an inherent problem for many HEP experiments. Exploiting concurrent algorithms and using multivariate techniques for track identification are the primary strategies to achieve that goal. Starting from current ATLAS software, the ACTS project aims to encapsulate track reconstruction software into a generic package, which can be built against the Gaudi(Hive) framework. It provides a set of high-level algorithms and data structures for performing track reconstruction tasks as well as fast track simulation. The softw...

  9. ACTS: from ATLAS software towards a common track reconstruction software

    CERN Document Server

    AUTHOR|(INSPIRE)INSPIRE-00349786; The ATLAS collaboration; Salzburger, Andreas; Kiehn, Moritz; Hrdinka, Julia; Calace, Noemi

    2017-01-01

    Reconstruction of charged particles' trajectories is a crucial task for most particle physics experiments. The high instantaneous luminosity achieved at the LHC leads to a high number of proton-proton collisions per bunch crossing, which has put the track reconstruction software of the LHC experiments through a thorough test. Preserving track reconstruction performance under increasingly difficult experimental conditions, while keeping the usage of computational resources at a reasonable level, is an inherent problem for many HEP experiments. Exploiting concurrent algorithms and using multivariate techniques for track identification are the primary strategies to achieve that goal. Starting from current ATLAS software, the ACTS project aims to encapsulate track reconstruction software into a generic, framework- and experiment-independent software package. It provides a set of high-level algorithms and data structures for performing track reconstruction tasks as well as fast track simulation. The software is de...

  10. Tracking Object Existence From an Autonomous Patrol Vehicle

    Science.gov (United States)

    Wolf, Michael; Scharenbroich, Lucas

    2011-01-01

    An autonomous vehicle patrols a large region, during which an algorithm receives measurements of detected potential objects within its sensor range. The goal of the algorithm is to track all objects in the region over time. This problem differs from traditional multi-target tracking scenarios because the region of interest is much larger than the sensor range and relies on the movement of the sensor through this region for coverage. The goal is to know whether anything has changed between visits to the same location. In particular, two kinds of alert conditions must be detected: (1) a previously detected object has disappeared and (2) a new object has appeared in a location already checked. For the time an object is within sensor range, the object can be assumed to remain stationary, changing position only between visits. The problem is difficult because the upstream object detection processing is likely to make many errors, resulting in heavy clutter (false positives) and missed detections (false negatives), and because only noisy, bearings-only measurements are available. This work has three main goals: (1) Associate incoming measurements with known objects or mark them as new objects or false positives, as appropriate. For this, a multiple hypothesis tracker was adapted to this scenario. (2) Localize the objects using multiple bearings-only measurements to provide estimates of global position (e.g., latitude and longitude). A nonlinear Kalman filter extension provides these 2D position estimates using the 1D measurements. (3) Calculate the probability that a suspected object truly exists (in the estimated position), and determine whether alert conditions have been triggered (for new objects or disappeared objects). The concept of a probability of existence was created, and a new Bayesian method for updating this probability at each time step was developed. A probabilistic multiple hypothesis approach is chosen because of its superiority in handling the

  11. Adaptive and accelerated tracking-learning-detection

    Science.gov (United States)

    Guo, Pengyu; Li, Xin; Ding, Shaowen; Tian, Zunhua; Zhang, Xiaohu

    2013-08-01

    An improved online long-term visual tracking algorithm, named adaptive and accelerated TLD (AA-TLD) based on Tracking-Learning-Detection (TLD) which is a novel tracking framework has been introduced in this paper. The improvement focuses on two aspects, one is adaption, which makes the algorithm not dependent on the pre-defined scanning grids by online generating scale space, and the other is efficiency, which uses not only algorithm-level acceleration like scale prediction that employs auto-regression and moving average (ARMA) model to learn the object motion to lessen the detector's searching range and the fixed number of positive and negative samples that ensures a constant retrieving time, but also CPU and GPU parallel technology to achieve hardware acceleration. In addition, in order to obtain a better effect, some TLD's details are redesigned, which uses a weight including both normalized correlation coefficient and scale size to integrate results, and adjusts distance metric thresholds online. A contrastive experiment on success rate, center location error and execution time, is carried out to show a performance and efficiency upgrade over state-of-the-art TLD with partial TLD datasets and Shenzhou IX return capsule image sequences. The algorithm can be used in the field of video surveillance to meet the need of real-time video tracking.

  12. Automated method for identification and artery-venous classification of vessel trees in retinal vessel networks.

    Directory of Open Access Journals (Sweden)

    Vinayak S Joshi

    Full Text Available The separation of the retinal vessel network into distinct arterial and venous vessel trees is of high interest. We propose an automated method for identification and separation of retinal vessel trees in a retinal color image by converting a vessel segmentation image into a vessel segment map and identifying the individual vessel trees by graph search. Orientation, width, and intensity of each vessel segment are utilized to find the optimal graph of vessel segments. The separated vessel trees are labeled as primary vessel or branches. We utilize the separated vessel trees for arterial-venous (AV classification, based on the color properties of the vessels in each tree graph. We applied our approach to a dataset of 50 fundus images from 50 subjects. The proposed method resulted in an accuracy of 91.44% correctly classified vessel pixels as either artery or vein. The accuracy of correctly classified major vessel segments was 96.42%.

  13. Graph Model Based Indoor Tracking

    DEFF Research Database (Denmark)

    Jensen, Christian Søndergaard; Lu, Hua; Yang, Bin

    2009-01-01

    The tracking of the locations of moving objects in large indoor spaces is important, as it enables a range of applications related to, e.g., security and indoor navigation and guidance. This paper presents a graph model based approach to indoor tracking that offers a uniform data management...... infrastructure for different symbolic positioning technologies, e.g., Bluetooth and RFID. More specifically, the paper proposes a model of indoor space that comprises a base graph and mappings that represent the topology of indoor space at different levels. The resulting model can be used for one or several...... indoor positioning technologies. Focusing on RFID-based positioning, an RFID specific reader deployment graph model is built from the base graph model. This model is then used in several algorithms for constructing and refining trajectories from raw RFID readings. Empirical studies with implementations...

  14. Pneumatic motor speed control by trajectory tracking fuzzy logic ...

    Indian Academy of Sciences (India)

    In this study, trajectory tracking fuzzy logic controller (TTFLC) is proposed for the speed control of a pneumatic motor (PM). A third order trajectory is defined to determine the trajectory function that has to be tracked by the PM speed. Genetic algorithm (GA) is used to find the TTFLC boundary values of membership functions ...

  15. 50 CFR 697.8 - Vessel identification.

    Science.gov (United States)

    2010-10-01

    ... 50 Wildlife and Fisheries 9 2010-10-01 2010-10-01 false Vessel identification. 697.8 Section 697.8 Wildlife and Fisheries FISHERY CONSERVATION AND MANAGEMENT, NATIONAL OCEANIC AND ATMOSPHERIC ADMINISTRATION....8 Vessel identification. (a) Vessel name and official number. Each fishing vessel issued a limited...

  16. Mechanosensing in developing lymphatic vessels.

    Science.gov (United States)

    Planas-Paz, Lara; Lammert, Eckhard

    2014-01-01

    The lymphatic vasculature is responsible for fluid homeostasis, transport of immune cells, inflammatory molecules, and dietary lipids. It is composed of a network of lymphatic capillaries that drain into collecting lymphatic vessels and ultimately bring fluid back to the blood circulation. Lymphatic endothelial cells (LECs) that line lymphatic capillaries present loose overlapping intercellular junctions and anchoring filaments that support fluid drainage. When interstitial fluid accumulates within tissues, the extracellular matrix (ECM) swells and pulls the anchoring filaments. This results in opening of the LEC junctions and permits interstitial fluid uptake. The absorbed fluid is then transported within collecting lymphatic vessels, which exhibit intraluminal valves that prevent lymph backflow and smooth muscle cells that sequentially contract to propel lymph.Mechanotransduction involves translation of mechanical stimuli into biological responses. LECs have been shown to sense and respond to changes in ECM stiffness, fluid pressure-induced cell stretch, and fluid flow-induced shear stress. How these signals influence LEC function and lymphatic vessel growth can be investigated by using different mechanotransduction assays in vitro and to some extent in vivo.In this chapter, we will focus on the mechanical forces that regulate lymphatic vessel expansion during embryonic development and possibly secondary lymphedema. In mouse embryos, it has been recently shown that the amount of interstitial fluid determines the extent of lymphatic vessel expansion via a mechanosensory complex formed by β1 integrin and vascular endothelial growth factor receptor-3 (VEGFR3). This model might as well apply to secondary lymphedema.

  17. Tracking particles by passing messages between images

    Energy Technology Data Exchange (ETDEWEB)

    Chertkov, Michael [Los Alamos National Laboratory; Kroc, Lukas [Los Alamos National Laboratory; Zdeborova, Lenka [Los Alamos National Laboratory; Krakala, Florent [ESPCI; Vergassola, M [CNRS

    2009-01-01

    Methods to extract information from the tracking of mobile objects/particles have broad interest in biological and physical sciences. Techniques based on the simple criterion of proximity in time-consecutive snapshots are useful to identify the trajectories of the particles. However, they become problematic as the motility and/or the density of the particles increases because of the uncertainties on the trajectories that particles have followed during the acquisition time of the images. Here, we report efficient methods for learning parameters of the dynamics of the particles from their positions in time-consecutive images. Our algorithm belongs to the class of message-passing algorithms, also known in computer science, information theory and statistical physics under the name of Belief Propagation (BP). The algorithm is distributed, thus allowing parallel implementation suitable for computations on multiple machines without significant inter-machine overhead. We test our method on the model example of particle tracking in turbulent flows, which is particularly challenging due to the strong transport that those flows produce. Our numerical experiments show that the BP algorithm compares in quality with exact Markov Chain Monte-Carlo algorithms, yet BP is far superior in speed. We also suggest and analyze a random-distance model that provides theoretical justification for BP accuracy. Methods developed here systematically formulate the problem of particle tracking and provide fast and reliable tools for its extensive range of applications.

  18. Radar tracking of multitarget complexes using Hough transforms

    Science.gov (United States)

    Copie, Thierry B.; Jacobson, William J.; Payson, Harold C.

    1996-06-01

    An important function for a fire control radar consists of the simultaneous tracking of multiple objects in a missile complex. A challenging tracking scenario is encountered when dense clusters of targets are viewed at large stand-off ranges. In this case, multiple target detections are found within a single radar beam. Because such highly populated complexes are not resolved in angle (azimuth, elevation), separation of the individual objects must rely on the use of wideband waveforms with good range resolution. A multi-object tracking algorithm suitable for real-time implementation has been designed to exploit range-only correlations. Good track initiation efficiency is achieved through the use of short radar observation times combined with applications of Hough transforms. Tracking filters are subsequently used to update all existing tracks with metrics and signature histories. A brief description of the algorithm is presented with focus on the specific tracking techniques appropriate for dense clusters of slowly separating objects on ballistic trajectories. The performance of the tracking algorithm has been evaluated and results are presented for several tracking strategies and different radar sampling rates.

  19. Innovative control systems for tracked vehicle platforms

    CERN Document Server

    2014-01-01

     This book has been motivated by an urgent need for designing and implementation of innovative control algorithms and systems for tracked vehicles. Nowadays the unmanned vehicles are becoming more and more common. Therefore there is a need for innovative mechanical constructions capable of adapting to various applications regardless the ground, air or water/underwater environment. There are multiple various activities connected with tracked vehicles. They can be distributed among three main groups: design and control algorithms, sensoric and vision based in-formation, construction and testing mechanical parts of unmanned vehicles. Scientists and researchers involved in mechanics, control algorithms, image processing, computer vision, data fusion, or IC will find this book useful.

  20. Tracked robot controllers for climbing obstacles autonomously

    Science.gov (United States)

    Vincent, Isabelle

    2009-05-01

    Research in mobile robot navigation has demonstrated some success in navigating flat indoor environments while avoiding obstacles. However, the challenge of analyzing complex environments to climb obstacles autonomously has had very little success due to the complexity of the task. Unmanned ground vehicles currently exhibit simple autonomous behaviours compared to the human ability to move in the world. This paper presents the control algorithms designed for a tracked mobile robot to autonomously climb obstacles by varying its tracks configuration. Two control algorithms are proposed to solve the autonomous locomotion problem for climbing obstacles. First, a reactive controller evaluates the appropriate geometric configuration based on terrain and vehicle geometric considerations. Then, a reinforcement learning algorithm finds alternative solutions when the reactive controller gets stuck while climbing an obstacle. The methodology combines reactivity to learning. The controllers have been demonstrated in box and stair climbing simulations. The experiments illustrate the effectiveness of the proposed approach for crossing obstacles.

  1. Grounding Damage to Conventional Vessels

    DEFF Research Database (Denmark)

    Lützen, Marie; Simonsen, Bo Cerup

    2003-01-01

    regulations for design of bottom compartment layout with regard to grounding damages are largely based on statistical damage data. New and updated damage statistics holding 930 grounding accident records has been investigated. The bottom damage statistics is compared to current regulations for the bottom......The present paper is concerned with rational design of conventional vessels with regard to bottom damage generated in grounding accidents. The aim of the work described here is to improve the design basis, primarily through analysis of new statistical data for grounding damage. The current...... for the relation between the amount of deformed structure and the energy absorption. Finally, the paper shows how damage statistics for existing, conventional vessels can be used together with theoretical prediction methods for determining grounding damage distributions for new vessel types not included...

  2. 19 CFR 4.5 - Government vessels.

    Science.gov (United States)

    2010-04-01

    ... 19 Customs Duties 1 2010-04-01 2010-04-01 false Government vessels. 4.5 Section 4.5 Customs Duties... VESSELS IN FOREIGN AND DOMESTIC TRADES Arrival and Entry of Vessels § 4.5 Government vessels. (a) No... that is the property of, the U.S. Department of Defense (DoD) will be treated as a Government vessel...

  3. TPC track distortions III: fiat lux

    CERN Document Server

    Boyko, I; Dydak, F; Elagin, A; Gostkin, M; Guskov, A; Koreshev, V; Nefedov, Y; Nikolaev, K; Veenhof, R; Wotschack, J; Zhemchugov, A

    2005-01-01

    We present a comprehensive overview and final summary of all four types of static track distortions seen in the HARP TPC, in terms of physical origins, mathematical modelling, and correction algorithms. 'Static'™ distortions are defined as not depending on the event time within the 400 ms long accelerator spill. Calculated static distortions are compared with measurements from cosmic-muon tracks. We characterize track distortions by the r phi residuals of cluster positions with respect to the transverse projection of a helical trajectory constrained by hits in the RPC overlap regions. This method provides a fixed TPC-external reference system (by contrast to the co-moving coordinate system associated with a fit) which solely permits to identify individually, and measure quantitatively, the static TPC track distortions arising from (i) the inhomogeneity of the solenoidal magnetic field, (ii) the inhomogeneity of the electric field from the high-voltage mismatch between the inner and outer TPC field cages, (...

  4. [Pulmonary blood vessels in goats].

    Science.gov (United States)

    Roos, H; Hegner, K; Vollmerhaus, B

    1999-05-01

    The blood vessels in the lung of the goat, which until now have received little attention, are described in detail for the first time. With regard to the segments of the lung, blood vessels are bronchovascular units in the lobi craniales, lobus medius and lobus accessorius, but bronchoartery units in the lobi caudales. We investigated the types of branches of the Aa. pulmonales dextra et sinistra, the inter- and intraspecific principles of the outlet of the pulmonary veins and the importance of bronchopulmonary segmentation of the lungs.

  5. Calculating track thrust with track functions

    Science.gov (United States)

    Chang, Hsi-Ming; Procura, Massimiliano; Thaler, Jesse; Waalewijn, Wouter J.

    2013-08-01

    In e+e- event shapes studies at LEP, two different measurements were sometimes performed: a “calorimetric” measurement using both charged and neutral particles and a “track-based” measurement using just charged particles. Whereas calorimetric measurements are infrared and collinear safe, and therefore calculable in perturbative QCD, track-based measurements necessarily depend on nonperturbative hadronization effects. On the other hand, track-based measurements typically have smaller experimental uncertainties. In this paper, we present the first calculation of the event shape “track thrust” and compare to measurements performed at ALEPH and DELPHI. This calculation is made possible through the recently developed formalism of track functions, which are nonperturbative objects describing how energetic partons fragment into charged hadrons. By incorporating track functions into soft-collinear effective theory, we calculate the distribution for track thrust with next-to-leading logarithmic resummation. Due to a partial cancellation between nonperturbative parameters, the distributions for calorimeter thrust and track thrust are remarkably similar, a feature also seen in LEP data.

  6. Combinatorial algorithms

    CERN Document Server

    Hu, T C

    2002-01-01

    Newly enlarged, updated second edition of a valuable text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discusses binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. 153 black-and-white illus. 23 tables.Newly enlarged, updated second edition of a valuable, widely used text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discussed are binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. New to this edition: Chapter 9

  7. Decision-Directed Recursive Least Squares MIMO Channels Tracking

    Directory of Open Access Journals (Sweden)

    2006-01-01

    Full Text Available A new approach for joint data estimation and channel tracking for multiple-input multiple-output (MIMO channels is proposed based on the decision-directed recursive least squares (DD-RLS algorithm. RLS algorithm is commonly used for equalization and its application in channel estimation is a novel idea. In this paper, after defining the weighted least squares cost function it is minimized and eventually the RLS MIMO channel estimation algorithm is derived. The proposed algorithm combined with the decision-directed algorithm (DDA is then extended for the blind mode operation. From the computational complexity point of view being O3 versus the number of transmitter and receiver antennas, the proposed algorithm is very efficient. Through various simulations, the mean square error (MSE of the tracking of the proposed algorithm for different joint detection algorithms is compared with Kalman filtering approach which is one of the most well-known channel tracking algorithms. It is shown that the performance of the proposed algorithm is very close to Kalman estimator and that in the blind mode operation it presents a better performance with much lower complexity irrespective of the need to know the channel model.

  8. Decision-Directed Recursive Least Squares MIMO Channels Tracking

    Directory of Open Access Journals (Sweden)

    Karami Ebrahim

    2006-01-01

    Full Text Available A new approach for joint data estimation and channel tracking for multiple-input multiple-output (MIMO channels is proposed based on the decision-directed recursive least squares (DD-RLS algorithm. RLS algorithm is commonly used for equalization and its application in channel estimation is a novel idea. In this paper, after defining the weighted least squares cost function it is minimized and eventually the RLS MIMO channel estimation algorithm is derived. The proposed algorithm combined with the decision-directed algorithm (DDA is then extended for the blind mode operation. From the computational complexity point of view being versus the number of transmitter and receiver antennas, the proposed algorithm is very efficient. Through various simulations, the mean square error (MSE of the tracking of the proposed algorithm for different joint detection algorithms is compared with Kalman filtering approach which is one of the most well-known channel tracking algorithms. It is shown that the performance of the proposed algorithm is very close to Kalman estimator and that in the blind mode operation it presents a better performance with much lower complexity irrespective of the need to know the channel model.

  9. Global tracking of space debris via CPHD and consensus

    Science.gov (United States)

    Wei, Baishen; Nener, Brett; Liu, Weifeng; Ma, Liang

    2017-05-01

    Space debris tracking is of great importance for safe operation of spacecraft. This paper presents an algorithm that achieves global tracking of space debris with a multi-sensor network. The sensor network has unknown and possibly time-varying topology. A consensus algorithm is used to effectively counteract the effects of data incest. Gaussian Mixture-Cardinalized Probability Hypothesis Density (GM-CPHD) filtering is used to estimate the state of the space debris. As an example of the method, 45 clusters of sensors are used to achieve global tracking. The performance of the proposed approach is demonstrated by simulation experiments.

  10. 3D particle tracking velocimetry using dynamic discrete tomography

    DEFF Research Database (Denmark)

    Alpers, Andreas; Gritzmann, Peter; Moseev, Dmitry

    2015-01-01

    Particle tracking velocimetry in 3D is becoming an increasingly important imaging tool in the study of fluid dynamics and combustion as well as plasmas. We introduce a dynamic discrete tomography algorithm for reconstructing particle trajectories from projections. The algorithm is efficient for d...

  11. 3D particle tracking velocimetry using dynamic discrete tomography

    NARCIS (Netherlands)

    Alpers, A.; Gritzmann, P.; Moseev, D.; Salewski, M.

    2015-01-01

    Particle tracking velocimetry in 3D is becoming an increasingly important imaging tool in the study of fluid dynamics and combustion as well as plasmas. We introduce a dynamic discrete tomography algorithm for reconstructing particle trajectories from projections. The algorithm is efficient for data

  12. Comparative analysis of methods for extracting vessel network on breast MRI images

    Science.gov (United States)

    Gaizer, Bence T.; Vassiou, Katerina G.; Lavdas, Eleftherios; Arvanitis, Dimitrios L.; Fezoulidis, Ioannis V.; Glotsos, Dimitris T.

    2017-11-01

    Digital processing of MRI images aims to provide an automatized diagnostic evaluation of regular health screenings. Cancerous lesions are proven to cause an alteration in the vessel structure of the diseased organ. Currently there are several methods used for extraction of the vessel network in order to quantify its properties. In this work MRI images (Signa HDx 3.0T, GE Healthcare, courtesy of University Hospital of Larissa) of 30 female breasts were subjected to three different vessel extraction algorithms to determine the location of their vascular network. The first method is an experiment to build a graph over known points of the vessel network; the second algorithm aims to determine the direction and diameter of vessels at these points; the third approach is a seed growing algorithm, spreading selection to neighbors of the known vessel pixels. The possibilities shown by the different methods were analyzed, and quantitative measurements were performed. The data provided by these measurements showed no clear correlation with the presence or malignancy of tumors, based on the radiological diagnosis of skilled physicians.

  13. The use of cell phone network data in traffic data collection and long-haul truckshed (geographic extent) tracking.

    Science.gov (United States)

    2012-12-01

    This study analyzed the potential of cell phone positioning techniques in freight truck data collection and long-haul : truckshed (geographic extent) tracking. Freight truck identification and tracking algorithms were developed by means of : cell pho...

  14. Real-time seam tracking for robotic laser welding using trajectory-based control

    NARCIS (Netherlands)

    de Graaf, M.W.; Aarts, Ronald G.K.M.; Jonker, Jan B.; Meijer, J.

    2010-01-01

    In this paper a real-time seam tracking algorithm is proposed that can cope with the accuracy demands of robotic laser welding. A trajectory-based control architecture is presented, which had to be developed for this seam tracking algorithm. Cartesian locations (position and orientation) are added

  15. A Benchmark and Simulator for UAV Tracking

    KAUST Repository

    Mueller, Matthias

    2016-09-16

    In this paper, we propose a new aerial video dataset and benchmark for low altitude UAV target tracking, as well as, a photorealistic UAV simulator that can be coupled with tracking methods. Our benchmark provides the first evaluation of many state-of-the-art and popular trackers on 123 new and fully annotated HD video sequences captured from a low-altitude aerial perspective. Among the compared trackers, we determine which ones are the most suitable for UAV tracking both in terms of tracking accuracy and run-time. The simulator can be used to evaluate tracking algorithms in real-time scenarios before they are deployed on a UAV “in the field”, as well as, generate synthetic but photo-realistic tracking datasets with automatic ground truth annotations to easily extend existing real-world datasets. Both the benchmark and simulator are made publicly available to the vision community on our website to further research in the area of object tracking from UAVs. (https://ivul.kaust.edu.sa/Pages/pub-benchmark-simulator-uav.aspx.). © Springer International Publishing AG 2016.

  16. Shadowgraph Technique Applied to STARDUST Facility for Dust Tracking: First Results

    Science.gov (United States)

    Gaudio, P.; Malizia, A.; Camplani, M.; Barbato, F.; Antonelli, L.; Gelfusa, M.; Del Vecchio, M.; Salgado, L.; Bellecci, C.; Richetta, M.

    The problem of dust resuspension in case of Loss Of Vacuum Accident (LOVA) in a nuclear fusion plant (ITER or DEMO like) is an important issue for the safety of workers and the security of environment. The Quantum Electronics and Plasma Physics Research Group has implemented an optical set-up to track dust during a LOVA reproduction inside the experimental facility STARDUST. The shadowgraph technique, in this work, it is applied to track dark dust (like Tungsten). The shadowgraph technique is based on an expanded collimated beam of light emitted by a laser (or a lamp) transversely to the flow field direction. Inside STARDUST the dust moving in the air flow causes variations of refractive index of light that can be detected by the means of a CCD camera. A spatial modulation of the light-intensity distribution on the camera can be measured. The resulting pattern is a shadow of the refractive index field that prevails in the region of the disturbance. The authors use an incandescent white lamp to illuminate the vacuum vessel of STARDUST facility. The light-area passes through the test section that has to be investigated and the images of the dust shadows are collected with a fast CCD camera. The images are then elaborated with mathematical algorithms to obtain information about the velocity fields of dust during the accidents reproduction. The experimental set-up together with a critical analysis of the first results are presented in this paper.

  17. Renewable Energy Tracking Systems

    Science.gov (United States)

    Renewable energy generation ownership can be accounted through tracking systems. Tracking systems are highly automated, contain specific information about each MWh, and are accessible over the internet to market participants.

  18. Commercial Passenger Fishing Vessel Fishery

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains the logbook data from U.S.A. Commercial Passenger Fishing Vessels (CPFV) fishing in the U.S.A. EEZ and in waters off of Baja California, from...

  19. Pressure vessel and method therefor

    Energy Technology Data Exchange (ETDEWEB)

    Saunders, Timothy

    2017-09-05

    A pressure vessel includes a pump having a passage that extends between an inlet and an outlet. A duct at the pump outlet includes at least one dimension that is adjustable to facilitate forming a dynamic seal that limits backflow of gas through the passage.

  20. BPC 157 and blood vessels.

    Science.gov (United States)

    Seiwerth, Sven; Brcic, Luka; Vuletic, Lovorka Batelja; Kolenc, Danijela; Aralica, Gorana; Misic, Marija; Zenko, Anita; Drmic, Domagoj; Rucman, Rudolf; Sikiric, Predrag

    2014-01-01

    This review focuses on the described effects of BPC 157 on blood vessels after different types of damage, and elucidate by investigating different aspects of vascular response to injury (endothelium damage, clotting, thrombosis, vasoconstriction, vasodilatation, vasculoneogenesis and edema formation) especially in connection to the healing processes. In this respect, BPC 157 was concluded to be the most potent angiomodulatory agent, acting through different vasoactive pathways and systems (e.g. NO, VEGF, FAK) and leading to optimization of the vascular response followed, as it has to be expected, by optimization of the healing process. Formation of new blood vessels involves two main, partly overlapping mechanisms, angiogenesis and vasculogenesis. The additional mechanism of arteriogenesis is involved in the formation of collaterals. In conjunction with blood vessel function, we at least have to consider leakage of fluid/proteins/plasma, resulting in edema/exudate formation as well as thrombogenesis. Blood vessels are also strongly involved in tumor biology. In this aspect, we have neoangiogenesis resulting in pathological vascularization, vascular invasion resulting in release of metastatic cells and the phenomenon of homing resulting in formation of secondary tumors--metastases.