A Fast MEANSHIFT Algorithm-Based Target Tracking System
Sun, Jian
2012-01-01
Tracking moving targets in complex scenes using an active video camera is a challenging task. Tracking accuracy and efficiency are two key yet generally incompatible aspects of a Target Tracking System (TTS). A compromise scheme will be studied in this paper. A fast mean-shift-based Target Tracking scheme is designed and realized, which is robust to partial occlusion and changes in object appearance. The physical simulation shows that the image signal processing speed is >50 frame/s. PMID:22969397
Fast randomized Hough transformation track initiation algorithm based on multi-scale clustering
NASA Astrophysics Data System (ADS)
Wan, Minjie; Gu, Guohua; Chen, Qian; Qian, Weixian; Wang, Pengcheng
2015-10-01
A fast randomized Hough transformation track initiation algorithm based on multi-scale clustering is proposed to overcome existing problems in traditional infrared search and track system(IRST) which cannot provide movement information of the initial target and select the threshold value of correlation automatically by a two-dimensional track association algorithm based on bearing-only information . Movements of all the targets are presumed to be uniform rectilinear motion throughout this new algorithm. Concepts of space random sampling, parameter space dynamic linking table and convergent mapping of image to parameter space are developed on the basis of fast randomized Hough transformation. Considering the phenomenon of peak value clustering due to shortcomings of peak detection itself which is built on threshold value method, accuracy can only be ensured on condition that parameter space has an obvious peak value. A multi-scale idea is added to the above-mentioned algorithm. Firstly, a primary association is conducted to select several alternative tracks by a low-threshold .Then, alternative tracks are processed by multi-scale clustering methods , through which accurate numbers and parameters of tracks are figured out automatically by means of transforming scale parameters. The first three frames are processed by this algorithm in order to get the first three targets of the track , and then two slightly different gate radius are worked out , mean value of which is used to be the global threshold value of correlation. Moreover, a new model for curvilinear equation correction is applied to the above-mentioned track initiation algorithm for purpose of solving the problem of shape distortion when a space three-dimensional curve is mapped to a two-dimensional bearing-only space. Using sideways-flying, launch and landing as examples to build models and simulate, the application of the proposed approach in simulation proves its effectiveness , accuracy , and adaptivity
Fast parallel tracking algorithm for the muon detector of the CBM experiment at fair
NASA Astrophysics Data System (ADS)
Lebedev, A.; Höhne, C.; Kisel, I.; Ososkov, G.
2010-07-01
Particle trajectory recognition is an important and challenging task in the Compressed Baryonic Matter (CBM) experiment at the future FAIR accelerator at Darmstadt. The tracking algorithms have to process terabytes of input data produced in particle collisions. Therefore, the speed of the tracking software is extremely important for data analysis. In this contribution, a fast parallel track reconstruction algorithm which uses available features of modern processors is presented. These features comprise a SIMD instruction set (SSE) and multithreading. The first allows one to pack several data items into one register and to operate on all of them in parallel thus achieving more operations per cycle. The second feature enables the routines to exploit all available CPU cores and hardware threads. This parallel version of the tracking algorithm has been compared to the initial serial scalar version which uses a similar approach for tracking. A speed-up factor of 487 was achieved (from 730 to 1.5 ms/event) for a computer with 2 × Intel Core i7 processors at 2.66 GHz.
Pimentel, J A; Carneiro, J; Darszon, A; Corkidi, G
2012-01-01
Recent advances in microscopy and cytolabelling methods enable the real time imaging of cells as they move and interact in their real physiological environment. Scenarios in which multiple cells move autonomously in all directions are not uncommon in biology. A remarkable example is the swimming of marine spermatozoa in search of the conspecific oocyte. Imaging cells in these scenarios, particularly when they move fast and are poorly labelled or even unlabelled requires very fast three-dimensional time-lapse (3D+t) imaging. This 3D+t imaging poses challenges not only to the acquisition systems but also to the image analysis algorithms. It is in this context that this work describes an original automated multiparticle segmentation method to analyse motile translucent cells in 3D microscopical volumes. The proposed segmentation technique takes advantage of the way the cell appearance changes with the distance to the focal plane position. The cells translucent properties and their interaction with light produce a specific pattern: when the cell is within or close to the focal plane, its two-dimensional (2D) appearance matches a bright spot surrounded by a dark ring, whereas when it is farther from the focal plane the cell contrast is inverted looking like a dark spot surrounded by a bright ring. The proposed method analyses the acquired video sequence frame-by-frame taking advantage of 2D image segmentation algorithms to identify and select candidate cellular sections. The crux of the method is in the sequential filtering of the candidate sections, first by template matching of the in-focus and out-of-focus templates and second by considering adjacent candidates sections in 3D. These sequential filters effectively narrow down the number of segmented candidate sections making the automatic tracking of cells in three dimensions a straightforward operation. PMID:21999166
NASA Astrophysics Data System (ADS)
Wei, X.; Li, B.; Chen, N.; Wang, J.; Zheng, R.; Gao, W.; Wei, T.; Gao, D.; Hu, Y.
2014-08-01
CMOS pixel sensors (CPS) are attractive for use in the innermost particle detectors for charged particle tracking due to their good trade-off between spatial resolution, material budget, radiation hardness, and readout speed. With the requirements of high readout speed and high radiation hardness to total ionizing dose (TID) for particle tracking, fast readout CPS are composed by integrating a data compression block and two SRAM IP cores. However, the radiation hardness of the SRAM IP cores is not as high as that of the other parts in CPS, and thus the radiation hardness of the whole CPS chip is lowered. Especially, when CPS are migrated into 0.18-μm processes, the single event upset (SEU) effects should be also considered besides TID and single event latchup (SEL) effects. This paper presents a radiation-hardened SRAM with enhanced radiation hardness to SEU. An error detection and correction (EDAC) algorithm and a bit-interleaving storage strategy are adopted in the design. The prototype design has been fabricated in a 0.18-μm process. The area of the new SRAM is increased 1.6 times as compared with a non-radiation-hardened SRAM due to the integration of EDAC algorithm and the adoption of radiation hardened layout. The access time is increased from 5 ns to 8 ns due to the integration of EDAC algorithm. The test results indicate that the design satisfy requirements of CPS for charged particle tracking.
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. PMID:26352631
Large scale tracking algorithms.
Hansen, Ross L.; Love, Joshua Alan; Melgaard, David Kennett; Karelitz, David B.; Pitts, Todd Alan; Zollweg, Joshua David; Anderson, Dylan Z.; Nandy, Prabal; Whitlow, Gary L.; Bender, Daniel A.; Byrne, Raymond Harry
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.
Fast tracking hospital construction.
Quirk, Andrew
2013-03-01
Hospital leaders should consider four factors in determining whether to fast track a hospital construction project: Expectations of project length, quality, and cost. Whether decisions can be made quickly as issues arise. Their own time commitment to the project, as well as that of architects, engineers, construction managers, and others. The extent to which they are willing to share with the design and construction teams how and why decisions are being made. PMID:23513759
NASA Technical Reports Server (NTRS)
1996-01-01
The NASA Fast Track Study supports the efforts of a Special Study Group (SSG) made up of members of the Advanced Project Management Class number 23 (APM-23) that met at the Wallops Island Management Education Center from April 28 - May 8, 1996. Members of the Class expressed interest to Mr. Vem Weyers in having an input to the NASA Policy Document (NPD) 7120.4, that will replace NASA Management Institute (NMI) 7120.4, and the NASA Program/Project Management Guide. The APM-23 SSG was tasked with assisting in development of NASA policy on managing Fast Track Projects, defined as small projects under $150 million and completed within three years. 'Me approach of the APM-23 SSG was to gather data on successful projects working in a 'Better, Faster, Cheaper' environment, within and outside of NASA and develop the Fast Track Project section of the NASA Program/Project Management Guide. Fourteen interviews and four other data gathering efforts were conducted by the SSG, and 16 were conducted by Strategic Resources, Inc. (SRI), including five interviews at the Jet Propulsion Laboratory (JPL) and one at the Applied Physics Laboratory (APL). The interviews were compiled and analyzed for techniques and approaches commonly used to meet severe cost and schedule constraints.
A fast meteor detection algorithm
NASA Astrophysics Data System (ADS)
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.
NASA Astrophysics Data System (ADS)
Owen, Mark W.; Stubberud, Allen R.
2003-12-01
Highly maneuvering threats are a major concern for the Navy and the DoD and the technology discussed in this paper is intended to help address this issue. A neural extended Kalman filter algorithm has been embedded in an interacting multiple model architecture for target tracking. The neural extended Kalman filter algorithm is used to improve motion model prediction during maneuvers. With a better target motion mode, noise reduction can be achieved through a maneuver. Unlike the interacting multiple model architecture which uses a high process noise model to hold a target through a maneuver with poor velocity and acceleration estimates, a neural extended Kalman filter is used to predict corrections to the velocity and acceleration states of a target through a maneuver. The neural extended Kalman filter estimates the weights of a neural network, which in turn are used to modify the state estimate predictions of the filter as measurements are processed. The neural network training is performed on-line as data is processed. In this paper, the simulation results of a tracking problem using a neural extended Kalman filter embedded in an interacting multiple model tracking architecture are shown. Preliminary results on the 2nd Benchmark Problem are also given.
NASA Astrophysics Data System (ADS)
Owen, Mark W.; Stubberud, Allen R.
2004-01-01
Highly maneuvering threats are a major concern for the Navy and the DoD and the technology discussed in this paper is intended to help address this issue. A neural extended Kalman filter algorithm has been embedded in an interacting multiple model architecture for target tracking. The neural extended Kalman filter algorithm is used to improve motion model prediction during maneuvers. With a better target motion mode, noise reduction can be achieved through a maneuver. Unlike the interacting multiple model architecture which uses a high process noise model to hold a target through a maneuver with poor velocity and acceleration estimates, a neural extended Kalman filter is used to predict corrections to the velocity and acceleration states of a target through a maneuver. The neural extended Kalman filter estimates the weights of a neural network, which in turn are used to modify the state estimate predictions of the filter as measurements are processed. The neural network training is performed on-line as data is processed. In this paper, the simulation results of a tracking problem using a neural extended Kalman filter embedded in an interacting multiple model tracking architecture are shown. Preliminary results on the 2nd Benchmark Problem are also given.
TrackEye tracking algorithm characterization
NASA Astrophysics Data System (ADS)
Valley, Michael T.; Shields, Robert W.; Reed, Jack M.
2004-10-01
TrackEye is a film digitization and target tracking system that offers the potential for quantitatively measuring the dynamic state variables (e.g., absolute and relative position, orientation, linear and angular velocity/acceleration, spin rate, trajectory, angle of attack, etc.) for moving objects using captured single or dual view image sequences. At the heart of the system is a set of tracking algorithms that automatically find and quantify the location of user selected image details such as natural test article features or passive fiducials that have been applied to cooperative test articles. This image position data is converted into real world coordinates and rates with user specified information such as the image scale and frame rate. Though tracking methods such as correlation algorithms are typically robust by nature, the accuracy and suitability of each TrackEye tracking algorithm is in general unknown even under good imaging conditions. The challenges of optimal algorithm selection and algorithm performance/measurement uncertainty are even more significant for long range tracking of high-speed targets where temporally varying atmospheric effects degrade the imagery. This paper will present the preliminary results from a controlled test sequence used to characterize the performance of the TrackEye tracking algorithm suite.
TrackEye tracking algorithm characterization.
Reed, Jack W.; Shields, Rob W; Valley, Michael T.
2004-08-01
TrackEye is a film digitization and target tracking system that offers the potential for quantitatively measuring the dynamic state variables (e.g., absolute and relative position, orientation, linear and angular velocity/acceleration, spin rate, trajectory, angle of attack, etc.) for moving objects using captured single or dual view image sequences. At the heart of the system is a set of tracking algorithms that automatically find and quantify the location of user selected image details such as natural test article features or passive fiducials that have been applied to cooperative test articles. This image position data is converted into real world coordinates and rates with user specified information such as the image scale and frame rate. Though tracking methods such as correlation algorithms are typically robust by nature, the accuracy and suitability of each TrackEye tracking algorithm is in general unknown even under good imaging conditions. The challenges of optimal algorithm selection and algorithm performance/measurement uncertainty are even more significant for long range tracking of high-speed targets where temporally varying atmospheric effects degrade the imagery. This paper will present the preliminary results from a controlled test sequence used to characterize the performance of the TrackEye tracking algorithm suite.
Tracking filter algorithm for automatic video tracking
NASA Astrophysics Data System (ADS)
McEver, Mark A.; Kimbrell, James E.
2006-05-01
In addition to servo control and power amplification, motion control systems for optical tracking pedestals feature capabilities such as electro-optical tracking using an integrated Automatic Video Tracker (AVT) card. An electro-optical system tracking loop is comprised of sensors mounted on a pointing pedestal, an AVT that detects a target in the sensor imagery, and a tracking filter algorithm that commands the pedestal to follow the target. The tracking filter algorithm receives the target boresight error from the AVT and calculates motion demands for the pedestal servo controller. This paper presents a tracking algorithm based on target state estimation using a Kalman filter. The servo demands are based on calculating the Kalman filter state estimate from absolute line-of-sight angles to the target. Simulations are used to compare its performance to tracking loops without tracking filters, and to other tracking filter algorithms, such as rate feedback loops closed around boresight error. Issues such as data latency and sensor alignment error are discussed.
Fast-Tracking Colostomy Closures.
Nanavati, Aditya J; Prabhakar, Subramaniam
2015-12-01
There have been very few studies on applying fast-track principles to colostomy closures. We believe that outcome may be significantly improved with multimodal interventions in the peri-operative care of patients undergoing this procedure. A retrospective study was carried out comparing patients who had undergone colostomy closures by the fast-track and traditional care protocols at our centre. We intended to analyse peri-operative period and recovery in colostomy closures to confirm that fast-track surgery principles improved outcomes. Twenty-six patients in the fast-track arm and 24 patients in the traditional care arm had undergone colostomy closures. Both groups were comparable in terms of their baseline parameters. Patients in the fast-track group were ambulatory and accepted oral feeding earlier. There was a significant reduction in the duration of stay (4.73 ± 1.43 days vs. 7.21 ± 1.38 days, p = 0.0000). We did not observe a rise in complications or 30-day re-admissions. Fast-track surgery can safely be applied to colostomy closures. It shows earlier ambulation and reduction in length of hospital stay. PMID:27011527
Fast SIMDized Kalman filter based track fit
NASA Astrophysics Data System (ADS)
Gorbunov, S.; Kebschull, U.; Kisel, I.; Lindenstruth, V.; Müller, W. F. J.
2008-03-01
Modern high energy physics experiments have to process terabytes of input data produced in particle collisions. The core of many data reconstruction algorithms in high energy physics is the Kalman filter. Therefore, the speed of Kalman filter based algorithms is of crucial importance in on-line data processing. This is especially true for the combinatorial track finding stage where the Kalman filter based track fit is used very intensively. Therefore, developing fast reconstruction algorithms, which use maximum available power of processors, is important, in particular for the initial selection of events which carry signals of interesting physics. One of such powerful feature supported by almost all up-to-date PC processors is a SIMD instruction set, which allows packing several data items in one register and to operate on all of them, thus achieving more operations per clock cycle. The novel Cell processor extends the parallelization further by combining a general-purpose PowerPC processor core with eight streamlined coprocessing elements which greatly accelerate vector processing applications. In the investigation described here, after a significant memory optimization and a comprehensive numerical analysis, the Kalman filter based track fitting algorithm of the CBM experiment has been vectorized using inline operator overloading. Thus the algorithm continues to be flexible with respect to any CPU family used for data reconstruction. Because of all these changes the SIMDized Kalman filter based track fitting algorithm takes 1 μs per track that is 10000 times faster than the initial version. Porting the algorithm to a Cell Blade computer gives another factor of 10 of the speedup. Finally, we compare performance of the tracking algorithm running on three different CPU architectures: Intel Xeon, AMD Opteron and Cell Broadband Engine.
Fast-Track Teacher Recruitment.
ERIC Educational Resources Information Center
Grant, Franklin Dean
2001-01-01
Schools need a Renaissance human-resources director to implement strategic staffing and fast-track teacher-recruitment plans. The HR director must attend to customer satisfaction, candidate supply, web-based recruitment possibilities, stabilization of newly hired staff, retention of veteran staff, utilization of retired employees, and latest…
Fast tracking using edge histograms
NASA Astrophysics Data System (ADS)
Rokita, Przemyslaw
1997-04-01
This paper proposes a new algorithm for tracking objects and objects boundaries. This algorithm was developed and applied in a system used for compositing computer generated images and real world video sequences, but can be applied in general in all tracking systems where accuracy and high processing speed are required. The algorithm is based on analysis of histograms obtained by summing along chosen axles pixels of edge segmented images. Edge segmentation is done by spatial convolution using gradient operator. The advantage of such an approach is that it can be performed in real-time using available on the market hardware convolution filters. After edge extraction and histograms computation, respective positions of maximums in edge intensity histograms, in current and previous frame, are compared and matched. Obtained this way information about displacement of histograms maximums, can be directly converted into information about changes of target boundaries positions along chosen axles.
Gricius, Robert F; Wong, Douglas
2016-01-01
Hospitals that are newly qualified for the 340B Drug Pricing Program may have an opportunity for fast-track approval to participate in the program. Three steps are required to seize this opportunity: Use data analytics to assess current and future percentages of Medicaid utilization and eligibility for federal SSI cash benefits. Determine the feasibility of early cost report filing. Prepare appropriate documentation and undertake the initial enrollment process. PMID:26863836
PUBLISHER'S ANNOUNCEMENT: Fast Track Communications
NASA Astrophysics Data System (ADS)
Wald, Robert; Adams, Judith
2006-12-01
We are very pleased to announce that Classical and Quantum Gravity will launch a new Fast Track Communications section from January 2007, after which date Letters to the Editor will no longer be published. Fast Track Communications (FTCs) are short, timely papers presenting only the most important new developments. To reflect their high significance FTCs will be published at the front of the journal and will be freely available online to ensure the widest visibility. As with all articles submitted to Classical and Quantum Gravity, there are no page charges, including online colour reproduction and multi-media attachments. Authors who wish to include colour in the print version of their article will, however, be required to cover the costs. Submissions to the new Fast Track Communications section are very welcome. For details of how to submit an FTC please visit IOP Publishing's webpages http://authors.iop.org, or contact the journal at cqg@iop.org. To facilitate refereeing, authors are asked to submit a short statement accompanying their FTC, outlining why they feel that the article merits high-priority publication. Length restrictions will also be applied such that FTCs should be a maximum of 8 journal pages (5000 words) in length. The section will aim to be a high-quality, high-profile outlet for new and important research of interest to the Classical and Quantum Gravity community. We look forward to seeing it grow and take shape over the next year.
Knowledge-based tracking algorithm
NASA Astrophysics Data System (ADS)
Corbeil, Allan F.; Hawkins, Linda J.; Gilgallon, Paul F.
1990-10-01
This paper describes the Knowledge-Based Tracking (KBT) algorithm for which a real-time flight test demonstration was recently conducted at Rome Air Development Center (RADC). In KBT processing, the radar signal in each resolution cell is thresholded at a lower than normal setting to detect low RCS targets. This lower threshold produces a larger than normal false alarm rate. Therefore, additional signal processing including spectral filtering, CFAR and knowledge-based acceptance testing are performed to eliminate some of the false alarms. TSC's knowledge-based Track-Before-Detect (TBD) algorithm is then applied to the data from each azimuth sector to detect target tracks. In this algorithm, tentative track templates are formed for each threshold crossing and knowledge-based association rules are applied to the range, Doppler, and azimuth measurements from successive scans. Lastly, an M-association out of N-scan rule is used to declare a detection. This scan-to-scan integration enhances the probability of target detection while maintaining an acceptably low output false alarm rate. For a real-time demonstration of the KBT algorithm, the L-band radar in the Surveillance Laboratory (SL) at RADC was used to illuminate a small Cessna 310 test aircraft. The received radar signal wa digitized and processed by a ST-100 Array Processor and VAX computer network in the lab. The ST-100 performed all of the radar signal processing functions, including Moving Target Indicator (MTI) pulse cancelling, FFT Doppler filtering, and CFAR detection. The VAX computers performed the remaining range-Doppler clustering, beamsplitting and TBD processing functions. The KBT algorithm provided a 9.5 dB improvement relative to single scan performance with a nominal real time delay of less than one second between illumination and display.
Fast track management and control
Cameron, M.D.O.
1996-12-31
This paper, one of a group of papers describing the development of BP`s West of Shetland Foinaven field will set-out the challenges experienced in managing a fast-track project from system design through to offshore installation. ABB Seatec Limited (formerly GEC Marconi Oil and Gas) were commissioned to provide a Multiplexed Electro-Hydraulic Subsea Control System designed for deepwater and for installation/retrieval in a hostile environment. The paper will address the projects critical phase, the project controls implemented, the practical working methods used within a Subsea Alliance and those involved in Client Interaction, Concurrent Engineering, Team Coaching, Internal Procedures and Interface Management in order to meet the exacting schedule for First Oil deliveries. The Project is currently proceeding on routine production deliveries to complete the field development requirements.
A Probabilistic Cell Tracking Algorithm
NASA Astrophysics Data System (ADS)
Steinacker, Reinhold; Mayer, Dieter; Leiding, Tina; Lexer, Annemarie; Umdasch, Sarah
2013-04-01
The research described below was carried out during the EU-Project Lolight - development of a low cost, novel and accurate lightning mapping and thunderstorm (supercell) tracking system. The Project aims to develop a small-scale tracking method to determine and nowcast characteristic trajectories and velocities of convective cells and cell complexes. The results of the algorithm will provide a higher accuracy than current locating systems distributed on a coarse scale. Input data for the developed algorithm are two temporally separated lightning density fields. Additionally a Monte Carlo method minimizing a cost function is utilizied which leads to a probabilistic forecast for the movement of thunderstorm cells. In the first step the correlation coefficients between the first and the second density field are computed. Hence, the first field is shifted by all shifting vectors which are physically allowed. The maximum length of each vector is determined by the maximum possible speed of thunderstorm cells and the difference in time for both density fields. To eliminate ambiguities in determination of directions and velocities, the so called Random Walker of the Monte Carlo process is used. Using this method a grid point is selected at random. Moreover, one vector out of all predefined shifting vectors is suggested - also at random but with a probability that is related to the correlation coefficient. If this exchange of shifting vectors reduces the cost function, the new direction and velocity are accepted. Otherwise it is discarded. This process is repeated until the change of cost functions falls below a defined threshold. The Monte Carlo run gives information about the percentage of accepted shifting vectors for all grid points. In the course of the forecast, amplifications of cell density are permitted. For this purpose, intensity changes between the investigated areas of both density fields are taken into account. Knowing the direction and speed of thunderstorm
Improved motion information-based infrared dim target tracking algorithms
NASA Astrophysics Data System (ADS)
Lei, Liu; Zhijian, Huang
2014-11-01
Accurate and fast tracking of infrared (IR) dim target has very important meaning for infrared precise guidance, early warning, video surveillance, etc. However, under complex backgrounds, such as clutter, varying illumination, and occlusion, the traditional tracking method often converges to a local maximum and loses the real infrared target. To cope with these problems, three improved tracking algorithm based on motion information are proposed in this paper, namely improved mean shift algorithm, improved Optical flow method and improved Particle Filter method. The basic principles and the implementing procedure of these modified algorithms for target tracking are described. Using these algorithms, the experiments on some real-life IR and color images are performed. The whole algorithm implementing processes and results are analyzed, and those algorithms for tracking targets are evaluated from the two aspects of subjective and objective. The results prove that the proposed method has satisfying tracking effectiveness and robustness. Meanwhile, it has high tracking efficiency and can be used for real-time tracking.
[FAST TRACK CONCEPT IN MODERN NEUROANESTHESIOLOGY].
Kulikov, A S; Lubnin, A Yu
2016-01-01
The concept of fast-track is one of the most discussed trends in the development of modern surgery. According to supporters of this ideology, the use of fast-track leads to the reduction ofhospital stay without increasing in readmission, reducing the frequency of postoperative complications, which is reflected in the decrease in the cost of the treatment and social expenses, due to earlier return of patients to normal life. The authors of this review discuss different anesthetic issues of fast-track approach (early awakening, postoperative analgesia, prevention of PONV; neuromuscular block reversion). The paper contains also valuable reasons for using fast-track in neurosurgery, as well as contraindications to the use of this approach. PMID:27468505
ERIC Educational Resources Information Center
Kibble, Bob
2007-01-01
Toys can provide motivational contexts for learning and teaching about physics. A cheap car track provides an almost frictionless environment from which a quantitative study of conservation of energy and circular motion can be made.
ERIC Educational Resources Information Center
Howe, Quincy
2006-01-01
In this article, the author relates how a math-assessment software has allowed his school to track the academic progress of its students. The author relates that in the first year that the software was deployed, schoolwide averages in terms of national standing on the math ITBS rose from the 42nd to 59th percentile. In addition, a significant…
Nanavati, Aditya J; Nagral, Sanjay; Prabhakar, Subramaniam
2014-01-01
Fast-track surgery or 'enhanced recovery after surgery' or 'multimodal rehabilitation after surgery' is a form of protocol-based perioperative care programme. It is an amalgamation of evidence-based practices that have been proven to improve patient outcome independently and exert a synergistic effect when applied together. The philosophy is to treat the patient's pathology with minimal disturbance to the physiology. Several surgical subspecialties have now adopted such protocols with good results. The role of fast-track surgery in colorectal procedures has been well demonstrated. Its application to other major abdominal surgical procedures is not as well defined but there are encouraging results in the few studies conducted. There has been resistance to several aspects of this programme among gastrointestinal and general surgeons. There is little data from India in the available literature on the application of fast-tracking in gastrointestinal surgery. In a country such as India the existing healthcare structure stands to gain the most by widespread adoption of fast-track methods. Early discharge, early ambulation, earlier return to work and increased hospital efficiency are some of the benefits. The cost gains derived from this programme stand to benefit the patient, doctor and government as well. The practice and implementation of fast-track surgery involves a multidisciplinary team approach. It requires policy formation at an institutional level and interdepartmental coordination. More research is required in areas like implementation of such protocols across India to derive the maximum benefit from them. PMID:25471759
A Reliability-Based Track Fusion Algorithm
Xu, Li; Pan, Liqiang; Jin, Shuilin; Liu, Haibo; Yin, Guisheng
2015-01-01
The common track fusion algorithms in multi-sensor systems have some defects, such as serious imbalances between accuracy and computational cost, the same treatment of all the sensor information regardless of their quality, high fusion errors at inflection points. To address these defects, a track fusion algorithm based on the reliability (TFR) is presented in multi-sensor and multi-target environments. To improve the information quality, outliers in the local tracks are eliminated at first. Then the reliability of local tracks is calculated, and the local tracks with high reliability are chosen for the state estimation fusion. In contrast to the existing methods, TFR reduces high fusion errors at the inflection points of system tracks, and obtains a high accuracy with less computational cost. Simulation results verify the effectiveness and the superiority of the algorithm in dense sensor environments. PMID:25950174
Accelerated Leadership Development: Fast Tracking School Leaders
ERIC Educational Resources Information Center
Earley, Peter; Jones, Jeff
2010-01-01
"Accelerated Leadership Development" captures and communicates the lessons learned from successful fast-track leadership programmes in the private and public sector, and provides a model which schools can follow and customize as they plan their own leadership development strategies. As large numbers of headteachers and other senior staff retire,…
Fast-tracking in cardiac surgery.
Aps, C
Fast-tracking in cardiac surgery evolved as the pressure on bed space in intensive therapy units (ITU) grew and clinical management improved. It relies on achieving a patient condition that allows for earlier extubation and postoperative management in alternative facilities to the ITU. PMID:7582363
UWB Tracking Algorithms: AOA and TDOA
NASA Technical Reports Server (NTRS)
Ni, Jianjun David; Arndt, D.; Ngo, P.; Gross, J.; Refford, Melinda
2006-01-01
Ultra-Wideband (UWB) tracking prototype systems are currently under development at NASA Johnson Space Center for various applications on space exploration. For long range applications, a two-cluster Angle of Arrival (AOA) tracking method is employed for implementation of the tracking system; for close-in applications, a Time Difference of Arrival (TDOA) positioning methodology is exploited. Both AOA and TDOA are chosen to utilize the achievable fine time resolution of UWB signals. This talk presents a brief introduction to AOA and TDOA methodologies. The theoretical analysis of these two algorithms reveal the affecting parameters impact on the tracking resolution. For the AOA algorithm, simulations show that a tracking resolution less than 0.5% of the range can be achieved with the current achievable time resolution of UWB signals. For the TDOA algorithm used in close-in applications, simulations show that the (sub-inch) high tracking resolution is achieved with a chosen tracking baseline configuration. The analytical and simulated results provide insightful guidance for the UWB tracking system design.
Fast infrared dim and small target tracking
NASA Astrophysics Data System (ADS)
Qian, Kun; Zhou, Huixin; Rong, Shenghui; Wang, Bingjian; Yin, Shiming; Zeng, Qingjie
2015-10-01
The target tracking by the spatio-temporal learning is a kind of online tracking algorithm based on Bayesian framework. But it has the excursion problem when applied in the infrared dim target. Based on the principle of the spatio-temporal learning algorithm, the excursion problem was analyzed and a new robust algorithm for infrared dim target tracking is proposed in this paper. Firstly, the Guide Image Filter was adopted to process the input image to preserve edges and eliminate the noise of the image. Secondly, the ideal spatial context model was calculated with the input image that contains little noise, which can be got by subtracting the filtering result from the original image. Simultaneously, a new weight in the context prior model was proposed to indicate that the prior is also related to the local gray level difference. The performance of the presented algorithm was tested with two infrared air image sequences, and the experimental results show that the proposed algorithm performs well in terms of efficiency, accuracy and robustness.
Fast decoding algorithms for coded aperture systems
NASA Astrophysics Data System (ADS)
Byard, Kevin
2014-08-01
Fast decoding algorithms are described for a number of established coded aperture systems. The fast decoding algorithms for all these systems offer significant reductions in the number of calculations required when reconstructing images formed by a coded aperture system and hence require less computation time to produce the images. The algorithms may therefore be of use in applications that require fast image reconstruction, such as near real-time nuclear medicine and location of hazardous radioactive spillage. Experimental tests confirm the efficacy of the fast decoding techniques.
Procrustes algorithm for multisensor track fusion
NASA Astrophysics Data System (ADS)
Fernandez, Manuel F.; Aridgides, Tom; Evans, John S., Jr.
1990-10-01
The association or "fusion" of multiple-sensor reports allows the generation of a highly accurate description of the environment by enabling efficient compression and processing of otherwise unwieldy quantities of data. Assuming that the observations from each sensor are aligned in feature space and in time, this association procedure may be executed on the basis of how well each sensor's vectors of observations match previously fused tracks. Unfortunately, distance-based algorithms alone do not suffice in those situations where match-assignments are not of an obvious nature (e.g., high target density or high false alarm rate scenarios). Our proposed approach is based on recognizing that, together, the sensors' observations and the fused tracks span a vector subspace whose dimensionality and singularity characteristics can be used to determine the total number of targets appearing across sensors. A properly constrained transformation can then be found which aligns the subspaces spanned individually by the observations and by the fused tracks, yielding the relationship existing between both sets of vectors ("Procrustes Problem"). The global nature of this approach thus enables fusing closely-spaced targets by treating them--in a manner analogous to PDA/JPDA algorithms - as clusters across sensors. Since our particular version of the Procrustes Problem consists basically of a minimization in the Total Least Squares sense, the resulting transformations associate both observations-to-tracks and tracks-to--observations. This means that the number of tracks being updated will increase or decrease depending on the number of targets present, automatically initiating or deleting "fused" tracks as required, without the need of ancillary procedures. In addition, it is implicitly assumed that both the tracker filters' target trajectory models and the sensors' observations are "noisy", yielding an algorithm robust even against maneuvering targets. Finally, owing to the fact
Fast object tracking based on template matching and region information fusion extraction
NASA Astrophysics Data System (ADS)
Liu, Liman; Chen, Yun; Liu, Haihua
2015-12-01
In this paper, a fast object tracking algorithm based on template matching and region information fusion extraction is proposed. In the prediction framework, the data connection task is achieved by object template and object information extraction. And then the object is tracked accurately by using the object motion information. We handle the tracking shift by using the confidence estimation strategy. The experiments show that the proposed algorithm has robust performance.
Online empirical evaluation of tracking algorithms.
Wu, Hao; Sankaranarayanan, Aswin C; Chellappa, Rama
2010-08-01
Evaluation of tracking algorithms in the absence of ground truth is a challenging problem. There exist a variety of approaches for this problem, ranging from formal model validation techniques to heuristics that look for mismatches between track properties and the observed data. However, few of these methods scale up to the task of visual tracking, where the models are usually nonlinear and complex and typically lie in a high-dimensional space. Further, scenarios that cause track failures and/or poor tracking performance are also quite diverse for the visual tracking problem. In this paper, we propose an online performance evaluation strategy for tracking systems based on particle filters using a time-reversed Markov chain. The key intuition of our proposed methodology relies on the time-reversible nature of physical motion exhibited by most objects, which in turn should be possessed by a good tracker. In the presence of tracking failures due to occlusion, low SNR, or modeling errors, this reversible nature of the tracker is violated. We use this property for detection of track failures. To evaluate the performance of the tracker at time instant t, we use the posterior of the tracking algorithm to initialize a time-reversed Markov chain. We compute the posterior density of track parameters at the starting time t=0 by filtering back in time to the initial time instant. The distance between the posterior density of the time-reversed chain (at t=0) and the prior density used to initialize the tracking algorithm forms the decision statistic for evaluation. It is observed that when the data are generated by the underlying models, the decision statistic takes a low value. We provide a thorough experimental analysis of the evaluation methodology. Specifically, we demonstrate the effectiveness of our approach for tackling common challenges such as occlusion, pose, and illumination changes and provide the Receiver Operating Characteristic (ROC) curves. Finally, we also show
40 CFR 72.82 - Fast-track modifications.
Code of Federal Regulations, 2013 CFR
2013-07-01
... 40 Protection of Environment 17 2013-07-01 2013-07-01 false Fast-track modifications. 72.82... (CONTINUED) PERMITS REGULATION Permit Revisions § 72.82 Fast-track modifications. The following procedures shall apply to all fast-track modifications. (a) If the Administrator is the permitting authority,...
40 CFR 72.82 - Fast-track modifications.
Code of Federal Regulations, 2012 CFR
2012-07-01
... 40 Protection of Environment 17 2012-07-01 2012-07-01 false Fast-track modifications. 72.82... (CONTINUED) PERMITS REGULATION Permit Revisions § 72.82 Fast-track modifications. The following procedures shall apply to all fast-track modifications. (a) If the Administrator is the permitting authority,...
40 CFR 72.82 - Fast-track modifications.
Code of Federal Regulations, 2014 CFR
2014-07-01
... 40 Protection of Environment 17 2014-07-01 2014-07-01 false Fast-track modifications. 72.82... (CONTINUED) PERMITS REGULATION Permit Revisions § 72.82 Fast-track modifications. The following procedures shall apply to all fast-track modifications. (a) If the Administrator is the permitting authority,...
40 CFR 72.82 - Fast-track modifications.
Code of Federal Regulations, 2010 CFR
2010-07-01
... 40 Protection of Environment 16 2010-07-01 2010-07-01 false Fast-track modifications. 72.82... (CONTINUED) PERMITS REGULATION Permit Revisions § 72.82 Fast-track modifications. The following procedures shall apply to all fast-track modifications. (a) If the Administrator is the permitting authority,...
40 CFR 72.82 - Fast-track modifications.
Code of Federal Regulations, 2011 CFR
2011-07-01
... 40 Protection of Environment 16 2011-07-01 2011-07-01 false Fast-track modifications. 72.82... (CONTINUED) PERMITS REGULATION Permit Revisions § 72.82 Fast-track modifications. The following procedures shall apply to all fast-track modifications. (a) If the Administrator is the permitting authority,...
UWB Tracking System Design with TDOA Algorithm
NASA Technical Reports Server (NTRS)
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).
Neural network fusion capabilities for efficient implementation of tracking algorithms
NASA Astrophysics Data System (ADS)
Sundareshan, Malur K.; Amoozegar, Farid
1996-05-01
The ability to efficiently fuse information of different forms for facilitating intelligent decision-making is one of the major capabilities of trained multilayer neural networks that is being recognized int eh recent times. While development of innovative adaptive control algorithms for nonlinear dynamical plants which attempt to exploit these capabilities seems to be more popular, a corresponding development of nonlinear estimation algorithms using these approaches, particularly for application in target surveillance and guidance operations, has not received similar attention. In this paper we describe the capabilities and functionality of neural network algorithms for data fusion and implementation of nonlinear tracking filters. For a discussion of details and for serving as a vehicle for quantitative performance evaluations, the illustrative case of estimating the position and velocity of surveillance targets is considered. Efficient target tracking algorithms that can utilize data from a host of sensing modalities and are capable of reliably tracking even uncooperative targets executing fast and complex maneuvers are of interest in a number of applications. The primary motivation for employing neural networks in these applications comes form the efficiency with which more features extracted from different sensor measurements can be utilized as inputs for estimating target maneuvers. Such an approach results in an overall nonlinear tracking filter which has several advantages over the popular efforts at designing nonlinear estimation algorithms for tracking applications, the principle one being the reduction of mathematical and computational complexities. A system architecture that efficiently integrates the processing capabilities of a trained multilayer neural net with the tracking performance of a Kalman filter is described in this paper.
HYBRID FAST HANKEL TRANSFORM ALGORITHM FOR ELECTROMAGNETIC MODELING
A hybrid fast Hankel transform algorithm has been developed that uses several complementary features of two existing algorithms: Anderson's digital filtering or fast Hankel transform (FHT) algorithm and Chave's quadrature and continued fraction algorithm. A hybrid FHT subprogram ...
1995 Fast Track: cost reduction and improvement.
Panzer, R J; Tuttle, D N; Kolker, R M
1997-01-01
To respond to a cost reduction crisis, Strong Memorial Hospital implemented an aggressively managed program of accelerated improvement teams. "Fast-track" teams combined the application of many management tools (total quality management, breakthrough thinking, reengineering, etc.) into one problem-solving process. Teams and managers were charged to work on specific cost reduction strategies. Teams were given additional instruction on interpersonal skills such as communication, teamwork, and leadership. Paradoxically, quality improvement in our hospital was advanced more through this effort at cost reduction than had previously been done in the name of quality itself. PMID:10176411
Fast algorithms for transport models
Manteuffel, T.A.
1992-12-01
The objective of this project is the development of numerical solution techniques for deterministic models of the transport of neutral and charged particles and the demonstration of their effectiveness in both a production environment and on advanced architecture computers. The primary focus is on various versions of the linear Boltzman equation. These equations are fundamental in many important applications. This project is an attempt to integrate the development of numerical algorithms with the process of developing production software. A major thrust of this reject will be the implementation of these algorithms on advanced architecture machines that reside at the Advanced Computing Laboratory (ACL) at Los Alamos National Laboratories (LANL).
A fast assistant decision-making system on the emergent maneuver of the tracking ship
NASA Astrophysics Data System (ADS)
Huang, Qiong; Xue, G. H.; Ni, X. Q.
2016-02-01
This paper studies a fast assistant decision-making system on the emergent maneuver of the tracking ship, adopting the design method of the emergent working state of the tracking ship based on the meteorological prediction, the virtual display technology based on the multi-stage mapping, and the 2-dimension area algorithm based on the line-scanning. It solves problems that the tracking ship met during working, such as the long TT&C time, the dense crucial observation arc, the complicated working flow, and the changeful scheme. It established the hard basement for the fast design of the emergency working state when the tracking ship in the awful sea conditions.
Fast ordering algorithm for exact histogram specification.
Nikolova, Mila; Steidl, Gabriele
2014-12-01
This paper provides a fast algorithm to order in a meaningful, strict way the integer gray values in digital (quantized) images. It can be used in any exact histogram specification-based application. Our algorithm relies on the ordering procedure based on the specialized variational approach. This variational method was shown to be superior to all other state-of-the art ordering algorithms in terms of faithful total strict ordering but not in speed. Indeed, the relevant functionals are in general difficult to minimize because their gradient is nearly flat over vast regions. In this paper, we propose a simple and fast fixed point algorithm to minimize these functionals. The fast convergence of our algorithm results from known analytical properties of the model. Our algorithm is equivalent to an iterative nonlinear filtering. Furthermore, we show that a particular form of the variational model gives rise to much faster convergence than other alternative forms. We demonstrate that only a few iterations of this filter yield almost the same pixel ordering as the minimizer. Thus, we apply only few iteration steps to obtain images, whose pixels can be ordered in a strict and faithful way. Numerical experiments confirm that our algorithm outperforms by far its main competitors. PMID:25347881
How to incorporate generic refraction models into multistatic tracking algorithms
NASA Astrophysics Data System (ADS)
Crouse, D. F.
The vast majority of literature published on target tracking ignores the effects of atmospheric refraction. When refraction is considered, the solutions are generally tailored to a simple exponential atmospheric refraction model. This paper discusses how arbitrary refraction models can be incorporated into tracking algorithms. Attention is paid to multistatic tracking problems, where uncorrected refractive effects can worsen track accuracy and consistency in centralized tracking algorithms, and can lead to difficulties in track-to-track association in distributed tracking filters. Monostatic and bistatic track initialization using refraction-corrupted measurements is discussed. The results are demonstrated using an exponential refractive model, though an arbitrary refraction profile can be substituted.
Security market reaction to FDA fast track designations.
Anderson, Christopher W; Zhang, Ying
2010-01-01
Pharmaceutical firms can apply for the Food and Drug Administration to 'fast track' research and de velopment on new drugs, accelerating clinical trials and expediting regulatory review required prior to marketing to consumers. We investigate security market reaction to more than 100 fast track designations from 1998 to 2004. Fast track designation appears to enhance investor recognition of firm value. Specifically, fast track designation coincides with abnormal trading volume and excess daily stock returns for sponsoring firms. Institutional ownership and analyst attention also increase. Market response is more pronounced for firms that are smaller, do not yet market products, and have low institutional ownership. PMID:21294437
Fast Track'' nuclear thermal propulsion concept
Johnson, R.A.; Zweig, H.R. ); Cooper, M.H.; Wett, J. Jr. )
1993-01-10
The objective of the Space Exploration Initiative ( America at the Threshold...,'' 1991) is the exploration of Mars by man in the second decade of the 21st century. The NASA Fast Track'' approach (NASA-LeRC Presentation, 1992) could accelerate the manned exploration of Mars to 2007. NERVA-derived nuclear propulsion represents a viable near-term technology approach to accomplish the accelerated schedule. Key milestones in the progression to the manned Mars mission are (1) demonstration of TRL-6 for the man-rateable system by 1999, (2) a robotic lunar mission by 2000, (3) the first cargo mission to Mars by 2005, and (4) the piloted Mars mission in 2007. The Rocketdyne-Westinghouse concept for nuclear thermal propulsion to achieve these milestones combines the nuclear reactor technology of the Rover/NERVA programs and the state-of-the-art hardware designs from hydrogen-fueled rocket engine successes like the Space Shuttle Main Engine (SSME).
Fast Fourier Transform algorithm design and tradeoffs
NASA Technical Reports Server (NTRS)
Kamin, Ray A., III; Adams, George B., III
1988-01-01
The Fast Fourier Transform (FFT) is a mainstay of certain numerical techniques for solving fluid dynamics problems. The Connection Machine CM-2 is the target for an investigation into the design of multidimensional Single Instruction Stream/Multiple Data (SIMD) parallel FFT algorithms for high performance. Critical algorithm design issues are discussed, necessary machine performance measurements are identified and made, and the performance of the developed FFT programs are measured. Fast Fourier Transform programs are compared to the currently best Cray-2 FFT program.
Python algorithms in particle tracking microrheology
2012-01-01
Background Particle tracking passive microrheology relates recorded trajectories of microbeads, embedded in soft samples, to the local mechanical properties of the sample. The method requires intensive numerical data processing and tools allowing control of the calculation errors. Results We report the development of a software package collecting functions and scripts written in Python for automated and manual data processing, to extract viscoelastic information about the sample using recorded particle trajectories. The resulting program package analyzes the fundamental diffusion characteristics of particle trajectories and calculates the frequency dependent complex shear modulus using methods published in the literature. In order to increase conversion accuracy, segmentwise, double step, range-adaptive fitting and dynamic sampling algorithms are introduced to interpolate the data in a splinelike manner. Conclusions The presented set of algorithms allows for flexible data processing for particle tracking microrheology. The package presents improved algorithms for mean square displacement estimation, controlling effects of frame loss during recording, and a novel numerical conversion method using segmentwise interpolation, decreasing the conversion error from about 100% to the order of 1%. PMID:23186362
Fast Track: A Language Arts Program for Middle School Gifted
ERIC Educational Resources Information Center
Schneider, Jean
2008-01-01
"Fast Track" is a pseudonym for an accelerated, advanced language arts program for verbally gifted and high potential students in grades 6-8. The critical thinking model used for "Fast Track" was gleaned from Coalition of Essential Schools founder Ted Sizer's Habits of Mind: significance, evidence, connections, perspective, and supposition, as…
Fast Track Teaching: Beginning the Experiment in Accelerated Leadership Development
ERIC Educational Resources Information Center
Churches, Richard; Hutchinson, Geraldine; Jones, Jeff
2009-01-01
This article provides an overview of the development of the Fast Track teaching programme and personalised nature of the training and support that has been delivered. Fast Track teacher promotion rates are compared to national statistics demonstrating significant progression for certain groups, particularly women. (Contains 3 tables and 3 figures.)
Fast regional readout CMOS Image Sensor for dynamic MLC tracking
NASA Astrophysics Data System (ADS)
Zin, H.; Harris, E.; Osmond, J.; Evans, P.
2014-03-01
Advanced radiotherapy techniques such as volumetric modulated arc therapy (VMAT) require verification of the complex beam delivery including tracking of multileaf collimators (MLC) and monitoring the dose rate. This work explores the feasibility of a prototype Complementary metal-oxide semiconductor Image Sensor (CIS) for tracking these complex treatments by utilising fast, region of interest (ROI) read out functionality. An automatic edge tracking algorithm was used to locate the MLC leaves edges moving at various speeds (from a moving triangle field shape) and imaged with various sensor frame rates. The CIS demonstrates successful edge detection of the dynamic MLC motion within accuracy of 1.0 mm. This demonstrates the feasibility of the sensor to verify treatment delivery involving dynamic MLC up to ~400 frames per second (equivalent to the linac pulse rate), which is superior to any current techniques such as using electronic portal imaging devices (EPID). CIS provides the basis to an essential real-time verification tool, useful in accessing accurate delivery of complex high energy radiation to the tumour and ultimately to achieve better cure rates for cancer patients.
MATLAB tensor classes for fast algorithm prototyping.
Bader, Brett William; Kolda, Tamara Gibson
2004-10-01
Tensors (also known as mutidimensional arrays or N-way arrays) are used in a variety of applications ranging from chemometrics to psychometrics. We describe four MATLAB classes for tensor manipulations that can be used for fast algorithm prototyping. The tensor class extends the functionality of MATLAB's multidimensional arrays by supporting additional operations such as tensor multiplication. The tensor as matrix class supports the 'matricization' of a tensor, i.e., the conversion of a tensor to a matrix (and vice versa), a commonly used operation in many algorithms. Two additional classes represent tensors stored in decomposed formats: cp tensor and tucker tensor. We descibe all of these classes and then demonstrate their use by showing how to implement several tensor algorithms that have appeared in the literature.
Real time tracking with a silicon telescope prototype using the "artificial retina" algorithm
NASA Astrophysics Data System (ADS)
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.
Automatic face detection and tracking based on Adaboost with camshift algorithm
NASA Astrophysics Data System (ADS)
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.
Fastballs a Fast Track to 'Tommy John Surgery'?
... 159058.html Fastballs a Fast Track to 'Tommy John Surgery'? Other pitches not linked to the elbow ... pitcher's risk of an elbow injury requiring "Tommy John surgery." "Our findings suggest that throwing a high ...
Fast computation algorithms for speckle pattern simulation
Nascov, Victor; Samoilă, Cornel; Ursuţiu, Doru
2013-11-13
We present our development of a series of efficient computation algorithms, generally usable to calculate light diffraction and particularly for speckle pattern simulation. We use mainly the scalar diffraction theory in the form of Rayleigh-Sommerfeld diffraction formula and its Fresnel approximation. Our algorithms are based on a special form of the convolution theorem and the Fast Fourier Transform. They are able to evaluate the diffraction formula much faster than by direct computation and we have circumvented the restrictions regarding the relative sizes of the input and output domains, met on commonly used procedures. Moreover, the input and output planes can be tilted each to other and the output domain can be off-axis shifted.
Fast-moving target tracking system based on CMOS image sensor
NASA Astrophysics Data System (ADS)
Miao, Zhun; Jiang, Jie; Zhang, Guangjun
2008-10-01
This paper introduces a fast-moving target tracking system based on CMOS (Complementary Metal-Oxygen Semiconductor) image sensor. A pipeline parallel architecture of region segmentation and first order moment algorithms on FPGA (Field Programmable Gate Array) platform enables driving the high frame rate CMOS image sensor and processing real-time images at the same time, extracting coordinates of the bright target spots in the high-rate consecutive image frames. In the end of this paper, an experiment proved that this system performs well in tracking fast-moving target in satisfying demand of speed and accuracy.
Fast-Acquisition/Weak-Signal-Tracking GPS Receiver for HEO
NASA Technical Reports Server (NTRS)
Wintemitz, Luke; Boegner, Greg; Sirotzky, Steve
2004-01-01
A report discusses the technical background and design of the Navigator Global Positioning System (GPS) receiver -- . a radiation-hardened receiver intended for use aboard spacecraft. Navigator is capable of weak signal acquisition and tracking as well as much faster acquisition of strong or weak signals with no a priori knowledge or external aiding. Weak-signal acquisition and tracking enables GPS use in high Earth orbits (HEO), and fast acquisition allows for the receiver to remain without power until needed in any orbit. Signal acquisition and signal tracking are, respectively, the processes of finding and demodulating a signal. Acquisition is the more computationally difficult process. Previous GPS receivers employ the method of sequentially searching the two-dimensional signal parameter space (code phase and Doppler). Navigator exploits properties of the Fourier transform in a massively parallel search for the GPS signal. This method results in far faster acquisition times [in the lab, 12 GPS satellites have been acquired with no a priori knowledge in a Low-Earth-Orbit (LEO) scenario in less than one second]. Modeling has shown that Navigator will be capable of acquiring signals down to 25 dB-Hz, appropriate for HEO missions. Navigator is built using the radiation-hardened ColdFire microprocessor and housing the most computationally intense functions in dedicated field-programmable gate arrays. The high performance of the algorithm and of the receiver as a whole are made possible by optimizing computational efficiency and carefully weighing tradeoffs among the sampling rate, data format, and data-path bit width.
Fast TracKer: A fast hardware track trigger for the ATLAS detector
NASA Astrophysics Data System (ADS)
Pandini, Carlo
2016-07-01
The trigger system at the ATLAS experiment is designed to lower the event rate occurring from the nominal bunch crossing rate of 40 MHz to about 1 kHz for a LHC luminosity of the order of 1034cm-2s-1. To achieve high background rejection while maintaining good efficiency for interesting physics signals, sophisticated algorithms are needed which require an extensive use of tracking information. The Fast TracKer (FTK) trigger system, part of the ATLAS trigger upgrade program, is a highly parallel hardware device designed to perform track-finding at 100 kHz. Modern, powerful Field Programmable Gate Arrays (FPGAs) form an important part of the system architecture, and the combinatorial problem of pattern recognition is solved by 8000 standard-cell ASICs used to implement an Associative Memory architecture. The availability of the tracking and subsequent vertex information within a short latency ensures robust selections and allows improved trigger performance for the most difficult signatures, such as b-jets and τ leptons.
Experiments with conjugate gradient algorithms for homotopy curve tracking
NASA Technical Reports Server (NTRS)
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.
Ultra fast-track extubation in heart transplant surgery patients
Kianfar, Amir Abbas; Ahmadi, Zargham Hossein; Mirhossein, Seyed Mohsen; Jamaati, Hamidreza; Kashani, Babak Sharif; Mohajerani, Seyed Amir; Firoozi, Ehsan; Salehi, Farshid; Radmand, Golnar; Hashemian, Seyed Mohammadreza
2015-01-01
Background: Heart transplant surgeries using cardiopulmonary bypass (CPB) typically requires mechanical ventilation in intensive care units (ICU) in post-operation period. Ultra fast-track extubation (UFE) have been described in patients undergoing various cardiac surgeries. Aim: To determine the possibility of ultra-fast-track extubation instead of late extubation in post heart transplant patients. Materials and Methods: Patients randomly assigned into two groups; Ultra fast-track extubation (UFE) group was defined by extubation inside operating room right after surgery. Late extubation group was defined by patients who were not extubated in operating room and transferred to post operation cardiac care unit (CCU) to extubate. Results: The mean cardiopulmonary bypass time was 136.8 ± 25.7 minutes in ultra-fast extubation and 145.3 ± 29.8 minutes in late extubation patients (P > 0.05). Mechanical ventilation duration (days) was 0 days in ultra-fast and 2.31 ± 1.8 days in late extubation. Length of ICU stay was significantly higher in late extubation group (4.2 ± 1.2 days) than the UFE group (1.72 ± 1.5 days) (P = 0.02). In survival analysis there was no significant difference between ultra-fast and late extubation groups (Log-rank test, P = 0.9). Conclusions: Patients undergoing cardiac transplant could be managed with “ultra-fast-track extubation”, without increased morbidity and mortality. PMID:26157651
Why Graduate Students Reject the Fast Track
ERIC Educational Resources Information Center
Mason, Mary Ann; Goulden, Marc; Frasch, Karie
2009-01-01
The authors recently completed an unparalleled survey, with more than eight thousand doctoral student respondents across the University of California system, and what they heard is worrisome: major research universities may be losing some of the most talented tenure-track academics before they even arrive. In the eyes of many doctoral students,…
Energy Dynamics: A Fast Track Inquiry
ERIC Educational Resources Information Center
Schmidt, Stan M.; Hrynyshyn, Alec
2004-01-01
Students investigate energy conversions by collaborating to develop a free standing track of plastic tubing through which a ball bearing moves at the fastest possible speed. Friendly competition leads to discussion of what worked and did not work and to the identification and investigation of underlying principles. (Contains 4 charts.)
Unbounded Binary Search for a Fast and Accurate Maximum Power Point Tracking
NASA Astrophysics Data System (ADS)
Kim, Yong Sin; Winston, Roland
2011-12-01
This paper presents a technique for maximum power point tracking (MPPT) of a concentrating photovoltaic system using cell level power optimization. Perturb and observe (P&O) has been a standard for an MPPT, but it introduces a tradeoff between the tacking speed and the accuracy of the maximum power delivered. The P&O algorithm is not suitable for a rapid environmental condition change by partial shading and self-shading due to its tracking time being linear to the length of the voltage range. Some of researches have been worked on fast tracking but they come with internal ad hoc parameters. In this paper, by using the proposed unbounded binary search algorithm for the MPPT, tracking time becomes a logarithmic function of the voltage search range without ad hoc parameters.
A fast DFT algorithm using complex integer transforms
NASA Technical Reports Server (NTRS)
Reed, I. S.; Truong, T. K.
1978-01-01
Winograd's algorithm for computing the discrete Fourier transform is extended considerably for certain large transform lengths. This is accomplished by performing the cyclic convolution, required by Winograd's method, by a fast transform over certain complex integer fields. This algorithm requires fewer multiplications than either the standard fast Fourier transform or Winograd's more conventional algorithms.
Nonlinear filter algorithm for opto-electronic target tracking
NASA Astrophysics Data System (ADS)
Xiong, Mao-tao; Song, Jian-xun; Wu, Qin-zhang
2009-05-01
At present in opto-electronic targets tracking, traditional accepted algorithms inevitably connect with linear errors. To improve the degraded performance of general algorithms, the Adaptive Unscented Particle Kalman Filter (AUPF) algorithm is proposed. The algorithm combines with Unscented Kalman Filter (UKF) to incorporate the most current observation datum and to generate the importance density function. Additionally, the Markov Chain Monte Carlo (MCMC) steps are adopted to counteract the problem of particles impoverishment caused by re-sampling step and thus the diversity of the particles is maintained. The AUPF algorithm reduces the nonlinear influence and improves the tracking accuracy of the opto-electronic targets tracking system. The analytic results of Monte Carlo simulation prove the AUPF algorithm is right and feasible, and it enhances the stability, the convergence rate and the accuracy of tracking system. The simulation results and algorithm provide a new approach for precise tracking of opto-electronic targets, they must have better applicative prospect in various engineering than the traditional tracking algorithms.
A Fast Implementation of the ISOCLUS Algorithm
NASA Technical Reports Server (NTRS)
Memarsadeghi, Nargess; Mount, David M.; Netanyahu, Nathan S.; LeMoigne, Jacqueline
2003-01-01
(kn) time, where k denotes the current number of centers. Traditional techniques for accelerating nearest neighbor searching involve storing the k centers in a data structure. However, because of the iterative nature of the algorithm, this data structure would need to be rebuilt with each new iteration. Our approach is to store the data points in a kd-tree data structure. The assignment of points to nearest neighbors is carried out by a filtering process, which successively eliminates centers that can not possibly be the nearest neighbor for a given region of space. This algorithm is significantly faster, because large groups of data points can be assigned to their nearest center in a single operation. Preliminary results on a number of real Landsat datasets show that our revised ISOCLUS-like scheme runs about twice as fast.
Modeling and performance analysis of GPS vector tracking algorithms
NASA Astrophysics Data System (ADS)
Lashley, Matthew
This dissertation provides a detailed analysis of GPS vector tracking algorithms and the advantages they have over traditional receiver architectures. Standard GPS receivers use a decentralized architecture that separates the tasks of signal tracking and position/velocity estimation. Vector tracking algorithms combine the two tasks into a single algorithm. The signals from the various satellites are processed collectively through a Kalman filter. The advantages of vector tracking over traditional, scalar tracking methods are thoroughly investigated. A method for making a valid comparison between vector and scalar tracking loops is developed. This technique avoids the ambiguities encountered when attempting to make a valid comparison between tracking loops (which are characterized by noise bandwidths and loop order) and the Kalman filters (which are characterized by process and measurement noise covariance matrices) that are used by vector tracking algorithms. The improvement in performance offered by vector tracking is calculated in multiple different scenarios. Rule of thumb analysis techniques for scalar Frequency Lock Loops (FLL) are extended to the vector tracking case. The analysis tools provide a simple method for analyzing the performance of vector tracking loops. The analysis tools are verified using Monte Carlo simulations. Monte Carlo simulations are also used to study the effects of carrier to noise power density (C/N0) ratio estimation and the advantage offered by vector tracking over scalar tracking. The improvement from vector tracking ranges from 2.4 to 6.2 dB in various scenarios. The difference in the performance of the three vector tracking architectures is analyzed. The effects of using a federated architecture with and without information sharing between the receiver's channels are studied. A combination of covariance analysis and Monte Carlo simulation is used to analyze the performance of the three algorithms. The federated algorithm without
A fast track to IAIMS: the Vanderbilt University strategy.
Stead, W W; Baker, W; Harris, T R; Hodges, T M; Sittig, D F
1992-01-01
In July 1991, Vanderbilt University Medical Center (VUMC) initiated a fast track approach to the implementation of an Integrated Academic Information Management System (IAIMS). The fast track approach has four elements: 1) an integrated organizational structure combining various operational information management units and the academic informatics program into a single entity to enhance efficiency; 2) technology transfer and network access to remote resources in preference to de novo development; 3) parallel IAIMS planning and infrastructure construction; 4) restriction of the scope of the initial IAIMS to permit a manageable implementation project. The fast track approach is intended to provide a truly functional IAIMS within a time period (7 years) associated with other major construction projects such as the building of a replacement hospital. PMID:1336415
Fast Markerless Tracking for Augmented Reality in Planar Environment
NASA Astrophysics Data System (ADS)
Basori, Ahmad Hoirul; Afif, Fadhil Noer; Almazyad, Abdulaziz S.; AbuJabal, Hamza Ali S.; Rehman, Amjad; Alkawaz, Mohammed Hazim
2015-12-01
Markerless tracking for augmented reality should not only be accurate but also fast enough to provide a seamless synchronization between real and virtual beings. Current reported methods showed that a vision-based tracking is accurate but requires high computational power. This paper proposes a real-time hybrid-based method for tracking unknown environments in markerless augmented reality. The proposed method provides collaboration of vision-based approach with accelerometers and gyroscopes sensors as camera pose predictor. To align the augmentation relative to camera motion, the tracking method is done by substituting feature-based camera estimation with combination of inertial sensors with complementary filter to provide more dynamic response. The proposed method managed to track unknown environment with faster processing time compared to available feature-based approaches. Moreover, the proposed method can sustain its estimation in a situation where feature-based tracking loses its track. The collaboration of sensor tracking managed to perform the task for about 22.97 FPS, up to five times faster than feature-based tracking method used as comparison. Therefore, the proposed method can be used to track unknown environments without depending on amount of features on scene, while requiring lower computational cost.
A maximum power point tracking algorithm for photovoltaic applications
NASA Astrophysics Data System (ADS)
Nelatury, Sudarshan R.; Gray, Robert
2013-05-01
The voltage and current characteristic of a photovoltaic (PV) cell is highly nonlinear and operating a PV cell for maximum power transfer has been a challenge for a long time. Several techniques have been proposed to estimate and track the maximum power point (MPP) in order to improve the overall efficiency of a PV panel. A strategic use of the mean value theorem permits obtaining an analytical expression for a point that lies in a close neighborhood of the true MPP. But hitherto, an exact solution in closed form for the MPP is not published. This problem can be formulated analytically as a constrained optimization, which can be solved using the Lagrange method. This method results in a system of simultaneous nonlinear equations. Solving them directly is quite difficult. However, we can employ a recursive algorithm to yield a reasonably good solution. In graphical terms, suppose the voltage current characteristic and the constant power contours are plotted on the same voltage current plane, the point of tangency between the device characteristic and the constant power contours is the sought for MPP. It is subject to change with the incident irradiation and temperature and hence the algorithm that attempts to maintain the MPP should be adaptive in nature and is supposed to have fast convergence and the least misadjustment. There are two parts in its implementation. First, one needs to estimate the MPP. The second task is to have a DC-DC converter to match the given load to the MPP thus obtained. Availability of power electronics circuits made it possible to design efficient converters. In this paper although we do not show the results from a real circuit, we use MATLAB to obtain the MPP and a buck-boost converter to match the load. Under varying conditions of load resistance and irradiance we demonstrate MPP tracking in case of a commercially available solar panel MSX-60. The power electronics circuit is simulated by PSIM software.
Motion object tracking algorithm using multi-cameras
NASA Astrophysics Data System (ADS)
Kong, Xiaofang; Chen, Qian; Gu, Guohua
2015-09-01
Motion object tracking is one of the most important research directions in computer vision. Challenges in designing a robust tracking method are usually caused by partial or complete occlusions on targets. However, motion object tracking algorithm based on multiple cameras according to the homography relation in three views can deal with this issue effectively since the information combining from multiple cameras in different views can make the target more complete and accurate. In this paper, a robust visual tracking algorithm based on the homography relations of three cameras in different views is presented to cope with the occlusion. First of all, being the main contribution of this paper, the motion object tracking algorithm based on the low-rank matrix representation under the framework of the particle filter is applied to track the same target in the public region respectively in different views. The target model and the occlusion model are established and an alternating optimization algorithm is utilized to solve the proposed optimization formulation while tracking. Then, we confirm the plane in which the target has the largest occlusion weight to be the principal plane and calculate the homography to find out the mapping relations between different views. Finally, the images of the other two views are projected into the main plane. By making use of the homography relation between different views, the information of the occluded target can be obtained completely. The proposed algorithm has been examined throughout several challenging image sequences, and experiments show that it overcomes the failure of the motion tracking especially under the situation of the occlusion. Besides, the proposed algorithm improves the accuracy of the motion tracking comparing with other state-of-the-art algorithms.
An efficient central DOA tracking algorithm for multiple incoherently distributed sources
NASA Astrophysics Data System (ADS)
Hassen, Sonia Ben; Samet, Abdelaziz
2015-12-01
In this paper, we develop a new tracking method for the direction of arrival (DOA) parameters assuming multiple incoherently distributed (ID) sources. The new approach is based on a simple covariance fitting optimization technique exploiting the central and noncentral moments of the source angular power densities to estimate the central DOAs. The current estimates are treated as measurements provided to the Kalman filter that model the dynamic property of directional changes for the moving sources. Then, the covariance-fitting-based algorithm and the Kalman filtering theory are combined to formulate an adaptive tracking algorithm. Our algorithm is compared to the fast approximated power iteration-total least square-estimation of signal parameters via rotational invariance technique (FAPI-TLS-ESPRIT) algorithm using the TLS-ESPRIT method and the subspace updating via FAPI-algorithm. It will be shown that the proposed algorithm offers an excellent DOA tracking performance and outperforms the FAPI-TLS-ESPRIT method especially at low signal-to-noise ratio (SNR) values. Moreover, the performances of the two methods increase as the SNR values increase. This increase is more prominent with the FAPI-TLS-ESPRIT method. However, their performances degrade when the number of sources increases. It will be also proved that our method depends on the form of the angular distribution function when tracking the central DOAs. Finally, it will be shown that the more the sources are spaced, the more the proposed method can exactly track the DOAs.
Edge-following algorithm for tracking geological features
NASA Technical Reports Server (NTRS)
Tietz, J. C.
1977-01-01
Sequential edge-tracking algorithm employs circular scanning to point permit effective real-time tracking of coastlines and rivers from earth resources satellites. Technique eliminates expensive high-resolution cameras. System might also be adaptable for application in monitoring automated assembly lines, inspecting conveyor belts, or analyzing thermographs, or x ray images.
Automatic Tracking Algorithm in Coaxial Near-Infrared Laser Ablation Endoscope for Fetus Surgery
NASA Astrophysics Data System (ADS)
Hu, Yan; Yamanaka, Noriaki; Masamune, Ken
2014-07-01
This article reports a stable vessel object tracking method for the treatment of twin-to-twin transfusion syndrome based on our previous 2 DOF endoscope. During the treatment of laser coagulation, it is necessary to focus on the exact position of the target object, however it moves by the mother's respiratory motion and still remains a challenge to obtain and track the position precisely. In this article, an algorithm which uses features from accelerated segment test (FAST) to extract the features and optical flow as the object tracking method, is proposed to deal with above problem. Further, we experimentally simulate the movement due to the mother's respiration, and the results of position errors and similarity verify the effectiveness of the proposed tracking algorithm for laser ablation endoscopy in-vitro and under water considering two influential factors. At average, the errors are about 10 pixels and the similarity over 0.92 are obtained in the experiments.
Fast Track to Success: Top Young Trainers 2012
ERIC Educational Resources Information Center
Freifeld, Lorri
2012-01-01
Supercharged. High-performers. Leaders of the pack. This article presents "Training" magazine's 2012 Top Young Trainers--those high-potential training professionals who are on the fast track to success. For the fifth year, "Training" magazine is pleased to recognize the outstanding talents, accomplishments, and leadership exhibited by 40 learning…
Education For All (EFA) - Fast Track Initiative Progress Report 30046
ERIC Educational Resources Information Center
World Bank Education Advisory Service, 2004
2004-01-01
Launched in June 2002, the Education For All-Fast Track Initiative (FTI) is a performance-based program focusing on the implementation of sustainable policies in support of universal primary completion (UPC) and the required resource mobilization. During its twenty months of implementation, FTI has delivered on results, which give reason for…
Fast Track: Elementary School. What Works Clearinghouse Intervention Report
ERIC Educational Resources Information Center
What Works Clearinghouse, 2014
2014-01-01
"Fast Track" is a comprehensive intervention designed to reduce conduct problems and promote academic, behavioral, and social improvement. The program's components include the "Promoting Alternative THinking Strategies" curriculum, parent groups, parent-child sharing time, child social skills training, home visiting, child…
Internal model control of a fast steering mirror for electro-optical fine tracking
NASA Astrophysics Data System (ADS)
Xia, Yun-xia; Bao, Qi-liang; Wu, Qiong-yan
2010-11-01
The objective of this research is to develop advanced control methods to improve the bandwidth and tracking precision of the electro-optical fine tracking system using a fast steering mirror (FSM). FSM is the most important part in this control system. The model of FSM is established at the beginning of this paper. Compared with the electro-optical fine tracking system with ground based platform, the electro-optical fine tracking system with movement based platform must be a wide bandwidth and a robustness system. An advanced control method based on internal model control law is developed for electro-optical fine tracking system. The IMC is an advanced algorithm. Theoretically, it can eliminate disturbance completely and make sure output equals to input even there is model error. Moreover, it separates process to the system dynamic characteristic and the object perturbation. Compared with the PID controller, the controller is simpler and the parameter regulation is more convenient and the system is more robust. In addition, we design an improved structure based on classic IMC. The tracking error of the two-port control system is much better than which of the classic IMC. The simulation results indicate that the electro-optical control system based on the internal model control algorithm is very effective. It shows a better performance at the tracing precision and the disturbance suppresses. Thus a new method is provided for the high-performance electro-optical fine tracking system.
Fast tracking mode predictive centroiding scheme
NASA Astrophysics Data System (ADS)
Rehman, Masood-Ur; Fang, Jiancheng; Saffih, Faycal; Quan, Wei
2008-10-01
The autonomous star trackers, using charge couple device CCD camera, or active pixel sensor APS, as natural sensors for optical input, has assumed a permanent position. This is due to their highly accurate attitude determination, small size, light weight and simple functionality, making them devices of choice in nearly all modern space vehicles especially for Nano-satellites. In all star trackers, star centroiding is a fundamental process necessary for pattern recognition. In this paper, a new method is presented, which predicts centers of regions of star locations, in successive image frames, from the current knowledge of boresight direction, which is updated successively. This method is very attractive for hardware implementation using APS imagers known for their random accessibility feature lacked in CCD's. The big advantage of this method is that it does not need pattern recognition, thus making it fast. This reduction of computational budget, power consumption and time, added to the capability of incorporating them in APS imagers, is appealing to Nano-satellites navigational instrumentation.
Multiple Object Tracking Using the Shortest Path Faster Association Algorithm
Liu, Heping; Liu, Huaping; Yang, Bin
2014-01-01
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. PMID:25215322
Acquisition and track algorithms for the Astros star tracker
NASA Technical Reports Server (NTRS)
Shalom, E.; Alexander, J. W.; Stanton, R. H.
1985-01-01
The Astros star tracker has been designed for an employment with the Space Shuttle. An achievement of the performance levels needed has required critical trade-offs between the hardware design and the control algorithms. This paper provides a description of the development of the acquisition and track algorithms. Attention is given to an Astros system overview, a system firmware description, cluster evaluation, guide star selection, exposure time determination, video data input, update interval timing, exposure time sequencing full frame video A/D conversion, analog threshold for acquisition, minimum threshold determination, and the theoretical basis for the track algorithm.
Video tracking algorithm of long-term experiment using stand-alone recording system
NASA Astrophysics Data System (ADS)
Chen, Yu-Jen; Li, Yan-Chay; Huang, Ke-Nung; Jen, Sun-Lon; Young, Ming-Shing
2008-08-01
Many medical and behavioral applications require the ability to monitor and quantify the behavior of small animals. In general these animals are confined in small cages. Often these situations involve very large numbers of cages. Modern research facilities commonly monitor simultaneously thousands of animals over long periods of time. However, conventional systems require one personal computer per monitoring platform, which is too complex, expensive, and increases power consumption for large laboratory applications. This paper presents a simplified video tracking algorithm for long-term recording using a stand-alone system. The feature of the presented tracking algorithm revealed that computation speed is very fast data storage requirements are small, and hardware requirements are minimal. The stand-alone system automatically performs tracking and saving acquired data to a secure digital card. The proposed system is designed for video collected at a 640×480 pixel with 16 bit color resolution. The tracking result is updated every 30 frames/s. Only the locomotive data are stored. Therefore, the data storage requirements could be minimized. In addition, detection via the designed algorithm uses the Cb and Cr values of a colored marker affixed to the target to define the tracked position and allows multiobject tracking against complex backgrounds. Preliminary experiment showed that such tracking information stored by the portable and stand-alone system could provide comprehensive information on the animal's activity.
Novel automatic eye detection and tracking algorithm
NASA Astrophysics Data System (ADS)
Ghazali, Kamarul Hawari; Jadin, Mohd Shawal; Jie, Ma; Xiao, Rui
2015-04-01
The eye is not only one of the most complex but also the most important sensory organ of the human body. Eye detection and eye tracking are basement and hot issue in image processing. A non-invasive eye location and eye tracking is promising for hands-off gaze-based human-computer interface, fatigue detection, instrument control by paraplegic patients and so on. For this purpose, an innovation work frame is proposed to detect and tracking eye in video sequence in this paper. The contributions of this work can be divided into two parts. The first contribution is that eye filters were trained which can detect eye location efficiently and accurately without constraints on the background and skin colour. The second contribution is that a framework of tracker based on sparse representation and LK optic tracker were built which can track eye without constraint on eye status. The experimental results demonstrate the accuracy aspects and the real-time applicability of the proposed approach.
Divergence detectors for multitarget tracking algorithms
NASA Astrophysics Data System (ADS)
Mahler, Ronald
2013-05-01
Single-target tracking filters will typically diverge when their internal measurement or motion models deviate too much from the actual models. Niu, Varshney, Alford, Bubalo, Jones, and Scalzo have proposed a metric-- the normalized innovation squared (NIS)--that recursively estimates the degree of nonlinearity in a single-target tracking problem by detecting filter divergence. This paper establishes the following: (1) NIS can be extended to generalized NIS (GNIS), which addresses more general nonlinearities; (2) NIS and GNIS are actually anomaly detectors, rather than filter-divergence detectors; (3) NIS can be heuristically generalized to a multitarget NIS (MNIS) metric; (4) GNIS also can be rigorously extended to multitarget problems via the multitarget GNIS (MGNIS); (5) explicit, computationally tractable formulas for MGNIS can be derived for use with CPHD and PHD filters; and thus (6) these formulas can be employed as anomaly detectors for use with these filters.
A Novel Tracking Algorithm via Feature Points Matching
Luo, Nan; Sun, Quansen; Chen, Qiang; Ji, Zexuan; Xia, Deshen
2015-01-01
Visual target tracking is a primary task in many computer vision applications and has been widely studied in recent years. Among all the tracking methods, the mean shift algorithm has attracted extraordinary interest and been well developed in the past decade due to its excellent performance. However, it is still challenging for the color histogram based algorithms to deal with the complex target tracking. Therefore, the algorithms based on other distinguishing features are highly required. In this paper, we propose a novel target tracking algorithm based on mean shift theory, in which a new type of image feature is introduced and utilized to find the corresponding region between the neighbor frames. The target histogram is created by clustering the features obtained in the extraction strategy. Then, the mean shift process is adopted to calculate the target location iteratively. Experimental results demonstrate that the proposed algorithm can deal with the challenging tracking situations such as: partial occlusion, illumination change, scale variations, object rotation and complex background clutter. Meanwhile, it outperforms several state-of-the-art methods. PMID:25617769
An automatic and fast centerline extraction algorithm for virtual colonoscopy.
Jiang, Guangxiang; Gu, Lixu
2005-01-01
This paper introduces a new refined centerline extraction algorithm, which is based on and significantly improved from distance mapping algorithms. The new approach include three major parts: employing a colon segmentation method; designing and realizing a fast Euclidean Transform algorithm and inducting boundary voxels cutting (BVC) approach. The main contribution is the BVC processing, which greatly speeds up the Dijkstra algorithm and improves the whole performance of the new algorithm. Experimental results demonstrate that the new centerline algorithm was more efficient and accurate comparing with existing algorithms. PMID:17281406
Quantitative comparison of algorithms for tracking single fluorescent particles.
Cheezum, M K; Walker, W F; Guilford, W H
2001-10-01
Single particle tracking has seen numerous applications in biophysics, ranging from the diffusion of proteins in cell membranes to the movement of molecular motors. A plethora of computer algorithms have been developed to monitor the sub-pixel displacement of fluorescent objects between successive video frames, and some have been claimed to have "nanometer" resolution. To date, there has been no rigorous comparison of these algorithms under realistic conditions. In this paper, we quantitatively compare specific implementations of four commonly used tracking algorithms: cross-correlation, sum-absolute difference, centroid, and direct Gaussian fit. Images of fluorescent objects ranging in size from point sources to 5 microm were computer generated with known sub-pixel displacements. Realistic noise was added and the above four algorithms were compared for accuracy and precision. We found that cross-correlation is the most accurate algorithm for large particles. However, for point sources, direct Gaussian fit to the intensity distribution is the superior algorithm in terms of both accuracy and precision, and is the most robust at low signal-to-noise. Most significantly, all four algorithms fail as the signal-to-noise ratio approaches 4. We judge direct Gaussian fit to be the best algorithm when tracking single fluorophores, where the signal-to-noise is frequently near 4. PMID:11566807
Three hypothesis algorithm with occlusion reasoning for multiple people tracking
NASA Astrophysics Data System (ADS)
Reta, Carolina; Altamirano, Leopoldo; Gonzalez, Jesus A.; Medina-Carnicer, Rafael
2015-01-01
This work proposes a detection-based tracking algorithm able to locate and keep the identity of multiple people, who may be occluded, in uncontrolled stationary environments. Our algorithm builds a tracking graph that models spatio-temporal relationships among attributes of interacting people to predict and resolve partial and total occlusions. When a total occlusion occurs, the algorithm generates various hypotheses about the location of the occluded person considering three cases: (a) the person keeps the same direction and speed, (b) the person follows the direction and speed of the occluder, and (c) the person remains motionless during occlusion. By analyzing the graph, our algorithm can detect trajectories produced by false alarms and estimate the location of missing or occluded people. Our algorithm performs acceptably under complex conditions, such as partial visibility of individuals getting inside or outside the scene, continuous interactions and occlusions among people, wrong or missing information on the detection of persons, as well as variation of the person's appearance due to illumination changes and background-clutter distracters. Our algorithm was evaluated on test sequences in the field of intelligent surveillance achieving an overall precision of 93%. Results show that our tracking algorithm outperforms even trajectory-based state-of-the-art algorithms.
An enhanced fast scanning algorithm for image segmentation
NASA Astrophysics Data System (ADS)
Ismael, Ahmed Naser; Yusof, Yuhanis binti
2015-12-01
Segmentation is an essential and important process that separates an image into regions that have similar characteristics or features. This will transform the image for a better image analysis and evaluation. An important benefit of segmentation is the identification of region of interest in a particular image. Various algorithms have been proposed for image segmentation and this includes the Fast Scanning algorithm which has been employed on food, sport and medical images. It scans all pixels in the image and cluster each pixel according to the upper and left neighbor pixels. The clustering process in Fast Scanning algorithm is performed by merging pixels with similar neighbor based on an identified threshold. Such an approach will lead to a weak reliability and shape matching of the produced segments. This paper proposes an adaptive threshold function to be used in the clustering process of the Fast Scanning algorithm. This function used the gray'value in the image's pixels and variance Also, the level of the image that is more the threshold are converted into intensity values between 0 and 1, and other values are converted into intensity values zero. The proposed enhanced Fast Scanning algorithm is realized on images of the public and private transportation in Iraq. Evaluation is later made by comparing the produced images of proposed algorithm and the standard Fast Scanning algorithm. The results showed that proposed algorithm is faster in terms the time from standard fast scanning.
Vehicle tracking algorithm based on GPS and map-matching
NASA Astrophysics Data System (ADS)
Guan, Guixia; Yan, Lei; Chen, Jiabin; Wu, Taixia
2008-10-01
In the land vehicle positioning and tracking system, the vehicle moving route is sometimes positioned outside the vehicle running road because of the GPS positioning errors. It may cause the tracking system unavailable. In order to improve the positioning accuracy of vehicle tracking system, a current statistical model is employed as the vehicle moving model. At the same time, the map-matching algorithm with the nearest location and the suitable moving angle is proposed to amend GPS measured data. The algorithm can determine the best matching road by making full use of the road geographic information of electronic map. Simulation results show that the vehicle tracking system has high positioning accuracy besides the navigation function.
Robust illumination-invariant tracking algorithm based on HOGs
NASA Astrophysics Data System (ADS)
Miramontes-Jaramillo, Daniel; Kober, Vitaly; Díaz-Ramírez, Víctor H.
2015-09-01
Common tracking systems are usually affected by environmental and technical interferences such as non-uniform illumination, sensors' noise, geometrical scene distortion, etc. Among these issues, the former is particularly interesting because it destroys important spatial characteristics of objects in observed scenes. We propose a two-step tracking algorithm: first, preprocessing locally normalizes the illumination difference between the target object and observed frames; second, the normalized object is tracked by means of a designed template structure based on histograms of oriented gradients and kinematic prediction model. The algorithm performance is tested in terms of recognition and localization errors in real scenarios. In order to achieve high rate of the processing, we use GPU parallel processing technologies. Finally, our algorithm is compared with other state-of-the-art trackers.
Silicon vertex tracker: a fast precise tracking trigger for CDF
NASA Astrophysics Data System (ADS)
Ashmanskas, W.; Bardi, A.; Bari, M.; Belforte, S.; Berryhill, J.; Bogdan, M.; Cerri, A.; Clark, A. G.; Chlanchidze, G.; Condorelli, R.; Culbertson, R.; Dell'Orso, M.; Donati, S.; Frisch, H. J.; Galeotti, S.; Giannetti, P.; Glagolev, V.; Leger, A.; Meschi, E.; Morsani, F.; Nakaya, T.; Punzi, G.; Ristori, L.; Sanders, H.; Semenov, A.; Signorelli, G.; Shochet, M.; Speer, T.; Spinella, F.; Wilson, P.; Wu, Xin; Zanetti, A. M.
2000-06-01
The Silicon Vertex Tracker (SVT), currently being built for the CDF II experiment, is a hardware device that reconstructs 2-D tracks online using measurements from the Silicon Vertex Detector (SVXII) and the Central Outer Tracker (COT). The precise measurement of the impact parameter of the SVT tracks will allow, for the first time in a hadron collider environment, to trigger on events containing B hadrons that are very important for many studies, such as CP violation in the b sector and searching for new heavy particles decaying to b b¯ . In this report we describe the overall architecture, algorithms and the hardware implementation of the SVT.
Visual tracking method based on cuckoo search algorithm
NASA Astrophysics Data System (ADS)
Gao, Ming-Liang; Yin, Li-Ju; Zou, Guo-Feng; Li, Hai-Tao; Liu, Wei
2015-07-01
Cuckoo search (CS) is a new meta-heuristic optimization algorithm that is based on the obligate brood parasitic behavior of some cuckoo species in combination with the Lévy flight behavior of some birds and fruit flies. It has been found to be efficient in solving global optimization problems. An application of CS is presented to solve the visual tracking problem. The relationship between optimization and visual tracking is comparatively studied and the parameters' sensitivity and adjustment of CS in the tracking system are experimentally studied. To demonstrate the tracking ability of a CS-based tracker, a comparative study of tracking accuracy and speed of the CS-based tracker with six "state-of-art" trackers, namely, particle filter, meanshift, PSO, ensemble tracker, fragments tracker, and compressive tracker are presented. Comparative results show that the CS-based tracker outperforms the other trackers.
Implementation and analysis of a fast backprojection algorithm
NASA Astrophysics Data System (ADS)
Gorham, LeRoy A.; Majumder, Uttam K.; Buxa, Peter; Backues, Mark J.; Lindgren, Andrew C.
2006-05-01
The convolution backprojection algorithm is an accurate synthetic aperture radar imaging technique, but it has seen limited use in the radar community due to its high computational costs. Therefore, significant research has been conducted for a fast backprojection algorithm, which surrenders some image quality for increased computational efficiency. This paper describes an implementation of both a standard convolution backprojection algorithm and a fast backprojection algorithm optimized for use on a Linux cluster and a field-programmable gate array (FPGA) based processing system. The performance of the different implementations is compared using synthetic ideal point targets and the SPIE XPatch Backhoe dataset.
Fast non-iterative calibration of an external motion tracking device
Zahneisen, Benjamin; Lovell-Smith, Chris; Herbst, Michael; Zaitsev, Maxim; Speck, Oliver; Armstrong, Brian; Ernst, Thomas
2013-01-01
Purpose Prospective motion correction of MR scans commonly uses an external device, such as a camera, to track the pose of the organ of interest. However, in order for external tracking data to be translated into the MR scanner reference frame, the pose of the camera relative to the MR scanner must be known accurately. Here, we describe a fast, accurate, non-iterative technique to determine the position of an external tracking device de novo relative to the MR reference frame. Theory and Methods The method relies on imaging a sparse object that allows simultaneous tracking of arbitrary rigid body transformations in the reference frame of the MRI machine and that of the external tracking device. Results Large motions in the MRI reference frame can be measured using a sparse phantom with an accuracy of 0.2 mm, or approximately 1/10 of the voxel size. By using a dual quaternion algorithm to solve the calibration problem, a good camera calibration can be achieved with fewer than 6 measurements. Further refinements can be achieved by applying the method iteratively and using motion correction feedback. Conclusion Independent tracking of a series of movements in two reference frames allows for an analytical solution to the hand-eye-calibration problem for various motion tracking setups in MRI. PMID:23788117
A fast quaternion-based orientation optimizer via virtual rotation for human motion tracking.
Lee, Jung Keun; Park, Edward J
2009-05-01
For real-time ambulatory human motion tracking with low-cost inertial/magnetic sensors, a computationally efficient and robust algorithm for estimating orientation is critical. This paper presents a quaternion-based orientation optimizer for tracking human body motion, using triaxis rate gyro, accelerometer, and magnetometer signals. The proposed optimizer uses a Gauss-Newton (G-N) method for finding the best-fit quaternion. In order to decrease the computing time, the optimizer is formulated using a virtual rotation concept that allows very fast quaternion updates compared to the conventional G-N method. In addition, to guard against the effects of fast body motions and temporary ferromagnetic disturbances, a situational measurement vector selection procedure is adopted in conjunction with the G-N optimizer. The accuracy of orientation estimates is validated experimentally, using arm motion trials. PMID:19473934
Solar Load Voltage Tracking for Water Pumping: An Algorithm
NASA Astrophysics Data System (ADS)
Kappali, M.; Udayakumar, R. Y.
2014-07-01
Maximum power is to be harnessed from solar photovoltaic (PV) panel to minimize the effective cost of solar energy. This is accomplished by maximum power point tracking (MPPT). There are different methods to realise MPPT. This paper proposes a simple algorithm to implement MPPT lv method in a closed loop environment for centrifugal pump driven by brushed PMDC motor. Simulation testing of the algorithm is done and the results are found to be encouraging and supportive of the proposed method MPPT lv .
Fast algorithm for peptide sequencing by mass spectroscopy.
Bartels, C
1990-01-01
An automatic algorithm for sequencing polypeptides from fast atom bombardment tandem mass spectra is presented.Based on graph theory considerations it finds the most probable sequences, even if the amino acid composition is unknown, by scoring mass differences. The algorithm is fast as the computing time increases by less than the square of the number of amino acids. Pairs of two or three amino acids are proposed to explain the gap if peaks are missing. PMID:24730078
NASA Astrophysics Data System (ADS)
Gao, Min; Zhang, Heng; Zhou, Yulong; Zhang, Baoquan
2016-03-01
In an effort to improve the tracking accuracy of the ground maneuvering target in infrared images, a method is proposed based on the strong tracking filter (STF) and the cubature Kalman filter (CKF) algorithms. In this method, the fading factor is introduced from the STF algorithm and is calculated by transforming the nonlinear measurement variance matrix to be linear approximately, and then the fading factor is used to correct the prediction error covariance matrix (PECM) of CKF, so that the gain matrix can be adjusted at real time and hence the tracking ability of the maneuvering target could be improved. After the digital simulation experiment, it is shown that, comparing with CKF and the unscented Kalman filter algorithms, the average tracking accuracy of the location is increased by more than 20% with the target velocity under 20 m/s and acceleration under 5 m/s2, and it can even be increased by 50% when the target step maneuver occurs. With the tracking experiment on the real infrared tank images, it can be concluded that the target could be tracked stably by the proposed method, and the maximum tracking error is not more than 8 pixels even though the 180 deg turning takes place.
Real-Time Robust Tracking for Motion Blur and Fast Motion via Correlation Filters.
Xu, Lingyun; Luo, Haibo; Hui, Bin; Chang, Zheng
2016-01-01
Visual tracking has extensive applications in intelligent monitoring and guidance systems. Among state-of-the-art tracking algorithms, Correlation Filter methods perform favorably in robustness, accuracy and speed. However, it also has shortcomings when dealing with pervasive target scale variation, motion blur and fast motion. In this paper we proposed a new real-time robust scheme based on Kernelized Correlation Filter (KCF) to significantly improve performance on motion blur and fast motion. By fusing KCF and STC trackers, our algorithm also solve the estimation of scale variation in many scenarios. We theoretically analyze the problem for CFs towards motions and utilize the point sharpness function of the target patch to evaluate the motion state of target. Then we set up an efficient scheme to handle the motion and scale variation without much time consuming. Our algorithm preserves the properties of KCF besides the ability to handle special scenarios. In the end extensive experimental results on benchmark of VOT datasets show our algorithm performs advantageously competed with the top-rank trackers. PMID:27618046
From the Fast Track to the Fast Lane--To What?
ERIC Educational Resources Information Center
Weininger, Otto
1990-01-01
Young children are being fast tracked at early age because of pressures from parents, schools, society, and media. One result is troubled teenagers who experience stress of these pressures without having adult means to cope with them. Time spent with parents and in play activities are activities that help children to gain security, happiness, and…
A baseline algorithm for face detection and tracking in video
NASA Astrophysics Data System (ADS)
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.
[A tracking algorithm for live mitochondria in fluorescent microscopy images].
Xu, Junmei; Li, Yang; Du, Sidan; Zhao, Kanglian
2012-04-01
Quantitative analysis of biological image data generally involves the detection of many pixel spots. In live mitochondria video image, for which fluorescent microscopy is often used, the signal-to-noise ratio (SNR) can be extremely low, making the detection and tracking of mitochondria particle difficult. It is especially not easy to get the movement curve when the movement of the mitochondria involves its self-move and the motion caused by the neuron. An tracking algorithm for live mitochondria is proposed in this paper. First the whole image sequence is frame-to-frame registered, in which the edge corners are chosen to be the feature points. Then the mitochondria particles are tracked by frame-to-frame displacement vector. The algorithm proposed has been applied to the dynamic image sequence including neuron and mitochondria, saving time without manually picking up the feature points. It provides an new method and reference for medical image processing and biotechnological research. PMID:22616189
Multi-expert tracking algorithm based on improved compressive tracker
NASA Astrophysics Data System (ADS)
Feng, Yachun; Zhang, Hong; Yuan, Ding
2015-12-01
Object tracking is a challenging task in computer vision. Most state-of-the-art methods maintain an object model and update the object model by using new examples obtained incoming frames in order to deal with the variation in the appearance. It will inevitably introduce the model drift problem into the object model updating frame-by-frame without any censorship mechanism. In this paper, we adopt a multi-expert tracking framework, which is able to correct the effect of bad updates after they happened such as the bad updates caused by the severe occlusion. Hence, the proposed framework exactly has the ability which a robust tracking method should process. The expert ensemble is constructed of a base tracker and its formal snapshot. The tracking result is produced by the current tracker that is selected by means of a simple loss function. We adopt an improved compressive tracker as the base tracker in our work and modify it to fit the multi-expert framework. The proposed multi-expert tracking algorithm significantly improves the robustness of the base tracker, especially in the scenes with frequent occlusions and illumination variations. Experiments on challenging video sequences with comparisons to several state-of-the-art trackers demonstrate the effectiveness of our method and our tracking algorithm can run at real-time.
Fast algorithms for computing isogenies between elliptic curves
NASA Astrophysics Data System (ADS)
Bostan, A.; Morain, F.; Salvy, B.; Schost, E.
2008-09-01
We survey algorithms for computing isogenies between elliptic curves defined over a field of characteristic either 0 or a large prime. We introduce a new algorithm that computes an isogeny of degree ell ( ell different from the characteristic) in time quasi-linear with respect to ell E This is based in particular on fast algorithms for power series expansion of the Weierstrass wp -function and related functions.
Fast algorithms for transport models. Final report
Manteuffel, T.A.
1994-10-01
This project has developed a multigrid in space algorithm for the solution of the S{sub N} equations with isotropic scattering in slab geometry. The algorithm was developed for the Modified Linear Discontinuous (MLD) discretization in space which is accurate in the thick diffusion limit. It uses a red/black two-cell {mu}-line relaxation. This relaxation solves for all angles on two adjacent spatial cells simultaneously. It takes advantage of the rank-one property of the coupling between angles and can perform this inversion in O(N) operations. A version of the multigrid in space algorithm was programmed on the Thinking Machines Inc. CM-200 located at LANL. It was discovered that on the CM-200 a block Jacobi type iteration was more efficient than the block red/black iteration. Given sufficient processors all two-cell block inversions can be carried out simultaneously with a small number of parallel steps. The bottleneck is the need for sums of N values, where N is the number of discrete angles, each from a different processor. These are carried out by machine intrinsic functions and are well optimized. The overall algorithm has computational complexity O(log(M)), where M is the number of spatial cells. The algorithm is very efficient and represents the state-of-the-art for isotropic problems in slab geometry. For anisotropic scattering in slab geometry, a multilevel in angle algorithm was developed. A parallel version of the multilevel in angle algorithm has also been developed. Upon first glance, the shifted transport sweep has limited parallelism. Once the right-hand-side has been computed, the sweep is completely parallel in angle, becoming N uncoupled initial value ODE`s. The author has developed a cyclic reduction algorithm that renders it parallel with complexity O(log(M)). The multilevel in angle algorithm visits log(N) levels, where shifted transport sweeps are performed. The overall complexity is O(log(N)log(M)).
Fast feature identification for holographic tracking: the orientation alignment transform.
Krishnatreya, Bhaskar Jyoti; Grier, David G
2014-06-01
The concentric fringe patterns created by features in holograms may be associated with a complex-valued orientational order field. Convolution with an orientational alignment operator then identifies centers of symmetry that correspond to the two-dimensional positions of the features. Feature identification through orientational alignment is reminiscent of voting algorithms such as Hough transforms, but may be implemented with fast convolution methods, and so can be orders of magnitude faster. PMID:24921472
Application of fast BLMS algorithm in acoustic echo cancellation
NASA Astrophysics Data System (ADS)
Zhao, Yue; Li, Nian Q.
2013-03-01
The acoustic echo path is usually very long and ranges from several hundreds to few thousands of taps. Frequency domain adaptive filter provides a solution to acoustic echo cancellation by means of resulting a significant reduction in the computational burden. In this paper, fast BLMS (Block Least-Mean-Square) algorithm in frequency domain is realized by using fast FFT technology. The adaptation of filter parameters is actually performed in the frequency domain. The proposed algorithm can ensure convergence with high speed and reduce computational complexity. Simulation results indicate that the algorithm demonstrates good performance for acoustic echo cancellation in communication systems.
A hybrid fast Hankel transform algorithm for electromagnetic modeling
Anderson, W.L.
1989-01-01
A hybrid fast Hankel transform algorithm has been developed that uses several complementary features of two existing algorithms: Anderson's digital filtering or fast Hankel transform (FHT) algorithm and Chave's quadrature and continued fraction algorithm. A hybrid FHT subprogram (called HYBFHT) written in standard Fortran-77 provides a simple user interface to call either subalgorithm. The hybrid approach is an attempt to combine the best features of the two subalgorithms to minimize the user's coding requirements and to provide fast execution and good accuracy for a large class of electromagnetic problems involving various related Hankel transform sets with multiple arguments. Special cases of Hankel transforms of double-order and double-argument are discussed, where use of HYBFHT is shown to be advantageous for oscillatory kernal functions. -Author
Fast Algorithms for Model-Based Diagnosis
NASA Technical Reports Server (NTRS)
Fijany, Amir; Barrett, Anthony; Vatan, Farrokh; Mackey, Ryan
2005-01-01
Two improved new methods for automated diagnosis of complex engineering systems involve the use of novel algorithms that are more efficient than prior algorithms used for the same purpose. Both the recently developed algorithms and the prior algorithms in question are instances of model-based diagnosis, which is based on exploring the logical inconsistency between an observation and a description of a system to be diagnosed. As engineering systems grow more complex and increasingly autonomous in their functions, the need for automated diagnosis increases concomitantly. In model-based diagnosis, the function of each component and the interconnections among all the components of the system to be diagnosed (for example, see figure) are represented as a logical system, called the system description (SD). Hence, the expected behavior of the system is the set of logical consequences of the SD. Faulty components lead to inconsistency between the observed behaviors of the system and the SD. The task of finding the faulty components (diagnosis) reduces to finding the components, the abnormalities of which could explain all the inconsistencies. Of course, the meaningful solution should be a minimal set of faulty components (called a minimal diagnosis), because the trivial solution, in which all components are assumed to be faulty, always explains all inconsistencies. Although the prior algorithms in question implement powerful methods of diagnosis, they are not practical because they essentially require exhaustive searches among all possible combinations of faulty components and therefore entail the amounts of computation that grow exponentially with the number of components of the system.
A Midsize Tokamak As Fast Track To Burning Plasmas
E. Mazzucato
2010-07-14
This paper presents a midsize tokamak as a fast track to the investigation of burning plasmas. It is shown that it could reach large values of energy gain (≥10) with only a modest improvement in confinement over the scaling that was used for designing the International Thermonuclear Experimental Reactor (ITER). This could be achieved by operating in a low plasma recycling regime that experiments indicate can lead to improved plasma confinement. The possibility of reaching the necessary conditions of low recycling using a more efficient magnetic divertor than those of present tokamaks is discussed.
Short Hospital Stay after Laparoscopic Colorectal Surgery without Fast Track
Burgdorf, Stefan K.; Rosenberg, Jacob
2012-01-01
Purpose. Short hospital stay and equal or reduced complication rates have been demonstrated after fast track open colonic surgery. However, fast track principles of perioperative care can be difficult to implement and often require increased nursing staff because of more concentrated nursing tasks during the shorter hospital stay. Specific data on nursing requirements after laparoscopic surgery are lacking. The purpose of the study was to evaluate the effect of operative technique (open versus laparoscopic operation), but without changing nurse staffing or principles for peri- or postoperative care, that is, without implementing fast track principles, on length of stay after colorectal resection for cancer. Methods. Records of all patients operated for colorectal cancer from November 2004 to December 2008 in our department were reviewed. No specific patients were selected for laparoscopic repair, which was solely dependent on the presence of two specific surgeons at the same time. Thus, the patients were not selected for laparoscopic repair based on patient-related factors, but only on the simultaneous presence of two specific surgeons on the day of the operation. Results. Of a total of 540 included patients, 213 (39%) were operated by a laparoscopic approach. The median hospital stay for patients with a primary anastomosis was significantly shorter after laparoscopic than after conventional open surgery (5 versus 8 days, P < 0.001) while there was no difference in patients receiving a stoma (10 versus 10 days, ns), with no changes in the perioperative care regimens. Furthermore there were significant lower blood loss (50 versus 200 mL, P < 0.001) and lower complication rate (21% versus 32%, P = 0.006) in the laparoscopic group. Conclusion. Implementing laparoscopic colorectal surgery in our department resulted in shorter hospital stay without using fast track principles for peri- and postoperative care in patients not receiving a stoma during the operation
Fast algorithm for probabilistic bone edge detection (FAPBED)
NASA Astrophysics Data System (ADS)
Scepanovic, Danilo; Kirshtein, Joshua; Jain, Ameet K.; Taylor, Russell H.
2005-04-01
The registration of preoperative CT to intra-operative reality systems is a crucial step in Computer Assisted Orthopedic Surgery (CAOS). The intra-operative sensors include 3D digitizers, fiducials, X-rays and Ultrasound (US). FAPBED is designed to process CT volumes for registration to tracked US data. Tracked US is advantageous because it is real time, noninvasive, and non-ionizing, but it is also known to have inherent inaccuracies which create the need to develop a framework that is robust to various uncertainties, and can be useful in US-CT registration. Furthermore, conventional registration methods depend on accurate and absolute segmentation. Our proposed probabilistic framework addresses the segmentation-registration duality, wherein exact segmentation is not a prerequisite to achieve accurate registration. In this paper, we develop a method for fast and automatic probabilistic bone surface (edge) detection in CT images. Various features that influence the likelihood of the surface at each spatial coordinate are combined using a simple probabilistic framework, which strikes a fair balance between a high-level understanding of features in an image and the low-level number crunching of standard image processing techniques. The algorithm evaluates different features for detecting the probability of a bone surface at each voxel, and compounds the results of these methods to yield a final, low-noise, probability map of bone surfaces in the volume. Such a probability map can then be used in conjunction with a similar map from tracked intra-operative US to achieve accurate registration. Eight sample pelvic CT scans were used to extract feature parameters and validate the final probability maps. An un-optimized fully automatic Matlab code runs in five minutes per CT volume on average, and was validated by comparison against hand-segmented gold standards. The mean probability assigned to nonzero surface points was 0.8, while nonzero non-surface points had a mean
Fast-neutron spectroscopy studies using induced-proton tracks in PADC track detectors
NASA Astrophysics Data System (ADS)
El-Sersy, A. R.; Eman, S. A.
2010-06-01
In this work, a simple and adequate method for fast-neutron spectroscopy is proposed. This method was performed by free-in-air fast-neutron irradiation of CR-39 Nuclear Track Detectors (NTD) using an Am-Be source. Detectors were then chemically etched to remove few layers up to a thickness of 6.25 μm. By using an automatic image analyzer system for studying the registration of the induced-proton tracks in the NTD, the obtained data were analyzed via two tracks shapes. In the first one, the elliptical tracks were eliminated from the calculation and only the circular ones were considered in developing the response function. In the second method all registered tracks were considered and the corresponding response function was obtained. The rate of energy loss of the protons as a function of V[(d E/d X) - V] was calculated using the Monte Carlo simulation. The induced-proton energy was extracted from the corresponding d E/d X in NTD using a computer program based on the Bethe-Bloch function. The energy of the incident particles was up to few hundred MeV/nucleon. The energy of the interacting neutrons was then estimated by means of the extracted induced-proton energies and the scattering angle. It was found that the present resulting energy distribution of the fast-neutron spectrum from the Am-Be source was similar to that given in the literature where an average neutron energy of 4.6MeV was obtained.
A fast SEQUEST cross correlation algorithm.
Eng, Jimmy K; Fischer, Bernd; Grossmann, Jonas; Maccoss, Michael J
2008-10-01
The SEQUEST program was the first and remains one of the most widely used tools for assigning a peptide sequence within a database to a tandem mass spectrum. The cross correlation score is the primary score function implemented within SEQUEST and it is this score that makes the tool particularly sensitive. Unfortunately, this score is computationally expensive to calculate, and thus, to make the score manageable, SEQUEST uses a less sensitive but fast preliminary score and restricts the cross correlation to just the top 500 peptides returned by the preliminary score. Classically, the cross correlation score has been calculated using Fast Fourier Transforms (FFT) to generate the full correlation function. We describe an alternate method of calculating the cross correlation score that does not require FFTs and can be computed efficiently in a fraction of the time. The fast calculation allows all candidate peptides to be scored by the cross correlation function, potentially mitigating the need for the preliminary score, and enables an E-value significance calculation based on the cross correlation score distribution calculated on all candidate peptide sequences obtained from a sequence database. PMID:18774840
Infrared image guidance for ground vehicle based on fast wavelet image focusing and tracking
NASA Astrophysics Data System (ADS)
Akiyama, Akira; Kobayashi, Nobuaki; Mutoh, Eiichiro; Kumagai, Hideo; Yamada, Hirofumi; Ishii, Hiromitsu
2009-08-01
We studied the infrared image guidance for ground vehicle based on the fast wavelet image focusing and tracking. Here we uses the image of the uncooled infrared imager mounted on the two axis gimbal system and the developed new auto focusing algorithm on the Daubechies wavelet transform. The developed new focusing algorithm on the Daubechies wavelet transform processes the result of the high pass filter effect to meet the direct detection of the objects. This new focusing gives us the distance information of the outside world smoothly, and the information of the gimbal system gives us the direction of objects in the outside world to match the sense of the spherical coordinate system. We installed this system on the hand made electric ground vehicle platform powered by 24VDC battery. The electric vehicle equips the rotary encoder units and the inertia rate sensor units to make the correct navigation process. The image tracking also uses the developed newt wavelet focusing within several image processing. The size of the hand made electric ground vehicle platform is about 1m long, 0.75m wide, 1m high, and 50kg weight. We tested the infrared image guidance for ground vehicle based on the new wavelet image focusing and tracking using the electric vehicle indoor and outdoor. The test shows the good results by the developed infrared image guidance for ground vehicle based on the new wavelet image focusing and tracking.
Two fast algorithms of image inpainting
NASA Astrophysics Data System (ADS)
He, Yuqing; Hou, Zhengxin; Wang, Chengyou
2008-03-01
Digital image inpainting is an interesting new research topic in multimedia computing and image processing since 2000. This talk covers the most recent contributions in digital image inpainting and image completion, as well as concepts in video inpainting. Image inpainting refers to reconstructing the corrupt regions where the data are all destroyed. A primary class of the technique is to build up a Partial Differential Equation (PDE), consider it as a boundary problem, and solve it by some iterative method. The most representative and creative one of the inpainting algorithms is Bertalmio-Sapiro-Caselles-Bellester (BSCB) model. After summarizes the development of image inpainting technique, this paper points the research at the improvement on BSCB model, and proposes two algorithms to solve the two drawbacks of this model. The first is selective adaptive interpolation which develops the traditional adaptive interpolation algorithm by introducing a priority value. Besides much faster than BSCB model, it can improve the inpainting effects. The second takes selective adaptive interpolation as a preprocessing step, reduces the operation time and improves the inpainting quality further.
Fast search algorithms for computational protein design.
Traoré, Seydou; Roberts, Kyle E; Allouche, David; Donald, Bruce R; André, Isabelle; Schiex, Thomas; Barbe, Sophie
2016-05-01
One of the main challenges in computational protein design (CPD) is the huge size of the protein sequence and conformational space that has to be computationally explored. Recently, we showed that state-of-the-art combinatorial optimization technologies based on Cost Function Network (CFN) processing allow speeding up provable rigid backbone protein design methods by several orders of magnitudes. Building up on this, we improved and injected CFN technology into the well-established CPD package Osprey to allow all Osprey CPD algorithms to benefit from associated speedups. Because Osprey fundamentally relies on the ability of A* to produce conformations in increasing order of energy, we defined new A* strategies combining CFN lower bounds, with new side-chain positioning-based branching scheme. Beyond the speedups obtained in the new A*-CFN combination, this novel branching scheme enables a much faster enumeration of suboptimal sequences, far beyond what is reachable without it. Together with the immediate and important speedups provided by CFN technology, these developments directly benefit to all the algorithms that previously relied on the DEE/ A* combination inside Osprey* and make it possible to solve larger CPD problems with provable algorithms. PMID:26833706
Quantization Effects and Stabilization of the Fast-Kalman Algorithm
NASA Astrophysics Data System (ADS)
Papaodysseus, Constantin; Alexiou, Constantin; Roussopoulos, George; Panagopoulos, Athanasios
2001-12-01
The exact and actual cause of the failure of the fast-Kalman algorithm due to the generation and propagation of finite-precision or quantization error is presented. It is demonstrated that out of all the formulas that constitute this fast Recursive Least Squares (RLS) scheme only three generate an amount of finite-precision error that consistently propagates in the subsequent iterations and eventually makes the algorithm fail after a certain number of recursions. Moreover, it is shown that there is a very limited number of specific formulas that transmit the generated finite-precision error, while there is another class of formulas that lift or "relax" this error. In addition, a number of general propositions is presented that allow for the calculation of the exact number of erroneous digits with which the various quantities of the fast-Kalman scheme are computed, including the filter coefficients. On the basis of the previous analysis a method of stabilization of the fast-Kalman algorithm is developed and is presented here, a method that allows for the fast-Kalman algorithm to follow very difficult signals such as music, speech, environmental noise, and other nonstationary ones. Finally, a general methodology is pointed out, that allows for the development of new algorithms which, intrinsically, suffer far less of finite-precision problems.
A fast algorithm for numerical solutions to Fortet's equation
NASA Astrophysics Data System (ADS)
Brumen, Gorazd
2008-10-01
A fast algorithm for computation of default times of multiple firms in a structural model is presented. The algorithm uses a multivariate extension of the Fortet's equation and the structure of Toeplitz matrices to significantly improve the computation time. In a financial market consisting of M[not double greater-than sign]1 firms and N discretization points in every dimension the algorithm uses O(nlogn·M·M!·NM(M-1)/2) operations, where n is the number of discretization points in the time domain. The algorithm is applied to firm survival probability computation and zero coupon bond pricing.
X-33 Environmental Impact Statement: A Fast Track Approach
NASA Technical Reports Server (NTRS)
McCaleb, Rebecca C.; Holland, Donna L.
1998-01-01
NASA is required by the National Environmental Policy Act (NEPA) to prepare an appropriate level environmental analysis for its major projects. Development of the X-33 Technology Demonstrator and its associated flight test program required an environmental impact statement (EIS) under the NEPA. The EIS process is consists of four parts: the "Notice of Intent" to prepare an EIS and scoping; the draft EIS which is distributed for review and comment; the final ETS; and the "Record of Decision." Completion of this process normally takes from 2 - 3 years, depending on the complexity of the proposed action. Many of the agency's newest fast track, technology demonstration programs require NEPA documentation, but cannot sustain the lengthy time requirement between program concept development to implementation. Marshall Space Flight Center, in cooperation with Kennedy Space Center, accomplished the NEPA process for the X-33 Program in 13 months from Notice of Intent to Record of Decision. In addition, the environmental team implemented an extensive public involvement process, conducting a total of 23 public meetings for scoping and draft EIS comment along with numerous informal meetings with public officials, civic organizations, and Native American Indians. This paper will discuss the fast track approach used to successfully accomplish the NEPA process for X-33 on time.
"Eztrack": A single-vehicle deterministic tracking algorithm
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.
Fast Track Finding in the ILC's Silicon Detecgor, SiD01
Baker, David E.; /Carnegie Mellon U.
2007-11-07
A fast track finder is presented which, unlike its more efficient, more computationally costly O(n3) time counterparts, tracks particles in O(n) time (for n being the number of hits). Developed as a tool for processing data from the ILC's proposed SiD detector, development of this fast track finder began with that proposed by Pablo Yepes in 1996 and adjusted to accommodate the changes in geometry of the SiD detector. First, space within the detector is voxellated, with hits assigned to voxels according to their r, {phi}, and {eta} coordinates. A hit on the outermost layer is selected, and a 'sample space' is built from the hits in the selected hit's surrounding voxels. The hit in the sample space with the smallest distance to the first is then selected, and the sample space recalculated for this hit. This process continues until the list of hits becomes large enough, at which point the helical circle in the x, y plane is conformally mapped to a line in the x', y' plane, and hits are chosen from the sample spaces of the previous fit by selecting the hits which fit a line to the previously selected points with the smallest {chi}{sup 2}. Track finding terminates when the innermost layer has been reached or no hit in the sample space fits those previously selected to an acceptable {chi}{sup 2}. Again, a hit on the outermost layer is selected and the process repeats until no assignable hits remain. The algorithm proved to be very efficient on artificial diagnostic events, such as one hundred muons scattered at momenta of 1 GeV/c to 10 GeV/c. Unfortunately, when tracking simulated events corresponding to actual physics, the track finder's efficiency decreased drastically (mostly due to signal noise), though future data cleaning programs could noticeably increase its efficiency on these events.
Fast, Parallel and Secure Cryptography Algorithm Using Lorenz's Attractor
NASA Astrophysics Data System (ADS)
Marco, Anderson Gonçalves; Martinez, Alexandre Souto; Bruno, Odemir Martinez
A novel cryptography method based on the Lorenz's attractor chaotic system is presented. The proposed algorithm is secure and fast, making it practical for general use. We introduce the chaotic operation mode, which provides an interaction among the password, message and a chaotic system. It ensures that the algorithm yields a secure codification, even if the nature of the chaotic system is known. The algorithm has been implemented in two versions: one sequential and slow and the other, parallel and fast. Our algorithm assures the integrity of the ciphertext (we know if it has been altered, which is not assured by traditional algorithms) and consequently its authenticity. Numerical experiments are presented, discussed and show the behavior of the method in terms of security and performance. The fast version of the algorithm has a performance comparable to AES, a popular cryptography program used commercially nowadays, but it is more secure, which makes it immediately suitable for general purpose cryptography applications. An internet page has been set up, which enables the readers to test the algorithm and also to try to break into the cipher.
Some important observations on fast decoupled load flow algorithm
Nanda, J.; Kothari, D.P.; Srivastava, S.C.
1987-05-01
This letter brings out clearly for the first time the relative importance and weightage of some of the assumptions made by B. Scott and O. Alsac in their fast decoupled load flow (FDLF) algorithm on its convergence property. Results have been obtained for two sample IEEE test systems. The conclusions of this work are envisaged to be of immense practical relevance while developing a fast decoupled load flow program.
Fast prediction algorithm for multiview video coding
NASA Astrophysics Data System (ADS)
Abdelazim, Abdelrahman; Mein, Stephen James; Varley, Martin Roy; Ait-Boudaoud, Djamel
2013-03-01
The H.264/multiview video coding (MVC) standard has been developed to enable efficient coding for three-dimensional and multiple viewpoint video sequences. The inter-view statistical dependencies are utilized and an inter-view prediction is employed to provide more efficient coding; however, this increases the overall encoding complexity. Motion homogeneity is exploited here to selectively enable inter-view prediction, and to reduce complexity in the motion estimation (ME) and the mode selection processes. This has been accomplished by defining situations that relate macro-blocks' motion characteristics to the mode selection and the inter-view prediction processes. When comparing the proposed algorithm to the H.264/MVC reference software and other recent work, the experimental results demonstrate a significant reduction in ME time while maintaining similar rate-distortion performance.
Computer program for fast Karhunen Loeve transform algorithm
NASA Technical Reports Server (NTRS)
Jain, A. K.
1976-01-01
The fast KL transform algorithm was applied for data compression of a set of four ERTS multispectral images and its performance was compared with other techniques previously studied on the same image data. The performance criteria used here are mean square error and signal to noise ratio. The results obtained show a superior performance of the fast KL transform coding algorithm on the data set used with respect to the above stated perfomance criteria. A summary of the results is given in Chapter I and details of comparisons and discussion on conclusions are given in Chapter IV.
Fast sampling algorithm for Lie-Trotter products.
Predescu, Cristian
2005-04-01
A fast algorithm for path sampling in path-integral Monte Carlo simulations is proposed. The algorithm utilizes the Lévy-Ciesielski implementation of Lie-Trotter products to achieve a mathematically proven computational cost of n log2(n) with the number of time slices n, despite the fact that each path variable is updated separately, for reasons of optimality. In this respect, we demonstrate that updating a group of random variables simultaneously results in loss of efficiency. PMID:15903719
Fast algorithm for integrating inconsistent gradient fields.
Rivera, M; Marroquin, J L; Servin, M; Rodriguez-Vera, R
1997-11-10
A discrete Fourier transform (DFT) based algorithm for solving a quadratic cost functional is proposed; this regularized functional allows one to obtain a consistent gradient field from an inconsistent one. The calculated consistent gradient may then be integrated by use of simple methods. The technique is presented in the context of the phase-unwrapping problem; however, it may be applied to other problems, such as shapes from shading (a robot-vision technique) when inconsistent gradient fields with irregular domains are obtained. The regularized functional introduced here has advantages over existing techniques; in particular, it is able to manage complex irregular domains and to interpolate over regions with invalid data without any smoothness assumptions over the rest of the lattice, so that the estimation error is reduced. Furthermore, there are no free parameters to adjust. The DFT is used to compute a preconditioner because there is highly efficient hardware to perform the calculations and also because it may be computed by optical means. PMID:18264380
A fast image matching algorithm based on key points
NASA Astrophysics Data System (ADS)
Wang, Huilin; Wang, Ying; An, Ru; Yan, Peng
2014-05-01
Image matching is a very important technique in image processing. It has been widely used for object recognition and tracking, image retrieval, three-dimensional vision, change detection, aircraft position estimation, and multi-image registration. Based on the requirements of matching algorithm for craft navigation, such as speed, accuracy and adaptability, a fast key point image matching method is investigated and developed. The main research tasks includes: (1) Developing an improved celerity key point detection approach using self-adapting threshold of Features from Accelerated Segment Test (FAST). A method of calculating self-adapting threshold was introduced for images with different contrast. Hessian matrix was adopted to eliminate insecure edge points in order to obtain key points with higher stability. This approach in detecting key points has characteristics of small amount of computation, high positioning accuracy and strong anti-noise ability; (2) PCA-SIFT is utilized to describe key point. 128 dimensional vector are formed based on the SIFT method for the key points extracted. A low dimensional feature space was established by eigenvectors of all the key points, and each eigenvector was projected onto the feature space to form a low dimensional eigenvector. These key points were re-described by dimension-reduced eigenvectors. After reducing the dimension by the PCA, the descriptor was reduced to 20 dimensions from the original 128. This method can reduce dimensions of searching approximately near neighbors thereby increasing overall speed; (3) Distance ratio between the nearest neighbour and second nearest neighbour searching is regarded as the measurement criterion for initial matching points from which the original point pairs matched are obtained. Based on the analysis of the common methods (e.g. RANSAC (random sample consensus) and Hough transform cluster) used for elimination false matching point pairs, a heuristic local geometric restriction
Fast image matching algorithm based on projection characteristics
NASA Astrophysics Data System (ADS)
Zhou, Lijuan; Yue, Xiaobo; Zhou, Lijun
2011-06-01
Based on analyzing the traditional template matching algorithm, this paper identified the key factors restricting the speed of matching and put forward a brand new fast matching algorithm based on projection. Projecting the grayscale image, this algorithm converts the two-dimensional information of the image into one-dimensional one, and then matches and identifies through one-dimensional correlation, meanwhile, because of normalization has been done, when the image brightness or signal amplitude increasing in proportion, it could also perform correct matching. Experimental results show that the projection characteristics based image registration method proposed in this article could greatly improve the matching speed, which ensuring the matching accuracy as well.
A fast directional algorithm for high-frequency electromagnetic scattering
Tsuji, Paul; Ying Lexing
2011-06-20
This paper is concerned with the fast solution of high-frequency electromagnetic scattering problems using the boundary integral formulation. We extend the O(N log N) directional multilevel algorithm previously proposed for the acoustic scattering case to the vector electromagnetic case. We also detail how to incorporate the curl operator of the magnetic field integral equation into the algorithm. When combined with a standard iterative method, this results in an almost linear complexity solver for the combined field integral equations. In addition, the butterfly algorithm is utilized to compute the far field pattern and radar cross section with O(N log N) complexity.
Fast frequency acquisition via adaptive least squares algorithm
NASA Technical Reports Server (NTRS)
Kumar, R.
1986-01-01
A new least squares algorithm is proposed and investigated for fast frequency and phase acquisition of sinusoids in the presence of noise. This algorithm is a special case of more general, adaptive parameter-estimation techniques. The advantages of the algorithms are their conceptual simplicity, flexibility and applicability to general situations. For example, the frequency to be acquired can be time varying, and the noise can be nonGaussian, nonstationary and colored. As the proposed algorithm can be made recursive in the number of observations, it is not necessary to have a priori knowledge of the received signal-to-noise ratio or to specify the measurement time. This would be required for batch processing techniques, such as the fast Fourier transform (FFT). The proposed algorithm improves the frequency estimate on a recursive basis as more and more observations are obtained. When the algorithm is applied in real time, it has the extra advantage that the observations need not be stored. The algorithm also yields a real time confidence measure as to the accuracy of the estimator.
MATLAB tensor classes for fast algorithm prototyping : source code.
Bader, Brett William; Kolda, Tamara Gibson
2004-10-01
We present the source code for three MATLAB classes for manipulating tensors in order to allow fast algorithm prototyping. A tensor is a multidimensional or Nway array. This is a supplementary report; details on using this code are provided separately in SAND-XXXX.
NASA Astrophysics Data System (ADS)
Yepes, Pablo P.; Eley, John G.; Liu, Amy; Mirkovic, Dragan; Randeniya, Sharmalee; Titt, Uwe; Mohan, Radhe
2016-04-01
Monte Carlo (MC) methods are acknowledged as the most accurate technique to calculate dose distributions. However, due its lengthy calculation times, they are difficult to utilize in the clinic or for large retrospective studies. Track-repeating algorithms, based on MC-generated particle track data in water, accelerate dose calculations substantially, while essentially preserving the accuracy of MC. In this study, we present the validation of an efficient dose calculation algorithm for intensity modulated proton therapy, the fast dose calculator (FDC), based on a track-repeating technique. We validated the FDC algorithm for 23 patients, which included 7 brain, 6 head-and-neck, 5 lung, 1 spine, 1 pelvis and 3 prostate cases. For validation, we compared FDC-generated dose distributions with those from a full-fledged Monte Carlo based on GEANT4 (G4). We compared dose-volume-histograms, 3D-gamma-indices and analyzed a series of dosimetric indices. More than 99% of the voxels in the voxelized phantoms describing the patients have a gamma-index smaller than unity for the 2%/2 mm criteria. In addition the difference relative to the prescribed dose between the dosimetric indices calculated with FDC and G4 is less than 1%. FDC reduces the calculation times from 5 ms per proton to around 5 μs.
Yepes, Pablo P; Eley, John G; Liu, Amy; Mirkovic, Dragan; Randeniya, Sharmalee; Titt, Uwe; Mohan, Radhe
2016-04-01
Monte Carlo (MC) methods are acknowledged as the most accurate technique to calculate dose distributions. However, due its lengthy calculation times, they are difficult to utilize in the clinic or for large retrospective studies. Track-repeating algorithms, based on MC-generated particle track data in water, accelerate dose calculations substantially, while essentially preserving the accuracy of MC. In this study, we present the validation of an efficient dose calculation algorithm for intensity modulated proton therapy, the fast dose calculator (FDC), based on a track-repeating technique. We validated the FDC algorithm for 23 patients, which included 7 brain, 6 head-and-neck, 5 lung, 1 spine, 1 pelvis and 3 prostate cases. For validation, we compared FDC-generated dose distributions with those from a full-fledged Monte Carlo based on GEANT4 (G4). We compared dose-volume-histograms, 3D-gamma-indices and analyzed a series of dosimetric indices. More than 99% of the voxels in the voxelized phantoms describing the patients have a gamma-index smaller than unity for the 2%/2 mm criteria. In addition the difference relative to the prescribed dose between the dosimetric indices calculated with FDC and G4 is less than 1%. FDC reduces the calculation times from 5 ms per proton to around 5 μs. PMID:26961764
A fast algorithm for sparse matrix computations related to inversion
NASA Astrophysics Data System (ADS)
Li, S.; Wu, W.; Darve, E.
2013-06-01
We have developed a fast algorithm for computing certain entries of the inverse of a sparse matrix. Such computations are critical to many applications, such as the calculation of non-equilibrium Green's functions Gr and G< for nano-devices. The FIND (Fast Inverse using Nested Dissection) algorithm is optimal in the big-O sense. However, in practice, FIND suffers from two problems due to the width-2 separators used by its partitioning scheme. One problem is the presence of a large constant factor in the computational cost of FIND. The other problem is that the partitioning scheme used by FIND is incompatible with most existing partitioning methods and libraries for nested dissection, which all use width-1 separators. Our new algorithm resolves these problems by thoroughly decomposing the computation process such that width-1 separators can be used, resulting in a significant speedup over FIND for realistic devices — up to twelve-fold in simulation. The new algorithm also has the added advantage that desired off-diagonal entries can be computed for free. Consequently, our algorithm is faster than the current state-of-the-art recursive methods for meshes of any size. Furthermore, the framework used in the analysis of our algorithm is the first attempt to explicitly apply the widely-used relationship between mesh nodes and matrix computations to the problem of multiple eliminations with reuse of intermediate results. This framework makes our algorithm easier to generalize, and also easier to compare against other methods related to elimination trees. Finally, our accuracy analysis shows that the algorithms that require back-substitution are subject to significant extra round-off errors, which become extremely large even for some well-conditioned matrices or matrices with only moderately large condition numbers. When compared to these back-substitution algorithms, our algorithm is generally a few orders of magnitude more accurate, and our produced round-off errors
Fast parallel algorithm for slicing STL based on pipeline
NASA Astrophysics Data System (ADS)
Ma, Xulong; Lin, Feng; Yao, Bo
2016-04-01
In Additive Manufacturing field, the current researches of data processing mainly focus on a slicing process of large STL files or complicated CAD models. To improve the efficiency and reduce the slicing time, a parallel algorithm has great advantages. However, traditional algorithms can't make full use of multi-core CPU hardware resources. In the paper, a fast parallel algorithm is presented to speed up data processing. A pipeline mode is adopted to design the parallel algorithm. And the complexity of the pipeline algorithm is analyzed theoretically. To evaluate the performance of the new algorithm, effects of threads number and layers number are investigated by a serial of experiments. The experimental results show that the threads number and layers number are two remarkable factors to the speedup ratio. The tendency of speedup versus threads number reveals a positive relationship which greatly agrees with the Amdahl's law, and the tendency of speedup versus layers number also keeps a positive relationship agreeing with Gustafson's law. The new algorithm uses topological information to compute contours with a parallel method of speedup. Another parallel algorithm based on data parallel is used in experiments to show that pipeline parallel mode is more efficient. A case study at last shows a suspending performance of the new parallel algorithm. Compared with the serial slicing algorithm, the new pipeline parallel algorithm can make full use of the multi-core CPU hardware, accelerate the slicing process, and compared with the data parallel slicing algorithm, the new slicing algorithm in this paper adopts a pipeline parallel model, and a much higher speedup ratio and efficiency is achieved.
Fast parallel algorithm for slicing STL based on pipeline
NASA Astrophysics Data System (ADS)
Ma, Xulong; Lin, Feng; Yao, Bo
2016-05-01
In Additive Manufacturing field, the current researches of data processing mainly focus on a slicing process of large STL files or complicated CAD models. To improve the efficiency and reduce the slicing time, a parallel algorithm has great advantages. However, traditional algorithms can't make full use of multi-core CPU hardware resources. In the paper, a fast parallel algorithm is presented to speed up data processing. A pipeline mode is adopted to design the parallel algorithm. And the complexity of the pipeline algorithm is analyzed theoretically. To evaluate the performance of the new algorithm, effects of threads number and layers number are investigated by a serial of experiments. The experimental results show that the threads number and layers number are two remarkable factors to the speedup ratio. The tendency of speedup versus threads number reveals a positive relationship which greatly agrees with the Amdahl's law, and the tendency of speedup versus layers number also keeps a positive relationship agreeing with Gustafson's law. The new algorithm uses topological information to compute contours with a parallel method of speedup. Another parallel algorithm based on data parallel is used in experiments to show that pipeline parallel mode is more efficient. A case study at last shows a suspending performance of the new parallel algorithm. Compared with the serial slicing algorithm, the new pipeline parallel algorithm can make full use of the multi-core CPU hardware, accelerate the slicing process, and compared with the data parallel slicing algorithm, the new slicing algorithm in this paper adopts a pipeline parallel model, and a much higher speedup ratio and efficiency is achieved.
Particle filter-based track before detect algorithms
NASA Astrophysics Data System (ADS)
Boers, Yvo; Driessen, Hans
2003-12-01
In this paper we will give a general system setup, that allows the formulation of a wide range of Track Before Detect (TBD) problems. A general basic particle filter algorithm for this system is also provided. TBD is a technique, where tracks are produced directly on the basis of raw (radar) measurements, e.g. power or IQ data, without intermediate processing and decision making. The advantage over classical tracking is that the full information is integrated over time, this leads to a better detection and tracking performance, especially for weak targets. In this paper we look at the filtering and the detection aspect of TBD. We will formulate a detection result, that allows the user to implement any optimal detector in terms of the weights of a running particle filter. We will give a theoretical as well as a numerical (experimental) justification for this. Furthermore, we show that the TBD setup, that is chosen in this paper, allows a straightforward extension to the multi-target case. This easy extension is also due to the fact that the implementation of the solution is by means of a particle filter.
Particle filter-based track before detect algorithms
NASA Astrophysics Data System (ADS)
Boers, Yvo; Driessen, Hans
2004-01-01
In this paper we will give a general system setup, that allows the formulation of a wide range of Track Before Detect (TBD) problems. A general basic particle filter algorithm for this system is also provided. TBD is a technique, where tracks are produced directly on the basis of raw (radar) measurements, e.g. power or IQ data, without intermediate processing and decision making. The advantage over classical tracking is that the full information is integrated over time, this leads to a better detection and tracking performance, especially for weak targets. In this paper we look at the filtering and the detection aspect of TBD. We will formulate a detection result, that allows the user to implement any optimal detector in terms of the weights of a running particle filter. We will give a theoretical as well as a numerical (experimental) justification for this. Furthermore, we show that the TBD setup, that is chosen in this paper, allows a straightforward extension to the multi-target case. This easy extension is also due to the fact that the implementation of the solution is by means of a particle filter.
Performance analysis of bearings-only tracking algorithm
NASA Astrophysics Data System (ADS)
van Huyssteen, David; Farooq, Mohamad
1998-07-01
A number of 'bearing-only' target motion analysis algorithms have appeared in the literature over the years, all suited to track an object based solely on noisy measurements of its angular position. In their paper 'Utilization of Modified Polar (MP) Coordinates for Bearings-Only Tracking' Aidala and Hammel advocate a filter in which the observable and unobservable states are naturally decoupled. While the MP filter has certain advantages over Cartesian and pseudolinear extended Kalman filters, it does not escape the requirement for the observer to steer an optimum maneuvering course to guarantee acceptable performance. This paper demonstrates by simulation the consequence if the observer deviates from this profile, even if it is sufficient to produce full state observability.
A generic sun-tracking algorithm for on-axis solar collector in mobile platforms
NASA Astrophysics Data System (ADS)
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.
Tracking algorithms using log-polar mapped image coordinates
NASA Technical Reports Server (NTRS)
Weiman, Carl F. R.; Juday, Richard D.
1990-01-01
The use of log-polar image sampling coordinates rather than conventional Cartesian coordinates offers a number of advantages for visual tracking and docking of space vehicles. Pixel count is reduced without decreasing the field of view, with commensurate reduction in peripheral resolution. Smaller memory requirements and reduced processing loads are the benefits in working environments where bulk and energy are at a premium. Rotational and zoom symmetries of log-polar coordinates accommodate range and orientation extremes without computational penalties. Separation of radial and rotational coordinates reduces the complexity of several target centering algorithms, described below.
The effect of a 'fast-track' unit on the performance of a cardiothoracic department.
Hadjinikolaou, L.; Cohen, A.; Glenville, B.; Stanbridge, R. D.
2000-01-01
OBJECTIVE: The objective of this study was to describe the impact of a 'fast-track' unit, combined with a computerised system for information collection and analysis, on the clinical practice and finance of a cardiothoracic department over the first 12 month period of its application. METHODS: Within 12 months, starting December 1996, 642 major cardiothoracic cases were performed at the Cardiothoracic Department, St Mary's Hospital, London, after the establishment of a 3-bed 'fast-track' unit, which was supported by a computerised system for admission planning and a pre-admission clinic. The main outcome measures were operating numbers, financial income, patient recovery and operative mortality. RESULTS: The 'fast-track' unit resulted in an increase of the operating numbers (11.3% increase in major cardiac cases) and income (38%), as compared with the year before. Some 525 patients out of 642 (81.8%) were scheduled for the 'fast-track' unit and 492 (93.7%) were successfully 'fast-tracked'. Coronary artery bypass grafting operations had the lowest 'fast-track' failure and mortality rates. Re-do operations and complex coronary procedures presented a high 'fast-track' failure rate of approximately 20-25%. Low cardiac output, postoperative bleeding and respiratory problems were the most frequent causes for 'fast-track' failure. CONCLUSIONS: The development of a 'fast-track' unit, supported by a computerised system for information collection and analysis and a pre-admission clinic, has resulted in a substantial improvement of operating numbers and financial income, without adversely affecting the clinical results. This task demanded close collaboration between a dedicated list manager and a designated member of the medical team. Patient selection with appropriate 'fast-track,' criteria may improve further the efficiency of 'fast-track' units in the future. PMID:10700770
Fast pixel shifting phase unwrapping algorithm in quantitative interferometric microscopy
NASA Astrophysics Data System (ADS)
Xu, Mingfei; Shan, Yanke; Yan, Keding; Xue, Liang; Wang, Shouyu; Liu, Fei
2014-11-01
Quantitative interferometric microscopy is an important method for observing biological samples such as cells and tissues. In order to obtain continuous phase distribution of the sample from the interferogram, phase extracting and phase unwrapping are both needed in quantitative interferometric microscopy. Phase extracting includes fast Fourier transform method and Hilbert transform method, etc., almost all of them are rapid methods. However, traditional unwrapping methods such as least squares algorithm, minimum network flow method, etc. are time-consuming to locate the phase discontinuities which lead to low processing efficiency. Other proposed high-speed phase unwrapping methods always need at least two interferograms to recover final phase distributions which cannot realize real time processing. Therefore, high-speed phase unwrapping algorithm for single interferogram is required to improve the calculation efficiency. Here, we propose a fast phase unwrapping algorithm to realize high-speed quantitative interferometric microscopy, by shifting mod 2π wrapped phase map for one pixel, then multiplying the original phase map and the shifted one, then the phase discontinuities location can be easily determined. Both numerical simulation and experiments confirm that the algorithm features fast, precise and reliable.
Improved genetic algorithm for fast path planning of USV
NASA Astrophysics Data System (ADS)
Cao, Lu
2015-12-01
Due to the complex constraints, more uncertain factors and critical real-time demand of path planning for USV(Unmanned Surface Vehicle), an approach of fast path planning based on voronoi diagram and improved Genetic Algorithm is proposed, which makes use of the principle of hierarchical path planning. First the voronoi diagram is utilized to generate the initial paths and then the optimal path is searched by using the improved Genetic Algorithm, which use multiprocessors parallel computing techniques to improve the traditional genetic algorithm. Simulation results verify that the optimal time is greatly reduced and path planning based on voronoi diagram and the improved Genetic Algorithm is more favorable in the real-time operation.
The Empirical Mode Decomposition algorithm via Fast Fourier Transform
NASA Astrophysics Data System (ADS)
Myakinin, Oleg O.; Zakharov, Valery P.; Bratchenko, Ivan A.; Kornilin, Dmitry V.; Artemyev, Dmitry N.; Khramov, Alexander G.
2014-09-01
In this paper we consider a problem of implementing a fast algorithm for the Empirical Mode Decomposition (EMD). EMD is one of the newest methods for decomposition of non-linear and non-stationary signals. A basis of EMD is formed "on-the-fly", i.e. it depends from a distribution of the signal and not given a priori in contrast on cases Fourier Transform (FT) or Wavelet Transform (WT). The EMD requires interpolating of local extrema sets of signal to find upper and lower envelopes. The data interpolation on an irregular lattice is a very low-performance procedure. A classical description of EMD by Huang suggests doing this through splines, i.e. through solving of a system of equations. Existence of a fast algorithm is the main advantage of the FT. A simple description of an algorithm in terms of Fast Fourier Transform (FFT) is a standard practice to reduce operation's count. We offer a fast implementation of EMD (FEMD) through FFT and some other cost-efficient algorithms. Basic two-stage interpolation algorithm for EMD is composed of a Upscale procedure through FFT and Downscale procedure through a selection procedure for signal's points. First we consider the local maxima (or minima) set without reference to the axis OX, i.e. on a regular lattice. The Upscale through the FFT change the signal's length to the Least Common Multiple (LCM) value of all distances between neighboring extremes on the axis OX. If the LCM value is too large then it is necessary to limit local set of extrema. In this case it is an analog of the spline interpolation. A demo for FEMD in noise reduction task for OCT has been shown.
Study of image matching algorithm and sub-pixel fitting algorithm in target tracking
NASA Astrophysics Data System (ADS)
Yang, Ming-dong; Jia, Jianjun; Qiang, Jia; Wang, Jian-yu
2015-03-01
Image correlation matching is a tracking method that searched a region most approximate to the target template based on the correlation measure between two images. Because there is no need to segment the image, and the computation of this method is little. Image correlation matching is a basic method of target tracking. This paper mainly studies the image matching algorithm of gray scale image, which precision is at sub-pixel level. The matching algorithm used in this paper is SAD (Sum of Absolute Difference) method. This method excels in real-time systems because of its low computation complexity. The SAD method is introduced firstly and the most frequently used sub-pixel fitting algorithms are introduced at the meantime. These fitting algorithms can't be used in real-time systems because they are too complex. However, target tracking often requires high real-time performance, we put forward a fitting algorithm named paraboloidal fitting algorithm based on the consideration above, this algorithm is simple and realized easily in real-time system. The result of this algorithm is compared with that of surface fitting algorithm through image matching simulation. By comparison, the precision difference between these two algorithms is little, it's less than 0.01pixel. In order to research the influence of target rotation on precision of image matching, the experiment of camera rotation was carried on. The detector used in the camera is a CMOS detector. It is fixed to an arc pendulum table, take pictures when the camera rotated different angles. Choose a subarea in the original picture as the template, and search the best matching spot using image matching algorithm mentioned above. The result shows that the matching error is bigger when the target rotation angle is larger. It's an approximate linear relation. Finally, the influence of noise on matching precision was researched. Gaussian noise and pepper and salt noise were added in the image respectively, and the image
"Fast Track" and "Traditional Path" Coaches: Affordances, Agency and Social Capital
ERIC Educational Resources Information Center
Rynne, Steven
2014-01-01
A recent development in large-scale coach accreditation (certification) structures has been the "fast tracking" of former elite athletes. Former elite athletes are often exempted from entry-level qualifications and are generally granted access to fast track courses that are shortened versions of the accreditation courses undertaken by…
National Diffusion Network's Evaluation of the Fast Track Music System 1992-93.
ERIC Educational Resources Information Center
Szymczuk, Michael
This document reports on an evaluation project to determine the effectiveness of the Fast Track method of instrumental music instruction as applied to beginning band instruction. The Fast Track music system is unique because it simultaneously aids both visual and aural learning by using a book and cassette tape approach to instruction. Traditional…
Financing Access and Participation in Primary Education: Is There a "Fast-Track" for Fragile States?
ERIC Educational Resources Information Center
Turrent, Victoria
2011-01-01
Despite moves to "fast-track" progress towards universal primary education, few fragile states have been able to access Fast Track Initiative (FTI) funding facilities. Weak systems and capacity have made these countries a high-risk proposition for donor investment. The absence of credible education sector plans has meant that the majority of…
Fast-track for fast times: catching and keeping generation Y in the nursing workforce.
Walker, Kim
2007-04-01
There is little doubt we find ourselves in challenging times as never before has there been such generational diversity in the nursing workforce. Currently, nurses from four distinct (and now well recognised and discussed) generational groups jostle for primacy of recognition and reward. Equally significant is the acute realisation that our ageing profession must find ways to sustain itself in the wake of huge attrition as the 'baby boomer' nurses start retiring over the next ten to fifteen years. These realities impel us to become ever more strategic in our thinking about how best to manage the workforce of the future. This paper presents two exciting and original innovations currently in train at one of Australia's leading Catholic health care providers: firstly, a new fast-track bachelor of nursing program for fee-paying domestic students. This is a collaborative venture between St Vincent's and Mater Health, Sydney (SV&MHS) and the University of Tasmania (UTas); as far as we know, it is unprecedented in Australia. As well, the two private facilities of SV&MHS, St Vincent's Private (SVPH) and the Mater Hospitals, have developed and implemented a unique 'accelerated progression pathway' (APP) to enable registered nurses with talent and ambition to fast track their career through a competency and merit based system of performance management and reward. Both these initiatives are aimed squarely at the gen Y demographic and provide potential to significantly augment our capacity to recruit and retain quality people well into the future. PMID:17563323
Mean-shift tracking algorithm based on adaptive fusion of multi-feature
NASA Astrophysics Data System (ADS)
Yang, Kai; Xiao, Yanghui; Wang, Ende; Feng, Junhui
2015-10-01
The classic mean-shift tracking algorithm has achieved success in the field of computer vision because of its speediness and efficiency. However, classic mean-shift tracking algorithm would fail to track in some complicated conditions such as some parts of the target are occluded, little color difference between the target and background exists, or sudden change of illumination and so on. In order to solve the problems, an improved algorithm is proposed based on the mean-shift tracking algorithm and adaptive fusion of features. Color, edges and corners of the target are used to describe the target in the feature space, and a method for measuring the discrimination of various features is presented to make feature selection adaptive. Then the improved mean-shift tracking algorithm is introduced based on the fusion of various features. For the purpose of solving the problem that mean-shift tracking algorithm with the single color feature is vulnerable to sudden change of illumination, we eliminate the effects by the fusion of affine illumination model and color feature space which ensures the correctness and stability of target tracking in that condition. Using a group of videos to test the proposed algorithm, the results show that the tracking correctness and stability of this algorithm are better than the mean-shift tracking algorithm with single feature space. Furthermore the proposed algorithm is more robust than the classic algorithm in the conditions of occlusion, target similar with background or illumination change.
Fast wavelet based algorithms for linear evolution equations
NASA Technical Reports Server (NTRS)
Engquist, Bjorn; Osher, Stanley; Zhong, Sifen
1992-01-01
A class was devised of fast wavelet based algorithms for linear evolution equations whose coefficients are time independent. The method draws on the work of Beylkin, Coifman, and Rokhlin which they applied to general Calderon-Zygmund type integral operators. A modification of their idea is applied to linear hyperbolic and parabolic equations, with spatially varying coefficients. A significant speedup over standard methods is obtained when applied to hyperbolic equations in one space dimension and parabolic equations in multidimensions.
NASA Astrophysics Data System (ADS)
Zhao, Zhanlue
This dissertation consists of two parts. The first part deals with the performance appraisal of estimation algorithms. The second part focuses on the application of estimation algorithms to target tracking. Performance appraisal is crucial for understanding, developing and comparing various estimation algorithms. In particular, with the evolvement of estimation theory and the increase of problem complexity, performance appraisal is getting more and more challenging for engineers to make comprehensive conclusions. However, the existing theoretical results are inadequate for practical reference. The first part of this dissertation is dedicated to performance measures which include local performance measures, global performance measures and model distortion measure. The second part focuses on application of the recursive best linear unbiased estimation (BLUE) or linear minimum mean square error (LIB-M-ISE) estimation to nonlinear measurement problem in target tracking. Kalman filter has been the dominant basis for dynamic state filtering for several decades. Beyond Kalman filter, a more fundamental basis for the recursive best linear unbiased filtering has been thoroughly investigated in a series of papers by my advisor Dr. X. Rong Li. Based on the so-called quasi-recursive best linear unbiased filtering technique, the constraints of the Kalman filter Linear-Gaussian assumptions can be relaxed such that a general linear filtering technique for nonlinear systems can be achieved. An approximate optimal BLUE filter is implemented for nonlinear measurements in target tracking which outperforms the existing method significantly in terms of accuracy, credibility and robustness.
A fast track influenza virus vaccine produced in insect cells.
Cox, Manon M J; Hashimoto, Yoshifumi
2011-07-01
The viral surface protein hemagglutinin (HA) has been recognized as a key antigen in the host response to influenza virus in both natural infection and vaccination because neutralizing antibodies directed against HA can mitigate or prevent infection. The baculovirus-insect cell system can be used for the production of recombinant HA molecules and is suitable for influenza vaccine production where annual adjustment of the vaccine is required. This expression system is generally considered safe with minimal potential for growth of human pathogens. Extensive characterization of this novel cell substrate has been performed, none of which has revealed the presence of adventitious agents. Multiple clinical studies have demonstrated that the vaccine is safe, well-tolerated and immunogenic. The baculovirus-insect cell system could, therefore, be used for the expedited production of a safe and efficacious influenza vaccine. As a result, this technology should provide a fast track worldwide solution for newly emerging influenza strains or pandemic preparedness within a few years. PMID:21784229
A parallel, volume-tracking algorithm for unstructured meshes
Mosso, S.J.; Swartz, B.K.; Kothe, D.B.; Ferrell, R.C.
1996-10-01
Many diverse areas of industry benefit from the use of volume of fluid methods to predict the movement of materials. Casting is a common method of part fabrication. The accurate prediction of the casting process is pivotal to industry. Mold design and casting is currently considered an art by industry. It typically involves many trial mold designs, and the rejection of defective parts is costly. Failure of cast parts, because residual stresses reduce the part`s strength, can be catastrophic. Cast parts should have precise geometric details that reduce or eliminate the need for machining after casting. Volume of fluid codes will help designers predict how the molten metal fills a mold and where ay trapped voids remain. Prediction of defects due to thermal contraction or expansion will eliminate defective, trial mold designs and speed the parts to market with fewer rejections. Increasing the predictability and therefore the accuracy of the casting process will reduce the art that is involved in mold design and parts casting. Here, recent enhancements to multidimensional volume-tracking algorithms are presented. Illustrations in two dimensions are given. The improvements include new, local algorithms for interface normal constructions and a new full remapping algorithm for time integration. These methods are used on structured and unstructured grids.
Han, Dongjin; Doan, Nam-Thai; Shim, Hackjoon; Jeon, Byunghwan; Lee, Hyunna; Hong, Youngtaek; Chang, Hyuk-Jae
2014-11-01
We propose a fast seed detection for automatic tracking of coronary arteries in coronary computed tomographic angiography (CCTA). To detect vessel regions, Hessian-based filtering is combined with a new local geometric feature that is based on the similarity of the consecutive cross-sections perpendicular to the vessel direction. It is in turn founded on the prior knowledge that a vessel segment is shaped like a cylinder in axial slices. To improve computational efficiency, an axial slice, which contains part of three main coronary arteries, is selected and regions of interest (ROIs) are extracted in the slice. Only for the voxels belonging to the ROIs, the proposed geometric feature is calculated. With the seed points, which are the centroids of the detected vessel regions, and their vessel directions, vessel tracking method can be used for artery extraction. Here a particle filtering-based tracking algorithm is tested. Using 19 clinical CCTA datasets, it is demonstrated that the proposed method detects seed points and can be used for full automatic coronary artery extraction. ROC (receiver operating characteristic) curve analysis shows the advantages of the proposed method. PMID:25106730
Fast algorithm of low power image reformation for OLED display
NASA Astrophysics Data System (ADS)
Lee, Myungwoo; Kim, Taewhan
2014-04-01
We propose a fast algorithm of low-power image reformation for organic light-emitting diode (OLED) display. The proposed algorithm scales the image histogram in a way to reduce power consumption in OLED display by remapping the gray levels of the pixels in the image based on the fast analysis of the histogram of the input image while maintaining contrast of the image. The key idea is that a large number of gray levels are never used in the images and these gray levels can be effectively exploited to reduce power consumption. On the other hand, to maintain the image contrast the gray level remapping is performed by taking into account the object size in the image to which each gray level is applied, that is, reforming little for the gray levels in the objects of large size. Through experiments with 24 Kodak images, it is shown that our proposed algorithm is able to reduce the power consumption by 10% even with 9% contrast enhancement. Our algorithm runs in a linear time so that it can be applied to moving pictures with high resolution.
A Fast and Exact Algorithm for the Exemplar Breakpoint Distance.
Shao, Mingfu; Moret, Bernard M E
2016-05-01
A fundamental problem in comparative genomics is to compute the distance between two genomes. For two genomes without duplicate genes, we can easily compute a variety of distance measures in linear time, but the problem is NP-hard under most models when genomes contain duplicate genes. Sankoff proposed the use of exemplars to tackle the problem of duplicate genes and gene families: each gene family is represented by a single gene (the exemplar for that family), chosen so as to optimize some metric. Unfortunately, choosing exemplars is itself an NP-hard problem. In this article, we propose a very fast and exact algorithm to compute the exemplar breakpoint distance, based on new insights in the underlying structure of genome rearrangements and exemplars. We evaluate the performance of our algorithm on simulation data and compare its performance to the best effort to date (a divide-and-conquer approach), showing that our algorithm runs much faster and scales much better. We also devise a new algorithm for the intermediate breakpoint distance problem, which can then be applied to assign orthologs. We compare our algorithm with the state-of-the-art method MSOAR by assigning orthologs among five well annotated mammalian genomes, showing that our algorithm runs much faster and is slightly more accurate than MSOAR. PMID:26953781
A fast algorithm for sparse matrix computations related to inversion
Li, S.; Wu, W.; Darve, E.
2013-06-01
We have developed a fast algorithm for computing certain entries of the inverse of a sparse matrix. Such computations are critical to many applications, such as the calculation of non-equilibrium Green’s functions G{sup r} and G{sup <} for nano-devices. The FIND (Fast Inverse using Nested Dissection) algorithm is optimal in the big-O sense. However, in practice, FIND suffers from two problems due to the width-2 separators used by its partitioning scheme. One problem is the presence of a large constant factor in the computational cost of FIND. The other problem is that the partitioning scheme used by FIND is incompatible with most existing partitioning methods and libraries for nested dissection, which all use width-1 separators. Our new algorithm resolves these problems by thoroughly decomposing the computation process such that width-1 separators can be used, resulting in a significant speedup over FIND for realistic devices — up to twelve-fold in simulation. The new algorithm also has the added advantage that desired off-diagonal entries can be computed for free. Consequently, our algorithm is faster than the current state-of-the-art recursive methods for meshes of any size. Furthermore, the framework used in the analysis of our algorithm is the first attempt to explicitly apply the widely-used relationship between mesh nodes and matrix computations to the problem of multiple eliminations with reuse of intermediate results. This framework makes our algorithm easier to generalize, and also easier to compare against other methods related to elimination trees. Finally, our accuracy analysis shows that the algorithms that require back-substitution are subject to significant extra round-off errors, which become extremely large even for some well-conditioned matrices or matrices with only moderately large condition numbers. When compared to these back-substitution algorithms, our algorithm is generally a few orders of magnitude more accurate, and our produced round
A Fast Conformal Mapping Algorithm with No FFT
NASA Astrophysics Data System (ADS)
Luchini, P.; Manzo, F.
1992-08-01
An algorithm is presented for the computation of a conformal mapping discretized on a non-uniformly spaced point set, useful for the numerical solution of many problems of fluid dynamics. Most existing iterative techniques, both those having a linear and those having a quadratic type of convergence, rely on the fast Fourier transform ( FFT) algorithm for calculating a convolution integral which represents the most time-consuming phase of the computation. The FFT, however, definitely cannot be applied to a non-uniform spacing. The algorithm presented in this paper has been made possible by the construction of a calculation method for convolution integrals which, despite not using an FFT, maintains a computation time of the same order as that of the FFT. The new technique is successfully applied to the problem of conformally mapping a closely spaced cascade of airfoils onto a circle, which requires an exceedingly large number of points if it is solved with uniform spacing.
A fast image encryption algorithm based on chaotic map
NASA Astrophysics Data System (ADS)
Liu, Wenhao; Sun, Kehui; Zhu, Congxu
2016-09-01
Derived from Sine map and iterative chaotic map with infinite collapse (ICMIC), a new two-dimensional Sine ICMIC modulation map (2D-SIMM) is proposed based on a close-loop modulation coupling (CMC) model, and its chaotic performance is analyzed by means of phase diagram, Lyapunov exponent spectrum and complexity. It shows that this map has good ergodicity, hyperchaotic behavior, large maximum Lyapunov exponent and high complexity. Based on this map, a fast image encryption algorithm is proposed. In this algorithm, the confusion and diffusion processes are combined for one stage. Chaotic shift transform (CST) is proposed to efficiently change the image pixel positions, and the row and column substitutions are applied to scramble the pixel values simultaneously. The simulation and analysis results show that this algorithm has high security, low time complexity, and the abilities of resisting statistical analysis, differential, brute-force, known-plaintext and chosen-plaintext attacks.
Fast algorithm for calculating chemical kinetics in turbulent reacting flow
NASA Technical Reports Server (NTRS)
Radhakrishnan, K.; Pratt, D. T.
1986-01-01
This paper addresses the need for a fast batch chemistry solver to perform the kinetics part of a split operator formulation of turbulent reacting flows, with special attention focused on the solution of the ordinary differential equations governing a homogeneous gas-phase chemical reaction. For this purpose, a two-part predictor-corrector algorithm which incorporates an exponentially fitted trapezoidal method was developed. The algorithm performs filtering of ill-posed initial conditions, automatic step-size selection, and automatic selection of Jacobi-Newton or Newton-Raphson iteration for convergence to achieve maximum computational efficiency while observing a prescribed error tolerance. The new algorithm, termed CREK1D (combustion reaction kinetics, one-dimensional), compared favorably with the code LSODE when tested on two representative problems drawn from combustion kinetics, and is faster than LSODE.
The Block V Receiver fast acquisition algorithm for the Galileo S-band mission
NASA Technical Reports Server (NTRS)
Aung, M.; Hurd, W. J.; Buu, C. M.; Berner, J. B.; Stephens, S. A.; Gevargiz, J. M.
1994-01-01
A fast acquisition algorithm for the Galileo suppressed carrier, subcarrier, and data symbol signals under low data rate, signal-to-noise ratio (SNR) and high carrier phase-noise conditions has been developed. The algorithm employs a two-arm fast Fourier transform (FFT) method utilizing both the in-phase and quadrature-phase channels of the carrier. The use of both channels results in an improved SNR in the FFT acquisition, enabling the use of a shorter FFT period over which the carrier instability is expected to be less significant. The use of a two-arm FFT also enables subcarrier and symbol acquisition before carrier acquisition. With the subcarrier and symbol loops locked first, the carrier can be acquired from an even shorter FFT period. Two-arm tracking loops are employed to lock the subcarrier and symbol loops parameter modification to achieve the final (high) loop SNR in the shortest time possible. The fast acquisition algorithm is implemented in the Block V Receiver (BVR). This article describes the complete algorithm design, the extensive computer simulation work done for verification of the design and the analysis, implementation issues in the BVR, and the acquisition times of the algorithm. In the expected case of the Galileo spacecraft at Jupiter orbit insertion PD/No equals 14.6 dB-Hz, R(sym) equals 16 symbols per sec, and the predicted acquisition time of the algorithm (to attain a 0.2-dB degradation from each loop to the output symbol SNR) is 38 sec.
Fast Three-Dimensional Single-Particle Tracking in Natural Brain Tissue.
Sokoll, Stefan; Prokazov, Yury; Hanses, Magnus; Biermann, Barbara; Tönnies, Klaus; Heine, Martin
2015-10-01
Observation of molecular dynamics is often biased by the optical very heterogeneous environment of cells and complex tissue. Here, we have designed an algorithm that facilitates molecular dynamic analyses within brain slices. We adjust fast astigmatism-based three-dimensional single-particle tracking techniques to depth-dependent optical aberrations induced by the refractive index mismatch so that they are applicable to complex samples. In contrast to existing techniques, our online calibration method determines the aberration directly from the acquired two-dimensional image stream by exploiting the inherent particle movement and the redundancy introduced by the astigmatism. The method improves the positioning by reducing the systematic errors introduced by the aberrations, and allows correct derivation of the cellular morphology and molecular diffusion parameters in three dimensions independently of the imaging depth. No additional experimental effort for the user is required. Our method will be useful for many imaging configurations, which allow imaging in deep cellular structures. PMID:26445447
Vision-based vehicle detection and tracking algorithm design
NASA Astrophysics Data System (ADS)
Hwang, Junyeon; Huh, Kunsoo; Lee, Donghwi
2009-12-01
The vision-based vehicle detection in front of an ego-vehicle is regarded as promising for driver assistance as well as for autonomous vehicle guidance. The feasibility of vehicle detection in a passenger car requires accurate and robust sensing performance. A multivehicle detection system based on stereo vision has been developed for better accuracy and robustness. This system utilizes morphological filter, feature detector, template matching, and epipolar constraint techniques in order to detect the corresponding pairs of vehicles. After the initial detection, the system executes the tracking algorithm for the vehicles. The proposed system can detect front vehicles such as the leading vehicle and side-lane vehicles. The position parameters of the vehicles located in front are obtained based on the detection information. The proposed vehicle detection system is implemented on a passenger car, and its performance is verified experimentally.
3DRISM Multigrid Algorithm for Fast Solvation Free Energy Calculations.
Sergiievskyi, Volodymyr P; Fedorov, Maxim V
2012-06-12
In this paper we present a fast and accurate method for modeling solvation properties of organic molecules in water with a main focus on predicting solvation (hydration) free energies of small organic compounds. The method is based on a combination of (i) a molecular theory, three-dimensional reference interaction sites model (3DRISM); (ii) a fast multigrid algorithm for solving the high-dimensional 3DRISM integral equations; and (iii) a recently introduced universal correction (UC) for the 3DRISM solvation free energies by properly scaled molecular partial volume (3DRISM-UC, Palmer et al., J. Phys.: Condens. Matter2010, 22, 492101). A fast multigrid algorithm is the core of the method because it helps to reduce the high computational costs associated with solving the 3DRISM equations. To facilitate future applications of the method, we performed benchmarking of the algorithm on a set of several model solutes in order to find optimal grid parameters and to test the performance and accuracy of the algorithm. We have shown that the proposed new multigrid algorithm is on average 24 times faster than the simple Picard method and at least 3.5 times faster than the MDIIS method which is currently actively used by the 3DRISM community (e.g., the MDIIS method has been recently implemented in a new 3DRISM implicit solvent routine in the recent release of the AmberTools 1.4 molecular modeling package (Luchko et al. J. Chem. Theory Comput. 2010, 6, 607-624). Then we have benchmarked the multigrid algorithm with chosen optimal parameters on a set of 99 organic compounds. We show that average computational time required for one 3DRISM calculation is 3.5 min per a small organic molecule (10-20 atoms) on a standard personal computer. We also benchmarked predicted solvation free energy values for all of the compounds in the set against the corresponding experimental data. We show that by using the proposed multigrid algorithm and the 3DRISM-UC model, it is possible to obtain good
A novel fast median filter algorithm without sorting
NASA Astrophysics Data System (ADS)
Yang, Weiping; Zhang, Zhilong; Lu, Xinping; Li, Jicheng; Chen, Dong; Yang, Guopeng
2016-04-01
As one of widely applied nonlinear smoothing filtering methods, median filter is quite effective for removing salt-andpepper noise and impulsive noise while maintaining image edge information without blurring its boundaries, but its computation load is the maximal drawback while applied in real-time processing systems. In order to solve the issue, researchers have proposed many effective fast algorithms and published many papers. However most of the algorithms are based on sorting operations so as to make real-time implementation difficult. In this paper considering the large scale Boolean calculation function and convenient shift operation which are two of the advantages of FPGA(Field Programmable Gate Array), we proposed a novel median value finding algorithm without sorting, which can find the median value effectively and its performing time almost keeps changeless despite how large the filter radius is. Based on the algorithm, a real-time median filter has been realized. A lot of tests demonstrate the validity and correctness of proposed algorithm.
Waiting time at a fast-track diagnostic clinic.
Basta, Y L; Tytgat, K M A J; Klinkenbijl, J H G; Fockens, P; Smets, E M A
2016-06-13
Purpose - Guidelines stating maximum waiting times fail to take cancer patients' expectations into account. Therefore, the purpose of this paper is to assess patients' expectations and experiences with their waiting time at a fast-track clinic. Design/methodology/approach - Patients were selected using a purposeful sampling strategy and were interviewed four times: before the visit; one day after; two weeks after the visit; and one week after starting treatment. Interviews were audiotaped and independently coded by two researchers. Findings - All patients (n=9) preferred a short waiting time before the first visit; they feared that their disease would spread and believed that cancer warrants priority treatment. Six patients experienced the waiting time as short, one had no expectations and two felt they waited longer than expected; three patients changed this evaluation during the study. Six patients received treatment - four preferred to wait before treatment and two wanted to start treatment immediately. Reasons to wait included putting one's affairs in order, or needing to adjust to the diagnosis. Practical implications - Cancer patients prefer a short waiting time before the first visit but have different expectations and needs regarding waiting time before treatment. Ideally, their expectations are managed by their treating physician to match waiting time reality. Originality/value - This is the first study to assess cancer patients' waiting time experiences and how these experiences change over time. This study paves the way for establishing a framework to better assess patient satisfaction with oncology care waiting time. An important aspect, is managing patients' expectations. PMID:27256775
Performance evaluation of imaging seeker tracking algorithm based on multi-features
NASA Astrophysics Data System (ADS)
Li, Yujue; Yan, Jinglong
2011-08-01
The paper presents a new efficient method for performance evaluation of imaging seeker tracking algorithm. The method utilizes multi features which associate with tracking point of each video frame, gets local score(LS) for every feature, and achieves global score(GS) for given tracking algorithm according to the combined strategy. The method can be divided into three steps. In a first step, it extracts evaluation feature from neighbor zone of each tracking point. The feature may include tracking error, shape of target, area of target, tracking path, and so on. Then, as to each feature, a local score can be got rely on the number of target which tracked successfully. It uses similarity measurement and experiential threshold between neighbor zone of tracking point and target template to define tracking successful or not. Of course, the number should be 0 or 1 for single target tracking. Finally, it assigns weight for each feature according to the validity grade for the performance. The weights multiply by local scores and normalized between 0 and 1, this gets global score of certain tracking algorithm. By compare the global score of each tracking algorithm as to certain type of scene, it can evaluate the performance of tracking algorithm quantificational. The proposed method nearly covers all tracking error factors which can be introduced into the process of target tracking, so the evaluation result has a higher reliability. Experimental results, obtained with flying video of infrared imaging seeker, and also included several target tracking algorithms, illustrate the performance of target tracking, demonstrate the effectiveness and robustness of the proposed method.
A fast contour descriptor algorithm for supernova imageclassification
Aragon, Cecilia R.; Aragon, David Bradburn
2006-07-16
We describe a fast contour descriptor algorithm and its application to a distributed supernova detection system (the Nearby Supernova Factory) that processes 600,000 candidate objects in 80 GB of image data per night. Our shape-detection algorithm reduced the number of false positives generated by the supernova search pipeline by 41% while producing no measurable impact on running time. Fourier descriptors are an established method of numerically describing the shapes of object contours, but transform-based techniques are ordinarily avoided in this type of application due to their computational cost. We devised a fast contour descriptor implementation for supernova candidates that meets the tight processing budget of the application. Using the lowest-order descriptors (F{sub 1} and F{sub -1}) and the total variance in the contour, we obtain one feature representing the eccentricity of the object and another denoting its irregularity. Because the number of Fourier terms to be calculated is fixed and small, the algorithm runs in linear time, rather than the O(n log n) time of an FFT. Constraints on object size allow further optimizations so that the total cost of producing the required contour descriptors is about 4n addition/subtraction operations, where n is the length of the contour.
Algorithms for High-Speed Noninvasive Eye-Tracking System
NASA Technical Reports Server (NTRS)
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
NASA Astrophysics Data System (ADS)
Wu, Nengwei; Zhao, Lirong; Zhou, Hui; Chen, Juan
2005-12-01
The servo control system of the optoelectronic tracking equipment usually is a kind of SISO. When the fast moving target is tracked, the over-tune of the servo system is the main representation for the dynamic tracking error. As the result, the tracking ability may be improved by limiting the over-tune. We put forward a method, the advanced position compensation (called as APC in short), which is to check the speed-overtune by applying the advanced position information. For the large accelerate target, small over-tune tracking is achieved, but it lowers the ability for tracking the sine signal at low frequency area. While the dynamic high-type can improve the tracking precision for the sine signal at low frequency area, we work out a brand-new method, which combines the advantages of the both. It increases the tracking precision in the whole frequency band at large scale for the optoelectronic tracking system. The simulation results show that when the target moves with the largest accelerate 120°/s2, 120°/s, the maximum static tracking error is about 0.6".
Spermatozoa motion detection and trajectory tracking algorithm based on orthogonal search
NASA Astrophysics Data System (ADS)
Chacon Murguia, Mario I.; Valdez Martinez, Antonio
1999-10-01
This paper presents a new algorithm for object motion detection and trajectory tracking. This method was developed as part of a machine vision system for human fertility analysis. Fertility analysis is based on the amount of spermatozoa in semen samples and their type of movement. Two approaches were tested to detect the movement of the spermatozoa, image subtraction, and optical flow. Image subtraction is a simple and fast method but it has some complications to detect individual motion when large amounts of objects are presented. The optical flow method is able to detect motion but it turns to be computationally time expensive. It does not generate a specific trajectory of each spermatozoon, and it does not detect static spermatozoa. The algorithm developed detects object motion through an orthogonal search of blocks in consecutive frames. Matching of two blocks in consecutive frames is defined by square differences. A dynamic control array is used to store the trajectory of each spermatozoon, and to deal with all the different situations in the trajectories like, new spermatozoa entering in a frame, spermatozoa leaving the frame, and spermatozoa collision. The algorithm developed turns out to be faster than the optical flow algorithm and solves the problem of the image subtraction method. It also detects static spermatozoa, and generates a motion vector for each spermatozoon that describes their trajectory.
Fast independent component analysis algorithm for quaternion valued signals.
Javidi, Soroush; Took, Clive Cheong; Mandic, Danilo P
2011-12-01
An extension of the fast independent component analysis algorithm is proposed for the blind separation of both Q-proper and Q-improper quaternion-valued signals. This is achieved by maximizing a negentropy-based cost function, and is derived rigorously using the recently developed HR calculus in order to implement Newton optimization in the augmented quaternion statistics framework. It is shown that the use of augmented statistics and the associated widely linear modeling provides theoretical and practical advantages when dealing with general quaternion signals with noncircular (rotation-dependent) distributions. Simulations using both benchmark and real-world quaternion-valued signals support the approach. PMID:22027374
A fast direct sampling algorithm for equilateral closed polygons
NASA Astrophysics Data System (ADS)
Cantarella, Jason; Duplantier, Bertrand; Shonkwiler, Clayton; Uehara, Erica
2016-07-01
Sampling equilateral closed polygons is of interest in the statistical study of ring polymers. Over the past 30 years, previous authors have proposed a variety of simple Markov chain algorithms (but have not been able to show that they converge to the correct probability distribution) and complicated direct samplers (which require extended-precision arithmetic to evaluate numerically unstable polynomials). We present a simple direct sampler which is fast and numerically stable, and analyze its runtime using a new formula for the volume of equilateral polygon space as a Dirichlet-type integral.
A fast-marching like algorithm for geometrical shock dynamics
NASA Astrophysics Data System (ADS)
Noumir, Y.; Le Guilcher, A.; Lardjane, N.; Monneau, R.; Sarrazin, A.
2015-03-01
We develop a new algorithm for the computation of the Geometrical Shock Dynamics (GSD) model. The method relies on the fast-marching paradigm and enables the discrete evaluation of the first arrival time of a shock wave and its local velocity on a Cartesian grid. The proposed algorithm is based on a first order upwind finite difference scheme and reduces to a local nonlinear system of two equations solved by an iterative procedure. Reference solutions are built for a smooth radial configuration and for the 2D Riemann problem. The link between the GSD model and p-systems is given. Numerical experiments demonstrate the efficiency of the scheme and its ability to handle singularities.
Fast Particle Pair Detection Algorithms for Particle Simulations
NASA Astrophysics Data System (ADS)
Iwai, T.; Hong, C.-W.; Greil, P.
New algorithms with O(N) complexity have been developed for fast particle-pair detections in particle simulations like the discrete element method (DEM) and molecular dynamic (MD). They exhibit robustness against broad particle size distributions when compared with conventional boxing methods. Almost similar calculation speeds are achieved at particle size distributions from is mono-size to 1:10 while the linked-cell method results in calculations more than 20 times. The basic algorithm, level-boxing, uses the variable search range according to each particle. The advanced method, multi-level boxing, employs multiple cell layers to reduce the particle size discrepancy. Another method, indexed-level boxing, reduces the size of cell arrays by introducing the hash procedure to access the cell array, and is effective for sparse particle systems with a large number of particles.
Fast clustering algorithm for codebook production in image vector quantization
NASA Astrophysics Data System (ADS)
Al-Otum, Hazem M.
2001-04-01
In this paper, a fast clustering algorithm (FCA) is proposed to be implemented in vector quantization codebook production. This algorithm gives the ability to avoid iterative averaging of vectors and is based on collecting vectors with similar or closely similar characters to produce corresponding clusters. FCA gives an increase in peak signal-to-noise ratio (PSNR) about 0.3 - 1.1 dB, over the LBG algorithm and reduces the computational cost for codebook production (10% - 60%) at different bit rates. Here, two FCA modifications are proposed: FCA with limited cluster size 1& (FCA-LCS1 and FCA-LCS2, respectively). FCA- LCS1 tends to subdivide large clusters into smaller ones while FCA-LCS2 reduces a predetermined threshold by a step to reach the required cluster size. The FCA-LCS1 and FCA- LCS2 give an increase in PSNR of about 0.9 - 1.0 and 0.9 - 1.1 dB, respectively, over the FCA algorithm, at the expense of about 15% - 25% and 18% - 28% increase in the output codebook size.
Peak detection in fiber Bragg grating using a fast phase correlation algorithm
NASA Astrophysics Data System (ADS)
Lamberti, A.; Vanlanduit, S.; De Pauw, B.; Berghmans, F.
2014-05-01
Fiber Bragg grating sensing principle is based on the exact tracking of the peak wavelength location. Several peak detection techniques have already been proposed in literature. Among these, conventional peak detection (CPD) methods such as the maximum detection algorithm (MDA), do not achieve very high precision and accuracy, especially when the Signal to Noise Ratio (SNR) and the wavelength resolution are poor. On the other hand, recently proposed algorithms, like the cross-correlation demodulation algorithm (CCA), are more precise and accurate but require higher computational effort. To overcome these limitations, we developed a novel fast phase correlation algorithm (FPC) which performs as well as the CCA, being at the same time considerably faster. This paper presents the FPC technique and analyzes its performances for different SNR and wavelength resolutions. Using simulations and experiments, we compared the FPC with the MDA and CCA algorithms. The FPC detection capabilities were as precise and accurate as those of the CCA and considerably better than those of the CPD. The FPC computational time was up to 50 times lower than CCA, making the FPC a valid candidate for future implementation in real-time systems.
Repositioning: the fast track to new anti-malarial medicines?
2014-01-01
Background Repositioning of existing drugs has been suggested as a fast track for developing new anti-malarial agents. The compound libraries of GlaxoSmithKline (GSK), Pfizer and AstraZeneca (AZ) comprising drugs that have undergone clinical studies in other therapeutic areas, but not achieved approval, and a set of US Food and Drug Administration (FDA)-approved drugs and other bio-actives were tested against Plasmodium falciparum blood stages. Methods Molecules were tested initially against erythrocytic co-cultures of P. falciparum to measure proliferation inhibition using one of the following methods: SYBR®I dye DNA staining assay (3D7, K1 or NF54 strains); [3H] hypoxanthine radioisotope incorporation assay (3D7 and 3D7A strain); or 4’,6-diamidino-2-phenylindole (DAPI) DNA imaging assay (3D7 and Dd2 strains). After review of the available clinical pharmacokinetic and safety data, selected compounds with low μM activity and a suitable clinical profile were tested in vivo either in a Plasmodium berghei four-day test or in the P. falciparum Pf3D70087/N9 huSCID ‘humanized’ mouse model. Results Of the compounds included in the GSK and Pfizer sets, 3.8% (9/238) had relevant in vitro anti-malarial activity while 6/100 compounds from the AZ candidate drug library were active. In comparison, around 0.6% (24/3,800) of the FDA-approved drugs and other bio-actives were active. After evaluation of available clinical data, four investigational drugs, active in vitro were tested in the P. falciparum humanized mouse model: UK-112,214 (PAF-H1 inhibitor), CEP-701 (protein kinase inhibitor), CEP-1347 (protein kinase inhibitor), and PSC-833 (p-glycoprotein inhibitor). Only UK-112,214 showed significant efficacy against P. falciparum in vivo, although at high doses (ED90 131.3 mg/kg [95% CI 112.3, 156.7]), and parasitaemia was still present 96 hours after treatment commencement. Of the six actives from the AZ library, two compounds (AZ-1 and AZ-3) were marginally
Studies of the possibility to use Gas Pixel Detector as a fast trigger tracking device
NASA Astrophysics Data System (ADS)
Sinev, N.; Bashindzhagyan, G.; Korotkova, N.; Romaniouk, A.; Tikhomirov, V.
2016-02-01
Gas Pixel Detector (GPD) technology offers new possibilities, which make them very attractive for application in existing and future accelerator experiments and beyond. GPDs combine advantages of silicon and gaseous detectors. They can be produced radiation hard and with low power consumption using relatively cheap technology. Low capacitance of the individual pixel channel allows us to obtain a large signal to noise ratio. Using a time projection method for GPD readout one obtains 3D track image with precise coordinate (31 µm) and angular information (0.40°). This feature would allow us to achieve performance of one GPD layer equal to a few layers of silicon detectors. Implementation of a fast readout and data processing at the front-end level allows one to reconstruct a track segment in less than 1 μs, and to use this information for the first level trigger generation. The relevant algorithms of data acquisition and analysis are described and the results of simulations are presented in this paper.
Fast Field Calibration of MIMU Based on the Powell Algorithm
Ma, Lin; Chen, Wanwan; Li, Bin; You, Zheng; Chen, Zhigang
2014-01-01
The calibration of micro inertial measurement units is important in ensuring the precision of navigation systems, which are equipped with microelectromechanical system sensors that suffer from various errors. However, traditional calibration methods cannot meet the demand for fast field calibration. This paper presents a fast field calibration method based on the Powell algorithm. As the key points of this calibration, the norm of the accelerometer measurement vector is equal to the gravity magnitude, and the norm of the gyro measurement vector is equal to the rotational velocity inputs. To resolve the error parameters by judging the convergence of the nonlinear equations, the Powell algorithm is applied by establishing a mathematical error model of the novel calibration. All parameters can then be obtained in this manner. A comparison of the proposed method with the traditional calibration method through navigation tests shows the classic performance of the proposed calibration method. The proposed calibration method also saves more time compared with the traditional calibration method. PMID:25177801
A fast poly-energetic iterative FBP algorithm
NASA Astrophysics Data System (ADS)
Lin, Yuan; Samei, Ehsan
2014-04-01
The beam hardening (BH) effect can influence medical interpretations in two notable ways. First, high attenuation materials, such as bones, can induce strong artifacts, which severely deteriorate the image quality. Second, voxel values can significantly deviate from the real values, which can lead to unreliable quantitative evaluation results. Some iterative methods have been proposed to eliminate the BH effect, but they cannot be widely applied for clinical practice because of the slow computational speed. The purpose of this study was to develop a new fast and practical poly-energetic iterative filtered backward projection algorithm (piFBP). The piFBP is composed of a novel poly-energetic forward projection process and a robust FBP-type backward updating process. In the forward projection process, an adaptive base material decomposition method is presented, based on which diverse body tissues (e.g., lung, fat, breast, soft tissue, and bone) and metal implants can be incorporated to accurately evaluate poly-energetic forward projections. In the backward updating process, one robust and fast FBP-type backward updating equation with a smoothing kernel is introduced to avoid the noise accumulation in the iteration process and to improve the convergence properties. Two phantoms were designed to quantitatively validate our piFBP algorithm in terms of the beam hardening index (BIdx) and the noise index (NIdx). The simulation results showed that piFBP possessed fast convergence speed, as the images could be reconstructed within four iterations. The variation range of the BIdx's of various tissues across phantom size and spectrum were reduced from [-7.5, 17.5] for FBP to [-0.1, 0.1] for piFBP while the NIdx's were maintained in the same low level (about [0.3, 1.7]). When a metal implant presented in a complex phantom, piFBP still had excellent reconstruction performance, as the variation range of the BIdx's of body tissues were reduced from [-2.9, 15.9] for FBP to [-0
Open-source feature-tracking algorithm for sea ice drift retrieval from Sentinel-1 SAR imagery
NASA Astrophysics Data System (ADS)
Muckenhuber, Stefan; Andreevich Korosov, Anton; Sandven, Stein
2016-04-01
A computationally efficient, open-source feature-tracking algorithm, called ORB, is adopted and tuned for sea ice drift retrieval from Sentinel-1 SAR (Synthetic Aperture Radar) images. The most suitable setting and parameter values have been found using four Sentinel-1 image pairs representative of sea ice conditions between Greenland and Severnaya Zemlya during winter and spring. The performance of the algorithm is compared to two other feature-tracking algorithms, namely SIFT (Scale-Invariant Feature Transform) and SURF (Speeded-Up Robust Features). Having been applied to 43 test image pairs acquired over Fram Strait and the north-east of Greenland, the tuned ORB (Oriented FAST and Rotated BRIEF) algorithm produces the highest number of vectors (177 513, SIFT: 43 260 and SURF: 25 113), while being computationally most efficient (66 s, SIFT: 182 s and SURF: 99 s per image pair using a 2.7 GHz processor with 8 GB memory). For validation purposes, 314 manually drawn vectors have been compared with the closest calculated vectors, and the resulting root mean square error of ice drift is 563 m. All test image pairs show a significantly better performance of the HV (horizontal transmit, vertical receive) channel due to higher informativeness. On average, around four times as many vectors have been found using HV polarization. All software requirements necessary for applying the presented feature-tracking algorithm are open source to ensure a free and easy implementation.
ATLAS Tracking Detector Upgrade studies using the Fast Simulation Engine
NASA Astrophysics Data System (ADS)
Calace, Noemi; Salzburger, Andreas
2015-12-01
The successful physics program of the LHC Run-1 data taking period has put a strong emphasis on design studies for future upgrades of the existing LHC detectors. In ATLAS, testing alternative layouts through the full simulation and reconstruction chain is a work-intensive program, which can only be carried out for a few concept layouts. To facilitate layout prototyping, a novel technique based on the ATLAS reconstruction geometry and a fast simulation engine have been established that allow fast layout iterations and a realistic but fast Monte Carlo simulation. This approach is extended by a fast digitisation and reconstruction module.
A fast, robust algorithm for power line interference cancellation in neural recording
NASA Astrophysics Data System (ADS)
Keshtkaran, Mohammad Reza; Yang, Zhi
2014-04-01
Objective. Power line interference may severely corrupt neural recordings at 50/60 Hz and harmonic frequencies. The interference is usually non-stationary and can vary in frequency, amplitude and phase. To retrieve the gamma-band oscillations at the contaminated frequencies, it is desired to remove the interference without compromising the actual neural signals at the interference frequency bands. In this paper, we present a robust and computationally efficient algorithm for removing power line interference from neural recordings. Approach. The algorithm includes four steps. First, an adaptive notch filter is used to estimate the fundamental frequency of the interference. Subsequently, based on the estimated frequency, harmonics are generated by using discrete-time oscillators, and then the amplitude and phase of each harmonic are estimated by using a modified recursive least squares algorithm. Finally, the estimated interference is subtracted from the recorded data. Main results. The algorithm does not require any reference signal, and can track the frequency, phase and amplitude of each harmonic. When benchmarked with other popular approaches, our algorithm performs better in terms of noise immunity, convergence speed and output signal-to-noise ratio (SNR). While minimally affecting the signal bands of interest, the algorithm consistently yields fast convergence (<100 ms) and substantial interference rejection (output SNR >30 dB) in different conditions of interference strengths (input SNR from -30 to 30 dB), power line frequencies (45-65 Hz) and phase and amplitude drifts. In addition, the algorithm features a straightforward parameter adjustment since the parameters are independent of the input SNR, input signal power and the sampling rate. A hardware prototype was fabricated in a 65 nm CMOS process and tested. Software implementation of the algorithm has been made available for open access at https://github.com/mrezak/removePLI. Significance. The proposed
Tracking at CDF: algorithms and experience from Run I and Run II
Snider, F.D.; /Fermilab
2005-10-01
The authors describe the tracking algorithms used during Run I and Run II by CDF at the Fermilab Tevatron Collider, covering the time from about 1992 through the present, and discuss the performance of the algorithms at high luminosity. By tracing the evolution of the detectors and algorithms, they reveal some of the successful strategies used by CDF to address the problems of tracking at high luminosities.
Detection of a Faint Fast-moving Near-Earth Asteroid Using the Synthetic Tracking Technique
NASA Astrophysics Data System (ADS)
Zhai, Chengxing; Shao, Michael; Nemati, Bijan; Werne, Thomas; Zhou, Hanying; Turyshev, Slava G.; Sandhu, Jagmit; Hallinan, Gregg; Harding, Leon K.
2014-09-01
We report a detection of a faint near-Earth asteroid (NEA) using our synthetic tracking technique and the CHIMERA instrument on the Palomar 200 inch telescope. With an apparent magnitude of 23 (H = 29, assuming detection at 20 lunar distances), the asteroid was moving at 6.°32 day-1 and was detected at a signal-to-noise ratio (S/N) of 15 using 30 s of data taken at a 16.7 Hz frame rate. The detection was confirmed by a second observation 77 minutes later at the same S/N. Because of its high proper motion, the NEA moved 7 arcsec over the 30 s of observation. Synthetic tracking avoided image degradation due to trailing loss that affects conventional techniques relying on 30 s exposures; the trailing loss would have degraded the surface brightness of the NEA image on the CCD down to an approximate magnitude of 25 making the object undetectable. This detection was a result of our 12 hr blind search conducted on the Palomar 200 inch telescope over two nights, scanning twice over six (5.°3 × 0.°046) fields. Detecting only one asteroid is consistent with Harris's estimates for the distribution of the asteroid population, which was used to predict a detection of 1.2 NEAs in the H-magnitude range 28-31 for the two nights. The experimental design, data analysis methods, and algorithms are presented. We also demonstrate milliarcsecond-level astrometry using observations of two known bright asteroids on the same system with synthetic tracking. We conclude by discussing strategies for scheduling observations to detect and characterize small and fast-moving NEAs using the new technique.
Detection of a faint fast-moving near-Earth asteroid using the synthetic tracking technique
Zhai, Chengxing; Shao, Michael; Nemati, Bijan; Werne, Thomas; Zhou, Hanying; Turyshev, Slava G.; Sandhu, Jagmit; Hallinan, Gregg; Harding, Leon K.
2014-09-01
We report a detection of a faint near-Earth asteroid (NEA) using our synthetic tracking technique and the CHIMERA instrument on the Palomar 200 inch telescope. With an apparent magnitude of 23 (H = 29, assuming detection at 20 lunar distances), the asteroid was moving at 6.°32 day{sup –1} and was detected at a signal-to-noise ratio (S/N) of 15 using 30 s of data taken at a 16.7 Hz frame rate. The detection was confirmed by a second observation 77 minutes later at the same S/N. Because of its high proper motion, the NEA moved 7 arcsec over the 30 s of observation. Synthetic tracking avoided image degradation due to trailing loss that affects conventional techniques relying on 30 s exposures; the trailing loss would have degraded the surface brightness of the NEA image on the CCD down to an approximate magnitude of 25 making the object undetectable. This detection was a result of our 12 hr blind search conducted on the Palomar 200 inch telescope over two nights, scanning twice over six (5.°3 × 0.°046) fields. Detecting only one asteroid is consistent with Harris's estimates for the distribution of the asteroid population, which was used to predict a detection of 1.2 NEAs in the H-magnitude range 28-31 for the two nights. The experimental design, data analysis methods, and algorithms are presented. We also demonstrate milliarcsecond-level astrometry using observations of two known bright asteroids on the same system with synthetic tracking. We conclude by discussing strategies for scheduling observations to detect and characterize small and fast-moving NEAs using the new technique.
Fast Dating Using Least-Squares Criteria and Algorithms
To, Thu-Hien; Jung, Matthieu; Lycett, Samantha; Gascuel, Olivier
2016-01-01
Phylogenies provide a useful way to understand the evolutionary history of genetic samples, and data sets with more than a thousand taxa are becoming increasingly common, notably with viruses (e.g., human immunodeficiency virus (HIV)). Dating ancestral events is one of the first, essential goals with such data. However, current sophisticated probabilistic approaches struggle to handle data sets of this size. Here, we present very fast dating algorithms, based on a Gaussian model closely related to the Langley–Fitch molecular-clock model. We show that this model is robust to uncorrelated violations of the molecular clock. Our algorithms apply to serial data, where the tips of the tree have been sampled through times. They estimate the substitution rate and the dates of all ancestral nodes. When the input tree is unrooted, they can provide an estimate for the root position, thus representing a new, practical alternative to the standard rooting methods (e.g., midpoint). Our algorithms exploit the tree (recursive) structure of the problem at hand, and the close relationships between least-squares and linear algebra. We distinguish between an unconstrained setting and the case where the temporal precedence constraint (i.e., an ancestral node must be older that its daughter nodes) is accounted for. With rooted trees, the former is solved using linear algebra in linear computing time (i.e., proportional to the number of taxa), while the resolution of the latter, constrained setting, is based on an active-set method that runs in nearly linear time. With unrooted trees the computing time becomes (nearly) quadratic (i.e., proportional to the square of the number of taxa). In all cases, very large input trees (>10,000 taxa) can easily be processed and transformed into time-scaled trees. We compare these algorithms to standard methods (root-to-tip, r8s version of Langley–Fitch method, and BEAST). Using simulated data, we show that their estimation accuracy is similar to
Fast Dating Using Least-Squares Criteria and Algorithms.
To, Thu-Hien; Jung, Matthieu; Lycett, Samantha; Gascuel, Olivier
2016-01-01
Phylogenies provide a useful way to understand the evolutionary history of genetic samples, and data sets with more than a thousand taxa are becoming increasingly common, notably with viruses (e.g., human immunodeficiency virus (HIV)). Dating ancestral events is one of the first, essential goals with such data. However, current sophisticated probabilistic approaches struggle to handle data sets of this size. Here, we present very fast dating algorithms, based on a Gaussian model closely related to the Langley-Fitch molecular-clock model. We show that this model is robust to uncorrelated violations of the molecular clock. Our algorithms apply to serial data, where the tips of the tree have been sampled through times. They estimate the substitution rate and the dates of all ancestral nodes. When the input tree is unrooted, they can provide an estimate for the root position, thus representing a new, practical alternative to the standard rooting methods (e.g., midpoint). Our algorithms exploit the tree (recursive) structure of the problem at hand, and the close relationships between least-squares and linear algebra. We distinguish between an unconstrained setting and the case where the temporal precedence constraint (i.e., an ancestral node must be older that its daughter nodes) is accounted for. With rooted trees, the former is solved using linear algebra in linear computing time (i.e., proportional to the number of taxa), while the resolution of the latter, constrained setting, is based on an active-set method that runs in nearly linear time. With unrooted trees the computing time becomes (nearly) quadratic (i.e., proportional to the square of the number of taxa). In all cases, very large input trees (>10,000 taxa) can easily be processed and transformed into time-scaled trees. We compare these algorithms to standard methods (root-to-tip, r8s version of Langley-Fitch method, and BEAST). Using simulated data, we show that their estimation accuracy is similar to that
Fast imaging system and algorithm for monitoring microlymphatics
NASA Astrophysics Data System (ADS)
Akl, T.; Rahbar, E.; Zawieja, D.; Gashev, A.; Moore, J.; Coté, G.
2010-02-01
The lymphatic system is not well understood and tools to quantify aspects of its behavior are needed. A technique to monitor lymph velocity that can lead to flow, the main determinant of transport, in a near real time manner can be extremely valuable. We recently built a new system that measures lymph velocity, vessel diameter and contractions using optical microscopy digital imaging with a high speed camera (500fps) and a complex processing algorithm. The processing time for a typical data period was significantly reduced to less than 3 minutes in comparison to our previous system in which readings were available 30 minutes after the vessels were imaged. The processing was based on a correlation algorithm in the frequency domain, which, along with new triggering methods, reduced the processing and acquisition time significantly. In addition, the use of a new data filtering technique allowed us to acquire results from recordings that were irresolvable by the previous algorithm due to their high noise level. The algorithm was tested by measuring velocities and diameter changes in rat mesenteric micro-lymphatics. We recorded velocities of 0.25mm/s on average in vessels of diameter ranging from 54um to 140um with phasic contraction strengths of about 6 to 40%. In the future, this system will be used to monitor acute effects that are too fast for previous systems and will also increase the statistical power when dealing with chronic changes. Furthermore, we plan on expanding its functionality to measure the propagation of the contractile activity.
Improvement in fast particle track reconstruction with robust statistics
NASA Astrophysics Data System (ADS)
Aartsen, M. G.; Abbasi, R.; Abdou, Y.; Ackermann, M.; Adams, J.; Aguilar, J. A.; Ahlers, M.; Altmann, D.; Auffenberg, J.; Bai, X.; Baker, M.; Barwick, S. W.; Baum, V.; Bay, R.; Beatty, J. J.; Bechet, S.; Becker Tjus, J.; Becker, K.-H.; Benabderrahmane, M. L.; BenZvi, S.; Berghaus, P.; Berley, D.; Bernardini, E.; Bernhard, A.; Besson, D. Z.; Binder, G.; Bindig, D.; Bissok, M.; Blaufuss, E.; Blumenthal, J.; Boersma, D. J.; Bohaichuk, S.; Bohm, C.; Bose, D.; Böser, S.; Botner, O.; Brayeur, L.; Bretz, H.-P.; Brown, A. M.; Bruijn, R.; Brunner, J.; Carson, M.; Casey, J.; Casier, M.; Chirkin, D.; Christov, A.; Christy, B.; Clark, K.; Clevermann, F.; Coenders, S.; Cohen, S.; Cowen, D. F.; Cruz Silva, A. H.; Danninger, M.; Daughhetee, J.; Davis, J. C.; Day, M.; De Clercq, C.; De Ridder, S.; Desiati, P.; de Vries, K. D.; de With, M.; DeYoung, T.; Díaz-Vélez, J. C.; Dunkman, M.; Eagan, R.; Eberhardt, B.; Eisch, J.; Euler, S.; Evenson, P. A.; Fadiran, O.; Fazely, A. R.; Fedynitch, A.; Feintzeig, J.; Feusels, T.; Filimonov, K.; Finley, C.; Fischer-Wasels, T.; Flis, S.; Franckowiak, A.; Frantzen, K.; Fuchs, T.; Gaisser, T. K.; Gallagher, J.; Gerhardt, L.; Gladstone, L.; Glüsenkamp, T.; Goldschmidt, A.; Golup, G.; Gonzalez, J. G.; Goodman, J. A.; Góra, D.; Grandmont, D. T.; Grant, D.; Groß, A.; Ha, C.; Haj Ismail, A.; Hallen, P.; Hallgren, A.; Halzen, F.; Hanson, K.; Heereman, D.; Heinen, D.; Helbing, K.; Hellauer, R.; Hickford, S.; Hill, G. C.; Hoffman, K. D.; Hoffmann, R.; Homeier, A.; Hoshina, K.; Huelsnitz, W.; Hulth, P. O.; Hultqvist, K.; Hussain, S.; Ishihara, A.; Jacobi, E.; Jacobsen, J.; Jagielski, K.; Japaridze, G. S.; Jero, K.; Jlelati, O.; Kaminsky, B.; Kappes, A.; Karg, T.; Karle, A.; Kelley, J. L.; Kiryluk, J.; Kläs, J.; Klein, S. R.; Köhne, J.-H.; Kohnen, G.; Kolanoski, H.; Köpke, L.; Kopper, C.; Kopper, S.; Koskinen, D. J.; Kowalski, M.; Krasberg, M.; Krings, K.; Kroll, G.; Kunnen, J.; Kurahashi, N.; Kuwabara, T.; Labare, M.; Landsman, H.; Larson, M. J.; Lesiak-Bzdak, M.; Leuermann, M.; Leute, J.; Lünemann, J.; Macías, O.; Madsen, J.; Maggi, G.; Maruyama, R.; Mase, K.; Matis, H. S.; McNally, F.; Meagher, K.; Merck, M.; Meures, T.; Miarecki, S.; Middell, E.; Milke, N.; Miller, J.; Mohrmann, L.; Montaruli, T.; Morse, R.; Nahnhauer, R.; Naumann, U.; Niederhausen, H.; Nowicki, S. C.; Nygren, D. R.; Obertacke, A.; Odrowski, S.; Olivas, A.; Omairat, A.; O'Murchadha, A.; Paul, L.; Pepper, J. A.; Pérez de los Heros, C.; Pfendner, C.; Pieloth, D.; Pinat, E.; Posselt, J.; Price, P. B.; Przybylski, G. T.; Rädel, L.; Rameez, M.; Rawlins, K.; Redl, P.; Reimann, R.; Resconi, E.; Rhode, W.; Ribordy, M.; Richman, M.; Riedel, B.; Rodrigues, J. P.; Rott, C.; Ruhe, T.; Ruzybayev, B.; Ryckbosch, D.; Saba, S. M.; Salameh, T.; Sander, H.-G.; Santander, M.; Sarkar, S.; Schatto, K.; Scheriau, F.; Schmidt, T.; Schmitz, M.; Schoenen, S.; Schöneberg, S.; Schönwald, A.; Schukraft, A.; Schulte, L.; Schulz, O.; Seckel, D.; Sestayo, Y.; Seunarine, S.; Shanidze, R.; Sheremata, C.; Smith, M. W. E.; Soldin, D.; Spiczak, G. M.; Spiering, C.; Stamatikos, M.; Stanev, T.; Stasik, A.; Stezelberger, T.; Stokstad, R. G.; Stößl, A.; Strahler, E. A.; Ström, R.; Sullivan, G. W.; Taavola, H.; Taboada, I.; Tamburro, A.; Tepe, A.; Ter-Antonyan, S.; Tešić, G.; Tilav, S.; Toale, P. A.; Toscano, S.; Unger, E.; Usner, M.; Vallecorsa, S.; van Eijndhoven, N.; Van Overloop, A.; van Santen, J.; Vehring, M.; Voge, M.; Vraeghe, M.; Walck, C.; Waldenmaier, T.; Wallraff, M.; Weaver, Ch.; Wellons, M.; Wendt, C.; Westerhoff, S.; Whitehorn, N.; Wiebe, K.; Wiebusch, C. H.; Williams, D. R.; Wissing, H.; Wolf, M.; Wood, T. R.; Woschnagg, K.; Xu, D. L.; Xu, X. W.; Yanez, J. P.; Yodh, G.; Yoshida, S.; Zarzhitsky, P.; Ziemann, J.; Zierke, S.; Zoll, M.; Recht, B.; Ré, C.
2014-02-01
The IceCube project has transformed 1 km3 of deep natural Antarctic ice into a Cherenkov detector. Muon neutrinos are detected and their direction is inferred by mapping the light produced by the secondary muon track inside the volume instrumented with photomultipliers. Reconstructing the muon track from the observed light is challenging due to noise, light scattering in the ice medium, and the possibility of simultaneously having multiple muons inside the detector, resulting from the large flux of cosmic ray muons. This paper describes work on two problems: (1) the track reconstruction problem, in which, given a set of observations, the goal is to recover the track of a muon; and (2) the coincident event problem, which is to determine how many muons are active in the detector during a time window. Rather than solving these problems by developing more complex physical models that are applied at later stages of the analysis, our approach is to augment the detector's early reconstruction with data filters and robust statistical techniques. These can be implemented at the level of on-line reconstruction and, therefore, improve all subsequent reconstructions. Using the metric of median angular resolution, a standard metric for track reconstruction, we improve the accuracy in the initial reconstruction direction by 13%. We also present improvements in measuring the number of muons in coincident events: we can accurately determine the number of muons 98% of the time.
A fast algorithm for the phonemic segmentation of continuous speech
NASA Astrophysics Data System (ADS)
Smidt, D.
1986-04-01
The method of differential learning (DL method) was applied to the fast phonemic classification of acoustic speech spectra. The method was also tested with a simple algorithm for continuous speech recognition. In every learning step of the DL method only that single pattern component which deviates most from the reference value is used for a new rule. Several rules of this type were connected in a conjunctive or disjunctive way. Tests with a single speaker demonstrate good classification capability and a very high speed. The inclusion of automatically additional features selected according to their relevance is discussed. It is shown that there exists a correspondence between processes related to the DL method and pattern recognition in living beings with their ability for generalization and differentiation.
Fast Probabilistic Particle Identification algorithm using silicon strip detectors
NASA Astrophysics Data System (ADS)
Di Fino, L.; Zaconte, V.; Ciccotelli, A.; Larosa, M.; Narici, L.
2012-08-01
Active detectors used as radiation monitors in space are not usually able to perform Particle Identification (PID). Common techniques need energy loss spectra with high statistics to estimate ion abundances. The ALTEA-space detector system is a set of silicon strip particle telescopes monitoring the radiation environment on board the International Space Station since July 2006 with real-time telemetry capabilities. Its large geometrical factor due to the concurrent use of six detectors permits the acquisition of good energy loss spectra even in a short period of observation. In this paper we present a novel Fast Probabilistic Particle Identification (FPPI) algorithm developed for the ALTEA data analysis in order to perform nuclear identification with low statistics and, with some limitations, also in real time.
The Fleet Application for Scheduling and Tracking (FAST) Management Website
NASA Technical Reports Server (NTRS)
Marrero-Perez, Radames J.
2014-01-01
The FAST application was designed to replace the paper and pen method of checking out and checking in GSA Vehicles at KSC. By innovating from a paper and pen based checkout system to a fully digital one, not only the resources wasted by printing the checkout forms have been reduced, but it also reduces significantly the time that users and fleet managers need to interact with the system as well as improving the record accuracy for each vehicle. The vehicle information is pulled from a centralized database server in the SPSDL. In an attempt to add a new feature to the FAST application, the author of this report (alongside the FAST developers) has been designing and developing the FAST Management Website. The GSA fleet managers had to rely on the FAST developers in order to add new vehicles, edit vehicles and previous transactions, or for generating vehicles reports. By providing an easy-to-use FAST Management Website portal, the GSA fleet managers are now able to easily move vehicles, edit records, and print reports.
Fast volume rendering algorithm in a virtual endoscopy system
NASA Astrophysics Data System (ADS)
Kim, Sang H.; Kim, Jin K.; Ra, Jong Beom
2002-05-01
Recently, 3D virtual endoscopy has been used as an alternative noninvasive procedure for visualization of a hollow organ. In this paper, we propose a fast volume rendering scheme based on perspective ray casting for virtual endoscopy. As a pre-processing step, the algorithm divides a volume into hierarchical blocks and classifies them into opaque or transparent blocks. Then, the rendering procedure is as follows. In the first step, we perform ray casting only for sub-sampled pixels on the image plane, and determine their pixel values and depth information. In the second step, by reducing the sub-sampling factor by half, we repeat ray casting for newly added pixels, and their pixel values and depth information are determined. Here, the previously obtained depth information is utilized to reduce the processing time. This step is performed recursively until the full-size rendering image is acquired. Experiments conducted on a PC shows that the proposed algorithm can reduce the rendering time by 70-80% for the bronchus and colon endoscopy, compared with the brute-force ray casting scheme. Thereby, interactive rendering becomes more realizable in a PC environment without any specific hardware.
Fast half-sibling population reconstruction: theory and algorithms
2013-01-01
Background Kinship inference is the task of identifying genealogically related individuals. Kinship information is important for determining mating structures, notably in endangered populations. Although many solutions exist for reconstructing full sibling relationships, few exist for half-siblings. Results We consider the problem of determining whether a proposed half-sibling population reconstruction is valid under Mendelian inheritance assumptions. We show that this problem is NP-complete and provide a 0/1 integer program that identifies the minimum number of individuals that must be removed from a population in order for the reconstruction to become valid. We also present SibJoin, a heuristic-based clustering approach based on Mendelian genetics, which is strikingly fast. The software is available at http://github.com/ddexter/SibJoin.git+. Conclusions Our SibJoin algorithm is reasonably accurate and thousands of times faster than existing algorithms. The heuristic is used to infer a half-sibling structure for a population which was, until recently, too large to evaluate. PMID:23849037
A guidance and control algorithm for scent tracking micro-robotic vehicle swarms
Dohner, J.L.
1998-03-01
Cooperative micro-robotic scent tracking vehicles are designed to collectively sniff out locations of high scent concentrations in unknown, geometrically complex environments. These vehicles are programmed with guidance and control algorithms that allow inter cooperation among vehicles. In this paper a cooperative guidance and control algorithm for scent tracking micro-robotic vehicles is presented. This algorithm is comprised of a sensory compensation sub-algorithm using point source cancellation, a guidance sub-algorithm using gradient descent tracking, and a control sub-algorithm using proportional feedback. The concepts of social rank and point source cancellation are new concepts introduced within. Simulation results for cooperative vehicles swarms are given. Limitations are discussed.
Morończyk, Daniel Antoni F; Krasnodębski, Ireneusz Wojciech
2011-09-01
A perioperative care in the colorectal surgery has been considerably changed recently. The fast track surgery decreases complications rate, shortens length of stay, improves quality of life and leads to cost reduction. It is achieved by: resignation of a mechanical bowel preparation before and a nasogastric tube insertion after operation, optimal pain and intravenous fluid management, an early rehabilitation, enteral nutrition and removal of a vesical catheter and abdominal drain if used.The aim of the study was to compare the results of an implementation the fast track surgery protocol with results achieving in the conventional care regimen.Material and methods. Two groups of patients undergoing colonic resection have been compared. The study group was formed by patients treated with fast track concept, the control group - by patients who were dealt with hitherto regimen. Procedures needed stoma performing, rectal and laparoscopic surgery were excluded. The perioperative period was investigated by telephone call to patient or his family.Results. Statistical significant reduction was reached in a favour of the fast track group in the following parameters: the length of hospital stay (2.5 days shorter), duration of an abdominal cavity and vesicle drainage (3 and 2 days shorter respectively), postoperative day on which oral diet was implemented (2,5 days faster) and finally extended (1.5 days faster). There were no statistical difference in mortality, morbidity neither reoperation rate between two groups.Conclusion. The fast track surgery is a safe strategy and may improve a perioperative care. PMID:22166736
Modal analysis of rotating plate using tracking laser Doppler vibrometer: algorithm modification
NASA Astrophysics Data System (ADS)
Khalil, Hossam; Kim, Dongkyu; Nam, Joonsik; Park, Kyihwan
2015-07-01
A modified algorithm for tracking laser Doppler vibrometer (TLDV) is introduced to measure the vibration of rotating objects. The proposed algorithm unlike the old algorithm for TLDV can be used when the speed of the object to be tracked varies continuously or alternating in a small range. The proposed algorithm is to use encoder only as a position sensor. The position from the encoder is used to calculate the driving signals to the galvanometers. To verify the proposed method, experimental modal analysis of the circular plate in stationary and rotating cases are made.
A group tracking algorithm for ground vehicle convoys
NASA Astrophysics Data System (ADS)
Chin, Wei C.; Lee, Hian B.; Xiao, Xu H.; Ng, Gee W.; How, Khee Y.
2005-03-01
Tracking multiple ground targets under clutter and in real time poses several likely challenges: vehicles often get masked by foliage or line-of-sight (LOS) problems, manifesting in misdetections and false alarms. Further complications also arise when groups of vehicles merge or split. This paper presents an attempt to address these issues using a group tracking approach. Group tracking is a way to ameliorate, or at least soften the impact of such issues from the hope that at least partial information will be received from each target group even when the probability of detection, PD of each individual member is low. A Strongest Neighbour Association (SNA) method of measurement-to-track association based on space-time reasoning and track-measurement similarity measures has been derived. We combine the association strengths of the space-time dynamics, the degree-of-overlap and the historical affinity metrics to relate measurements and tracks. The state estimation is based on standard Kalman filter. Lastly, a Pairwise Historical Affinity Ratios (PHAR) is proposed for the detection of a split scenario. This method has been tested to work well on a simulated convoy-splitting scenario. Monte Carlo experiment runs of six different error rates with five different compositions of errors have been conducted to assess the performance of the tracker. Results indicated that the group tracker remains robust (>80% precision) even in the presence of high individual source track error rates of up to 30%.
Design of a hardware track finder (Fast Tracker) for the ATLAS trigger
NASA Astrophysics Data System (ADS)
Cavaliere, V.; Adelman, J.; Albicocco, P.; Alison, J.; Ancu, L. S.; Anderson, J.; Andari, N.; Andreani, A.; Andreazza, A.; Annovi, A.; Antonelli, M.; Asbah, N.; Atkinson, M.; Baines, J.; Barberio, E.; Beccherle, R.; Beretta, M.; Bertolucci, F.; Biesuz, N. V.; Blair, R.; Bogdan, M.; Boveia, A.; Britzger, D.; Bryant, P.; Burghgrave, B.; Calderini, G.; Camplani, A.; Cavasinni, V.; Chakraborty, D.; Chang, P.; Cheng, Y.; Citraro, S.; Citterio, M.; Crescioli, F.; Dawe, N.; Dell'Orso, M.; Donati, S.; Dondero, P.; Drake, G.; Gadomski, S.; Gatta, M.; Gentsos, C.; Giannetti, P.; Gkaitatzis, S.; Gramling, J.; Howarth, J. W.; Iizawa, T.; Ilic, N.; Jiang, Z.; Kaji, T.; Kasten, M.; Kawaguchi, Y.; Kim, Y. K.; Kimura, N.; Klimkovich, T.; Kolb, M.; Kordas, K.; Krizka, K.; Kubota, T.; Lanza, A.; Li, H. L.; Liberali, V.; Lisovyi, M.; Liu, L.; Love, J.; Luciano, P.; Luongo, C.; Magalotti, D.; Maznas, I.; Meroni, C.; Mitani, T.; Nasimi, H.; Negri, A.; Neroutsos, P.; Neubauer, M.; Nikolaidis, S.; Okumura, Y.; Pandini, C.; Petridou, C.; Piendibene, M.; Proudfoot, J.; Rados, P.; Roda, C.; Rossi, E.; Sakurai, Y.; Sampsonidis, D.; Saxon, J.; Schmitt, S.; Schoening, A.; Shochet, M.; Shojaii, S.; Soltveit, H.; Sotiropoulou, C. L.; Stabile, A.; Swiatlowski, M.; Tang, F.; Taylor, P. T.; Testa, M.; Tompkins, L.; Vercesi, V.; Volpi, G.; Wang, R.; Watari, R.; Webster, J.; Wu, X.; Yorita, K.; Yurkewicz, A.; Zeng, J. C.; Zhang, J.; Zou, R.
2016-02-01
The use of tracking information at the trigger level in the LHC Run II period is crucial for the trigger and data acquisition system and will be even more so as contemporary collisions that occur at every bunch crossing will increase in Run III. The Fast TracKer is part of the ATLAS trigger upgrade project; it is a hardware processor that will provide every Level-1 accepted event (100 kHz) and within 100μs, full tracking information for tracks with momentum as low as 1 GeV . Providing fast, extensive access to tracking information, with resolution comparable to the offline reconstruction, FTK will help in precise detection of the primary and secondary vertices to ensure robust selections and improve the trigger performance.
Note: Fast neutron efficiency in CR-39 nuclear track detectors
Cavallaro, S.
2015-03-15
CR-39 samples are commonly employed for fast neutron detection in fusion reactors and in inertial confinement fusion experiments. The literature reported efficiencies are strongly depending on experimental conditions and, in some cases, highly dispersed. The present note analyses the dependence of efficiency as a function of various parameters and experimental conditions in both the radiator-assisted and the stand-alone CR-39 configurations. Comparisons of literature experimental data with Monte Carlo calculations and optimized efficiency values are shown and discussed.
Biased Randomized Algorithm for Fast Model-Based Diagnosis
NASA Technical Reports Server (NTRS)
Williams, Colin; Vartan, Farrokh
2005-01-01
A biased randomized algorithm has been developed to enable the rapid computational solution of a propositional- satisfiability (SAT) problem equivalent to a diagnosis problem. The closest competing methods of automated diagnosis are described in the preceding article "Fast Algorithms for Model-Based Diagnosis" and "Two Methods of Efficient Solution of the Hitting-Set Problem" (NPO-30584), which appears elsewhere in this issue. It is necessary to recapitulate some of the information from the cited articles as a prerequisite to a description of the present method. As used here, "diagnosis" signifies, more precisely, a type of model-based diagnosis in which one explores any logical inconsistencies between the observed and expected behaviors of an engineering system. The function of each component and the interconnections among all the components of the engineering system are represented as a logical system. Hence, the expected behavior of the engineering system is represented as a set of logical consequences. Faulty components lead to inconsistency between the observed and expected behaviors of the system, represented by logical inconsistencies. Diagnosis - the task of finding the faulty components - reduces to finding the components, the abnormalities of which could explain all the logical inconsistencies. One seeks a minimal set of faulty components (denoted a minimal diagnosis), because the trivial solution, in which all components are deemed to be faulty, always explains all inconsistencies. In the methods of the cited articles, the minimal-diagnosis problem is treated as equivalent to a minimal-hitting-set problem, which is translated from a combinatorial to a computational problem by mapping it onto the Boolean-satisfiability and integer-programming problems. The integer-programming approach taken in one of the prior methods is complete (in the sense that it is guaranteed to find a solution if one exists) and slow and yields a lower bound on the size of the
Fast and long term lipid droplet tracking with CARS microscopy.
Jüngst, Christian; Winterhalder, Martin J; Zumbusch, Andreas
2011-06-01
Photobleaching of organic fluorophores commonly used in fluorescence microscopy puts a limit to the number of images which can be acquired. Label-free imaging techniques therefore offer advantages both for rapid image acquisition and for long-term observations. CARS microscopy is a label-free imaging technique offering molecule specific contrast. Here we demonstrate that CARS microscopy allows video-rate tracking of intracellular transport of lipid droplets, but also continuous long-term observation of cells over several hours. PMID:21445955
Restoring integrity—A grounded theory of coping with a fast track surgery programme
Jørgensen, Lene Bastrup; Fridlund, Bengt
2016-01-01
Aims and objectives The aim of this study was to generate a theory conceptualizing and explaining behavioural processes involved in coping in order to identify the predominant coping types and coping type-specific features. Background Patients undergoing fast track procedures do not experience a higher risk of complications, readmission, or mortality. However, such programmes presuppose an increasing degree of patient involvement, placing high educational, physical, and mental demands on the patients. There is a lack of knowledge about how patients understand and cope with fast track programmes. Design The study design used classical grounded theory. Methods The study used a multimodal approach with qualitative and quantitative data sets from 14 patients. Results Four predominant types of coping, with distinct physiological, cognitive, affective, and psychosocial features, existed among patients going through a fast track total hip replacement programme. These patients’ main concern was to restore their physical and psychosocial integrity, which had been compromised by reduced function and mobility in daily life. To restore integrity they economized their mental resources, while striving to fulfil the expectations of the fast track programme. This goal was achieved by being mentally proactive and physically active. Three out of the four predominant types of coping matched the expectations expressed in the fast track programme. The non-matching behaviour was seen among the most nervous patients, who claimed the right to diverge from the programme. Conclusion In theory, four predominant types of coping with distinct physiological, cognitive, affective, and psychosocial features occur among patients going through a fast track total hip arthroplasty programme. PMID:26751199
Surface track potential created by fast protons at LiF surfaces
NASA Astrophysics Data System (ADS)
Arnau, A.; Gravielle, M. S.; Miraglia, J. E.; Ponce, V. H.
2003-06-01
A model based on atomic ionization of F- sites at the surface is used to calculate the surface track potential created by fast protons at LiF surfaces. For 100-keV protons at grazing incidence, we find that the track potential close to the surface plays a significant role in determining the shift to lower energies of the convoy electron peak with respect to the unperturbed cusp value.
Visual Tracking Based on an Improved Online Multiple Instance Learning Algorithm.
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. PMID:26843855
Visual Tracking Based on an Improved Online Multiple Instance Learning Algorithm
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. PMID:26843855
An Improved Wake Vortex Tracking Algorithm for Multiple Aircraft
NASA Technical Reports Server (NTRS)
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.
Multiphase Interface Tracking with Fast Semi-Lagrangian Contouring.
Li, Xiaosheng; He, Xiaowei; Liu, Xuehui; Zhang, Jian J; Liu, Baoquan; Wu, Enhua
2016-08-01
We propose a semi-Lagrangian method for multiphase interface tracking. In contrast to previous methods, our method maintains an explicit polygonal mesh, which is reconstructed from an unsigned distance function and an indicator function, to track the interface of arbitrary number of phases. The surface mesh is reconstructed at each step using an efficient multiphase polygonization procedure with precomputed stencils while the distance and indicator function are updated with an accurate semi-Lagrangian path tracing from the meshes of the last step. Furthermore, we provide an adaptive data structure, multiphase distance tree, to accelerate the updating of both the distance function and the indicator function. In addition, the adaptive structure also enables us to contour the distance tree accurately with simple bisection techniques. The major advantage of our method is that it can easily handle topological changes without ambiguities and preserve both the sharp features and the volume well. We will evaluate its efficiency, accuracy and robustness in the results part with several examples. PMID:26353373
An effective automatic tracking algorithm based on Camshift and Kalman filter
NASA Astrophysics Data System (ADS)
Liang, Juan; Hou, Jianhua; Xiang, Jun; Da, Bangyou; Chen, Shaobo
2011-11-01
An automatic tracking algorithm based on Camshift and Kalman filter is proposed in this paper to deal with the problems in traditional Camshift algorithm, such as artificial orientation and increasing possibility of tracking failure under occlusion. The inter-frame difference and canny edge detection are combined to segment perfect moving object region accurately, and the center point of the region is obtained as the initial position of the object. With regard to tracking under occlusion, Kalman filter is used to predict the position and velocity of the target. Specifically, the initial iterative position of Camshift algorithm is obtained by Kalman filter in every frame, and then Camshift algorithm is utilized to track the target position. Finally, the parameters of adaptive Kalman filter are updated by the optimal position. However, when severe occlusion appears, the optimal position calculated by Camshift algorithm is inaccurate, and the Kalman filter fails to estimate the coming state effectively. In this situation, the Kalman filter is updated by the Kalman predictive value instead of the value calculated by the Camshift algorithm. The experiment results demonstrate that the proposed algorithm can detect and track the target object accurately and has better robustness to occlusion.
An algorithm for fast DNS cavitating flows simulations using homogeneous mixture approach
NASA Astrophysics Data System (ADS)
Žnidarčič, A.; Coutier-Delgosha, O.; Marquillie, M.; Dular, M.
2015-12-01
A new algorithm for fast DNS cavitating flows simulations is developed. The algorithm is based on Kim and Moin projection method form. Homogeneous mixture approach with transport equation for vapour volume fraction is used to model cavitation and various cavitation models can be used. Influence matrix and matrix diagonalisation technique enable fast parallel computations.
Note: fast neutron efficiency in CR-39 nuclear track detectors.
Cavallaro, S
2015-03-01
CR-39 samples are commonly employed for fast neutron detection in fusion reactors and in inertial confinement fusion experiments. The literature reported efficiencies are strongly depending on experimental conditions and, in some cases, highly dispersed. The present note analyses the dependence of efficiency as a function of various parameters and experimental conditions in both the radiator-assisted and the stand-alone CR-39 configurations. Comparisons of literature experimental data with Monte Carlo calculations and optimized efficiency values are shown and discussed. PMID:25832287
A simple backscattering microscope for fast tracking of biological molecules.
Sowa, Yoshiyuki; Steel, Bradley C; Berry, Richard M
2010-11-01
Recent developments in techniques for observing single molecules under light microscopes have helped reveal the mechanisms by which molecular machines work. A wide range of markers can be used to detect molecules, from single fluorophores to micron sized markers, depending on the research interest. Here, we present a new and simple objective-type backscattering microscope to track gold nanoparticles with nanometer and microsecond resolution. The total noise of our system in a 55 kHz bandwidth is ~0.6 nm per axis, sufficient to measure molecular movement. We found our backscattering microscopy to be useful not only for in vitro but also for in vivo experiments because of lower background scattering from cells than in conventional dark-field microscopy. We demonstrate the application of this technique to measuring the motion of a biological rotary molecular motor, the bacterial flagellar motor, in live Escherichia coli cells. PMID:21133475
L1Track: A fast Level 1 track trigger for the ATLAS high luminosity upgrade
NASA Astrophysics Data System (ADS)
Cerri, Alessandro
2016-07-01
With the planned high-luminosity upgrade of the LHC (HL-LHC), the ATLAS detector will see its collision rate increase by approximately a factor of 5 with respect to the current LHC operation. The earliest hardware-based ATLAS trigger stage ("Level 1") will have to provide a higher rejection factor in a more difficult environment: a new improved Level 1 trigger architecture is under study, which includes the possibility of extracting with low latency and high accuracy tracking information in time for the decision taking process. In this context, the feasibility of potential approaches aimed at providing low-latency high-quality tracking at Level 1 is discussed.
NASA Technical Reports Server (NTRS)
Schultz, Christopher J.; Carey, Larry; Cecil, Dan; Bateman, Monte; Stano, Geoffrey; Goodman, Steve
2012-01-01
Objective of project is to refine, adapt and demonstrate the Lightning Jump Algorithm (LJA) for transition to GOES -R GLM (Geostationary Lightning Mapper) readiness and to establish a path to operations Ongoing work . reducing risk in GLM lightning proxy, cell tracking, LJA algorithm automation, and data fusion (e.g., radar + lightning).
A novel track reconstruction algorithm for photoelectric X-ray polarimetry
NASA Astrophysics Data System (ADS)
Li, Tenglin; Li, Hong; Feng, Hua; Zeng, Ming
2016-07-01
The key to the photoelectric X-ray polarimetry is the determination of the emission direction of photoelectrons. Due to the low mass of an electron, the ionization track is not straight and the useful information is stored only in its initial part where less energy is deposited. We present a new algorithm in order to reconstruct the electron track from a 2D track image that is blurred due to diffusion during drift in the gas chamber. The algorithm is based on the shortest path problem in graph theory, and a spatial energy filter is implemented as an improvement. Tested with simulated data, which approximate the real measurement with the gas pixel detector, we find that the new algorithm is able to trace the initial part of the track more closely and produce a higher degree of modulation than past algorithms, especially for long tracks created by high energy X-rays, in which cases the past algorithms may fail due to complicated track patterns.
Fast Flux Test Facility Asbestos Location Tracking Program
REYNOLDS, J.A.
1999-04-13
Procedure Number HNF-PRO-408, revision 0, paragraph 1.0, ''Purpose,'' and paragraph 2.0, ''Requirements for Facility Management of Asbestos,'' relate building inspection and requirements for documentation of existing asbestos-containing building material (ACBM) per each building assessment. This documentation shall be available to all personnel (including contractor personnel) entering the facility at their request. Corrective action was required by 400 Area Integrated Annual Appraisal/Audit for Fiscal Year 1992 (IAA-92-0007) to provide this notification documentation. No formal method had been developed to communicate the location and nature of ACBM to maintenance personnel in the Fast Flux Test Facility (FFTF) 400 Area. The scope of this Data Package Document is to locate and evaluate any ACBM found at FFTF which constitutes a baseline. This includes all buildings within the protected area. These findings are compiled from earlier reports, numerous work packages and engineering evaluations of employee findings.
Li, G; Sanchez, V; Nagaraj, P C S B; Khan, S; Rajpoot, N
2015-12-01
We propose a novel multitarget tracking framework for Myosin VI protein molecules in total internal reflection fluorescence microscopy sequences which integrates an extended Hungarian algorithm with an interacting multiple model filter. The extended Hungarian algorithm, which is a linear assignment problem based method, helps to solve measurement assignment and spot association problems commonly encountered when dealing with multiple targets, although a two-motion model interacting multiple model filter increases the tracking accuracy by modelling the nonlinear dynamics of Myosin VI protein molecules on actin filaments. The evaluation of our tracking framework is conducted on both real and synthetic total internal reflection fluorescence microscopy sequences. The results show that the framework achieves higher tracking accuracies compared to the state-of-the-art tracking methods, especially for sequences with high spot density. PMID:26259144
Out-of-sequence measurement updates for multi-hypothesis tracking algorithms
NASA Astrophysics Data System (ADS)
Chan, Stephanie; Paffenroth, Randy
2008-04-01
In multi-sensor tracking systems, observations are often exchanged over a network for processing. Network delays create situations in which measurements arrive out-of-sequence. The out-of-sequence measurement (OOSM) update problem is of particular significance in networked multiple hypothesis tracking (MHT) algorithms. The advantage of MHT is the ability to revoke past measurement assignment decisions as future information becomes available. Accordingly, we not only have to deal with network delays for initial assignment, but must also address delayed assignment revocations. We study the performance of extant algorithms and two algorithm modifications for the purpose of OOSM filtering in MHT architectures.
NASA Astrophysics Data System (ADS)
Georgiopoulos, C. H.; Goldman, J. H.; Hodous, M. F.
1987-11-01
We report on a fully vectorized track finding and fitting algorithm that has been used to reconstruct charged particle trajectories in a multiwire chamber system. This algorithm is currently used for data analysis of the E-711 experiment a Fermilab. The program is written for a CYBER 205 on which the average event takes 13.5 ms to process compared to 6.7 s for an optimized scalar algorithm on a VAX-11/780.
"Joined up" Thinking? Unsupported "Fast-Track" Transitions in the Context of Parental Substance Use
ERIC Educational Resources Information Center
Wilson, Sarah; Cunningham-Burley, Sarah; Bancroft, Angus; Backett-Milburn, Kathryn
2008-01-01
Recent policy responses to the risks entailed in "fast-track" school-work transitions have targeted careleavers and young people identified as "not in education, employment or training" (NEET). However, this approach has been criticised as diverting attention away from the fragile circumstances of others who may receive little parental or service…
New Medical-School Programs Put Students on a Fast Track to the White Coat
ERIC Educational Resources Information Center
Mangan, Katherine
2009-01-01
California's lieutenant governor has proposed a fast-track medical school that would shave three years off the training needed to become a physician. It is not the first time such an idea has been offered. The proposal, for a hoped-for medical school at the University of California at Merced, struck some medical educators as both unrealistic and…
ERIC Educational Resources Information Center
Child Development, 2011
2011-01-01
The impact of the Fast Track intervention on externalizing disorders across childhood was examined. Eight hundred-ninety-one early-starting children (69% male; 51% African American) were randomly assigned by matched sets of schools to intervention or control conditions. The 10-year intervention addressed parent behavior-management, child social…
The Status of Girls' Education in Education for All Fast Track Initiative Partner Countries
ERIC Educational Resources Information Center
Clarke, Prema
2011-01-01
This viewpoint examines girls' performance in primary education in the countries that joined the Education for All Fast Track Initiative between 2002 and 2008. At the time they joined the initiative, a first group of countries (high performers) had already achieved high and equal enrollment of girls and boys. Significant progress is evident in a…
Preventing Serious Conduct Problems in School-Age Youth: The Fast Track Program
ERIC Educational Resources Information Center
Slough, Nancy M.; McMahon, Robert J.; Bierman, Karen L.; Coie, John D.; Dodge, Kenneth A.; Foster, E. Michael; Greenberg, Mark T.; Lochman, John E.; McMahon, Robert J.; Pinderhughes, Ellen E.
2008-01-01
Children with early-starting conduct problems have a very poor prognosis and exact a high cost to society. The Fast Track project is a multisite, collaborative research project investigating the efficacy of a comprehensive, long-term, multicomponent intervention designed to "prevent" the development of serious conduct problems in high-risk…
Fast Track Initiative: Building a Global Compact for Education. Education Notes
ERIC Educational Resources Information Center
Human Development Network Education, 2005
2005-01-01
This note series is intended to summarize lessons learned and key policy findings on the World Bank's work in education. "Fast Track Initiative" ("FTI") was launched in 2002 as a partnership between donor and developing countries to accelerate progress towards the Millennium Development Goal (MDG) of universal primary education. "FTI" is built on…
Online Tracking Algorithms on GPUs for the P̅ANDA Experiment at FAIR
NASA Astrophysics Data System (ADS)
Bianchi, L.; Herten, A.; Ritman, J.; Stockmanns, T.; Adinetz,
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.
An Efficient Lagrangean Relaxation-based Object Tracking Algorithm in Wireless Sensor Networks
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. PMID:22163643
A fast and memory-sparing probabilistic selection algorithm for the GPU
Monroe, Laura M; Wendelberger, Joanne; Michalak, Sarah
2010-09-29
A fast and memory-sparing probabilistic top-N selection algorithm is implemented on the GPU. This probabilistic algorithm gives a deterministic result and always terminates. The use of randomization reduces the amount of data that needs heavy processing, and so reduces both the memory requirements and the average time required for the algorithm. This algorithm is well-suited to more general parallel processors with multiple layers of memory hierarchy. Probabilistic Las Vegas algorithms of this kind are a form of stochastic optimization and can be especially useful for processors having a limited amount of fast memory available.
ERIC Educational Resources Information Center
Johnson, Susan Moore; Birkeland, Sarah E.; Peske, Heather G.
2005-01-01
The prospect of overseeing the rapid preparation of many participants in fast-track alternative certification programs presents several challenges for state education officials who seek to maintain, or even enhance, the quality of the state's teaching force. This study examined a range of fast-track alternative teacher certification programs in 11…
Fast three-step phase-shifting algorithm
Huang, Peisen S.; Zhang Song
2006-07-20
We propose a new three-step phase-shifting algorithm, which is much faster than the traditional three-step algorithm. We achieve the speed advantage by using a simple intensity ratio function to replace the arc tangent function in the traditional algorithm. The phase error caused by this new algorithm is compensated for by use of a lookup table. Our experimental result sshow that both the new algorithm and the traditional algorithm generate similar results, but the new algorithm is 3.4 times faster. By implementing this new algorithm in a high-resolution, real-time three-dimensional shape measurement system,we were able to achieve a measurement speed of 40 frames per second ata resolution of 532x500 pixels, all with an ordinary personal computer.
Madany Mamlouk, Amir; Schicktanz, Simone; Kruse, Charli
2011-01-01
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 with high
Rapoport, Daniel H; Becker, Tim; Madany Mamlouk, Amir; Schicktanz, Simone; Kruse, Charli
2011-01-01
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 with high
Ballistic target tracking algorithm based on improved particle filtering
NASA Astrophysics Data System (ADS)
Ning, Xiao-lei; Chen, Zhan-qi; Li, Xiao-yang
2015-10-01
Tracking ballistic re-entry target is a typical nonlinear filtering problem. In order to track the ballistic re-entry target in the nonlinear and non-Gaussian complex environment, a novel chaos map particle filter (CMPF) is used to estimate the target state. CMPF has better performance in application to estimate the state and parameter of nonlinear and non-Gassuian system. The Monte Carlo simulation results show that, this method can effectively solve particle degeneracy and particle impoverishment problem by improving the efficiency of particle sampling to obtain the better particles to part in estimation. Meanwhile CMPF can improve the state estimation precision and convergence velocity compared with EKF, UKF and the ordinary particle filter.
Vision-based measurement for rotational speed by improving Lucas-Kanade template tracking algorithm.
Guo, Jie; Zhu, Chang'an; Lu, Siliang; Zhang, Dashan; Zhang, Chunyu
2016-09-01
Rotational angle and speed are important parameters for condition monitoring and fault diagnosis of rotating machineries, and their measurement is useful in precision machining and early warning of faults. In this study, a novel vision-based measurement algorithm is proposed to complete this task. A high-speed camera is first used to capture the video of the rotational object. To extract the rotational angle, the template-based Lucas-Kanade algorithm is introduced to complete motion tracking by aligning the template image in the video sequence. Given the special case of nonplanar surface of the cylinder object, a nonlinear transformation is designed for modeling the rotation tracking. In spite of the unconventional and complex form, the transformation can realize angle extraction concisely with only one parameter. A simulation is then conducted to verify the tracking effect, and a practical tracking strategy is further proposed to track consecutively the video sequence. Based on the proposed algorithm, instantaneous rotational speed (IRS) can be measured accurately and efficiently. Finally, the effectiveness of the proposed algorithm is verified on a brushless direct current motor test rig through the comparison with results obtained by the microphone. Experimental results demonstrate that the proposed algorithm can extract accurately rotational angles and can measure IRS with the advantage of noncontact and effectiveness. PMID:27607300
Fast neutrons detection in CR-39 and DAM-ADC nuclear track detectors
NASA Astrophysics Data System (ADS)
Abdalla, A. M.; Ashraf, O.; Rammah, Y. S.; Ashry, A. H.; Eisa, M.; Tsuruta, T.
2015-03-01
Fast detection of neutrons in CR-39 and DAM-ADC nuclear track detectors were investigated using new etching conditions. The neutron irradiation is performed using a 5 mCi Am-Be source present at the National Institute of Standards (NIS) of Egypt. Using the new etching condition, irradiated CR-39 samples were etched for 4 h and DAM-ADC samples for 80 min. Suitable analyzing software has been used to analyze experimental data.The dependence of neutrons track density on the neutrons fluence is investigated. When etched under optimum conditions, the relationship between track density and fluence is determined which is found to be linear. Detection efficiency has been represented for both SSNTDs and found to be constant with fluence, which reflects the importance of using CR-39 and DAM-ADC detectors in the field of neutron dosimetry. Linear relationship between track density and effective dose is determined.