278 research outputs found

    Experimental demonstration of ship target detection in GNSS-based passive radar combining target motion compensation and track-before-detect strategies

    Get PDF
    This work discusses methods and experimental results on passive radar detection of moving ships using navigation satellites as transmitters of opportunity. The reported study highlights as the adoption of proper strategies combining target motion compensation and track-before-detect methods to achieve long time integration can be fruitfully exploited in GNSS-based passive radar for the detection of maritime targets. The proposed detection strategy reduces the sensitivity of long-time integration methods to the adopted motion models and can save the computational complexity, making it appealing for real-time implementations. Experimental results obtained in three different scenarios (port operations, navigation in open area, and river shipping) comprising maritime targets belonging to different classes show as this combined approach can be employed with success in several operative scenarios of practical interest for this technology

    Optimal path planning for detection and classification of underwater targets using sonar

    Get PDF
    2021 Spring.Includes bibliographical references.The work presented in this dissertation focuses on choosing an optimal path for performing sequential detection and classification state estimation to identify potential underwater targets using sonar imagery. The detection state estimation falls under the occupancy grid framework, modeling the relationship between occupancy state of grid cells and sensor measurements, and allows for the consideration of statistical dependence between the occupancy state of each grid cell in the map. This is in direct contrast to the classical formulations of occupancy grid frameworks, in which the occupancy state of each grid cell is considered statistically independent. The new method provides more accurate estimates, and occupancy grids estimated with this method typically converge with fewer measurements. The classification state estimation utilises a Dirichlet-Categorical model and a one-step classifier to perform efficient updating of the classification state estimate for each grid cell. To show the performance capabilities of the developed sequential state estimation methods, they are applied to sonar systems in littoral areas in which targets lay on the seafloor, could be proud, partially or fully buried. Additionally, a new approach to the active perception problem, which seeks to select a series of sensing actions that provide the maximal amount of information to the system, is developed. This new approach leverages the aforementioned sequential state estimation techniques to develop a set of information-theoretic cost functions that can be used for optimal sensing action selection. A path planning cost function is developed, defined as the mutual information between the aforementioned state variables before and after a measurement. The cost function is expressed in closed form by considering the prior and posterior distributions of the state variables. Choice of the optimal sensing actions is performed by modeling the path planning as a Markov decision problem, and solving it with the rollout algorithm. This work, supported by the Office of Naval Research (ONR), is intended to develop a suite of interactive sensing algorithms to autonomously command an autonomous underwater vehicle (AUV) for the task of detection and classification of underwater mines, while choosing an optimal navigation route that increases the quality of the detection and classification state estimates

    Landmine detection using semi-supervised learning.

    Get PDF
    Landmine detection is imperative for the preservation of both military and civilian lives. While landmines are easy to place, they are relatively difficult to remove. The classic method of detecting landmines was by using metal-detectors. However, many present-day landmines are composed of little to no metal, necessitating the use of additional technologies. One of the most successful and widely employed technologies is Ground Penetrating Radar (GPR). In order to maximize efficiency of GPR-based landmine detection and minimize wasted effort caused by false alarms, intelligent detection methods such as machine learning are used. Many sophisticated algorithms are developed and employed to accomplish this. One such successful algorithm is K Nearest Neighbors (KNN) classification. Most of these algorithms, including KNN, are based on supervised learning, which requires labeling of known data. This process can be tedious. Semi-supervised learning leverages both labeled and unlabeled data in the training process, alleviating over-dependency on labeling. Semi-supervised learning has several advantages over supervised learning. For example, it applies well to large datasets because it uses the topology of unlabeled data to classify test data. Also, by allowing unlabeled data to influence classification, one set of training data can be adopted into varying test environments. In this thesis, we explore a graph-based learning method known as Label Propagation as an alternative classifier to KNN classification, and validate its use on vehicle-mounted and handheld GPR systems

    Object detection in dual-band infrared

    Get PDF
    Dual-Band Infrared (DBIR) offers the advantage of combining Mid-Wave Infrared (MWIR) and Long-Wave Infrared (LWIR) within a single field-of-view (FoV). This provides additional information for each spectral band. DBIR camera systems find applications in both military and civilian contexts. This work introduces a novel labeled DBIR dataset that includes civilian vehicles, aircraft, birds, and people. The dataset is designed for utilization in object detection and tracking algorithms. It comprises 233 objects with tracks spanning up to 1,300 frames, encompassing images in both MW and LW. This research reviews pertinent literature related to object detection, object detection in the infrared spectrum, and data fusion. Two sets of experiments were conducted using this DBIR dataset: Motion Detection and CNNbased object detection. For motion detection, a parallel implementation of the Visual Background Extractor (ViBe) was developed, employing ConnectedComponents analysis to generate bounding boxes. To assess these bounding boxes, Intersection-over-Union (IoU) calculations were performed. The results demonstrate that DBIR enhances the IoU of bounding boxes in 6.11% of cases within sequences where the camera’s field of view remains stationary. A size analysis reveals ViBe’s effectiveness in detecting small and dim objects within this dataset. A subsequent experiment employed You Only Look Once (YOLO) versions 4 and 7 to conduct inference on this dataset, following image preprocessing. The inference models were trained using visible spectrum MS COCO data. The findings confirm that YOLOv4/7 effectively detect objects within the infrared spectrum in this dataset. An assessment of these CNNs’ performance relative to the size of the detected object highlights the significance of object size in detection capabilities. Notably, DBIR substantially enhances detection capabilities in both YOLOv4 and YOLOv7; however, in the latter case, the number of False Positive detections increases. Consequently, while DBIR improves the recall of YOLOv4/7, the introduction of DBIR information reduces the precision of YOLOv7. This study also demonstrates the complementary nature of ViBe and YOLO in their detection capabilities based on object size in this data set. Though this is known prior art, an approach using these two approaches in a hybridized configuration is discussed. ViBe excels in detecting small, distant objects, while YOLO excels in detecting larger, closer objects. The research underscores that DBIR offers multiple advantages over MW or LW alone in modern computer vision algorithms, warranting further research investment

    Study of Multi-Modal and Non-Gaussian Probability Density Functions in Target Tracking with Applications to Dim Target Tracking

    Get PDF
    The majority of deployed target tracking systems use some variant of the Kalman filter for their state estimation algorithm. In order for a Kalman filter to be optimal, the measurement and state equations must be linear and the process and measurement noises must be Gaussian random variables (or vectors). One problem arises when the state or measurement function becomes a multi-modal Gaussian mixture. This typically occurs with the interactive multiple model (IMM) technique and its derivatives and also with probabilistic and joint probabilistic data association (PDA/JPDA) algorithms. Another common problem in target tracking is that the target\u27s signal-to-noise ratio (SNR) at the sensor is often low. This situation is often referred to as the dim target tracking or track-before-detect (TBD) scenario. When this occurs, the probability density function (PDF) of the measurement likelihood function becomes non-Gaussian and often has a Rayleigh or Ricean distribution. In this case, a Kalman filter variant may also perform poorly. The common solution to both of these problems is the particle filter (PF). A key drawback of PF algorithms, however, is that they are computationally expensive. This dissertation, thus, concentrates on developing PF algorithms that provide comparable performance to conventional PFs but at lower particle costs and presents the following four research efforts. 1. A multirate multiple model particle filter (MRMMPF) is presented in Section-3. The MRMMPF tracks a single, high signal-to-noise-ratio, maneuvering target in clutter. It coherently accumulates measurement information over multiple scans via discrete wavelet transforms (DWT) and multirate processing. This provides the MRMMPF with a much stronger data association capability than is possible with a single scan algorithm. In addition, its particle filter nature allows it to better handle multiple modes that arise from multiple target motion models. Consequently, the MRMMPF provides substantially better root-mean-square error (RMSE) tracking performance than either a full-rate or multirate Kalman filter tracker or full-rate multiple model particle filter (MMPF) with a same particle count. 2. A full-rate multiple model particle filter for track-before-detect (MMPF-TBD) and a multirate multiple model particle filter for track-before-detect (MRMMPF-TBD) are presented in Section-4. These algorithms extend the areas mentioned above and track low SNR targets which perform small maneuvers. The MRMMPF-TBD and MMPF-TBD both use a combined probabilistic data association (PDA) and maximum likelihood (ML) approach. The MRMMPF-TBD provides equivalent RMSE performance at substantially lower particle counts than a full-rate MMPF-TBD. In addition, the MRMMPF-TBD tracks very dim constant velocity targets that the MMPF-TBD cannot. 3. An extended spatial domain multiresolutional particle filter (E-SD-MRES-PF) is developed in Section-5. The E-SD-MRES-PF modifies and extends a recently developed spatial domain multiresolutional particle filter prototype. The prototype SD-MRES-PF was only demonstrated for one update cycle. In contrast, E-SD-MRES-PF functions over multiple update cycles and provides comparable RMSE performance at a reduced particle cost under a variety of PDF scenarios. 4. Two variants of a single-target Gaussian mixture model particle filter (GMMPF) are presented in Section-6. The GMMPF models the particle cloud as a Gaussian finite mixture model (FMM). MATLAB simulations show that the GMMPF provides performance comparable to a particle filter but at a lower particle cost

    Big Data decision support system

    Get PDF
    Includes bibliographical references.2022 Fall.Each day, the amount of data produced by sensors, social and digital media, and Internet of Things is rapidly increasing. The volume of digital data is expected to be doubled within the next three years. At some point, it might not be financially feasible to store all the data that is received. Hence, if data is not analyzed as it is received, the information collected could be lost forever. Actionable Intelligence is the next level of Big Data analysis where data is being used for decision making. This thesis document describes my scientific contribution to Big Data Actionable Intelligence generations. Chapter 1 consists of my colleagues and I's contribution in Big Data Actionable Intelligence Architecture. The proven architecture has demonstrated to support real-time actionable intelligence generation using disparate data sources (e.g., social media, satellite, newsfeeds). This work has been published in the Journal of Big Data. Chapter 2 shows my original method to perform real-time detection of moving targets using Remote Sensing Big Data. This work has also been published in the Journal of Big Data and it has received an issuance of a U.S. patent. As the Field-of-View (FOV) in remote sensing continues to expand, the number of targets observed by each sensor continues to increase. The ability to track large quantities of targets in real-time poses a significant challenge. Chapter 3 describes my colleague and I's contribution to the multi-target tracking domain. We have demonstrated that we can overcome real-time tracking challenges when there are large number of targets. Our work was published in the Journal of Sensors

    Aircraft state estimation using cameras and passive radar

    Get PDF
    Multiple target tracking (MTT) is a fundamental task in many application domains. It is a difficult problem to solve in general, so applications make use of domain specific and problem-specific knowledge to approach the problem by solving subtasks separately. This work puts forward a MTT framework (MTTF) which is based on the Bayesian recursive estimator (BRE). The MTTF extends a particle filter (PF) to handle the multiple targets and adds a probabilistic graphical model (PGM) data association stage to compute the mapping from detections to trackers. The MTTF was applied to the problem of passively monitoring airspace. Two applications were built: a passive radar MTT module and a comprehensive visual object tracking (VOT) system. Both applications require a solution to the MTT problem, for which the MTTF was utilized. The VOT system performed well on real data recorded at the University of Cape Town (UCT) as part of this investigation. The system was able to detect and track aircraft flying within the region of interest (ROI). The VOT system consisted of a single camera, an image processing module, the MTTF module and an evaluation module. The world coordinate frame target localization was within ±3.2 km and these results are presented on Google Earth. The image plane target localization has an average reprojection error of ±17.3 pixels. The VOT system achieved an average area under the curve value of 0.77 for all receiver operating characteristic curves. These performance figures are typical over the ±1 hr of video recordings taken from the UCT site. The passive radar application was tested on simulated data. The MTTF module was designed to connect to an existing passive radar system developed by Peralex Electronics Pty Ltd. The MTTF module estimated the number of targets in the scene and localized them within a 2D local world Cartesian coordinate system. The investigations encompass numerous areas of research as well as practical aspects of software engineering and systems design

    Activity Analysis; Finding Explanations for Sets of Events

    Get PDF
    Automatic activity recognition is the computational process of analysing visual input and reasoning about detections to understand the performed events. In all but the simplest scenarios, an activity involves multiple interleaved events, some related and others independent. The activity in a car park or at a playground would typically include many events. This research assumes the possible events and any constraints between the events can be defined for the given scene. Analysing the activity should thus recognise a complete and consistent set of events; this is referred to as a global explanation of the activity. By seeking a global explanation that satisfies the activity’s constraints, infeasible interpretations can be avoided, and ambiguous observations may be resolved. An activity’s events and any natural constraints are defined using a grammar formalism. Attribute Multiset Grammars (AMG) are chosen because they allow defining hierarchies, as well as attribute rules and constraints. When used for recognition, detectors are employed to gather a set of detections. Parsing the set of detections by the AMG provides a global explanation. To find the best parse tree given a set of detections, a Bayesian network models the probability distribution over the space of possible parse trees. Heuristic and exhaustive search techniques are proposed to find the maximum a posteriori global explanation. The framework is tested for two activities: the activity in a bicycle rack, and around a building entrance. The first case study involves people locking bicycles onto a bicycle rack and picking them up later. The best global explanation for all detections gathered during the day resolves local ambiguities from occlusion or clutter. Intensive testing on 5 full days proved global analysis achieves higher recognition rates. The second case study tracks people and any objects they are carrying as they enter and exit a building entrance. A complete sequence of the person entering and exiting multiple times is recovered by the global explanation

    Discrete Wavelet Methods for Interference Mitigation: An Application To Radio Astronomy

    Get PDF
    The field of wavelets concerns the analysis and alteration of signals at various resolutions. This is achieved through the use of analysis functions which are referred to as wavelets. A wavelet is a signal defined for some brief period of time that contains oscillatory characteristics. Generally, wavelets are intentionally designed to posses particular qualities relevant to a particular signal processing application. This research project makes use of wavelets to mitigate interference, and documents how wavelets are effective in the suppression of Radio Frequency Interference (RFI) in the context of radio astronomy. This study begins with the design of a library of smooth orthogonal wavelets well suited to interference suppression. This is achieved through the use of a multi-parameter optimization applied to a trigonometric parameterization of wavelet filters used for the implementation of the Discrete Wavelet Transform (DWT). This is followed by the design of a simplified wavelet interference suppression system, from which measures of performance and suitability are considered. It is shown that optimal performance metrics for the suppression system are that of Shannon’s entropy, Root Mean Square Error (RMSE) and normality testing using the Lilliefors test. From the application of these heuristics, the optimal thresholding mechanism was found to be the universal adaptive threshold and entropy based measures were found to be optimal for matching wavelets to interference. This in turn resulted in the implementation of the wavelet suppression system, which consisted of a bank of matched filters used to determine which interference source is present in a sampled time domain vector. From this, the astronomy based application was documented and results were obtained. It is shown that the wavelet based interference suppression system outperforms existing flagging techniques. This is achieved by considering measures of the number of sources within a radio-image of the Messier 83 (M83) galaxy and the power of the main source in the image. It is shown that designed system results in an increase of 27% in the number of sources in the recovered radio image and a 1.9% loss of power of the main source
    • …
    corecore