2,562 research outputs found

    A Novel Approach for Image Localization Using SVM Classifier and PSO Algorithm for Vehicle Tracking

    Get PDF
    In this paper, we propose a novel methodology for vehicular image localization, by incorporating the surveillance image object identification, using a local gradient model, and vehicle localization using the time of action. The aerial images of different traffic densities are obtained using the Histograms of Oriented Gradients (HOG) Descriptor. These features are acquired simply based on locations, angles, positions, and height of cameras set on the junction board. The localization of vehicular image is obtained based on the different times of action of the vehicles under consideration. Support Vector Machines (SVM) classifier, as well as Particle Swarm Optimization (PSO), is also proposed in this work. Different experimental analyses are also performed to calculate the efficiency of optimization methods in the new proposed system. Outcomes from experimentations reveal the effectiveness of the classification precision, recall, and F measure

    Three variants Particle Swarm Optimization technique for optimal cameras network two dimensions placement

    Get PDF
    This paper addresses the problem of optimal placement in two-dimensions of the cameras network for the motion capture (MoCap) system. In fact, the MoCap system is a three- dimensional representation environment used mainly to reconstruct a real motion by using a number of fixed cameras (in position and pose). The main objective is to find the optimal placement of all cameras in a minimal time under a major constraint in order to capture each reflector that must be seen by at least three cameras in the same frame in a sequence of a random motion. The two-dimensional representation is only used to solve the problem of reflector recovery. The choice of two-dimensional representation is to reduce the resolution of a three- dimensional recovery problem to a simple two-dimensional recovery, especially if all the cameras have the same height. With this strategy, the placement of cameras network is not treated as an image processing problem. The use of three variants optimization techniques by Particle Swarm Optimization (Standard Particle Swarm Optimization, Weight Particle Swarm Optimization and Canonical Particle Swarm Optimization), allowed us to solve the problem of cameras network placement in a minimal amount of time. The overall recovery objective has been achieved despite the complexity imposed in the third scenario by the Canonical Particle Swarm Optimization variant

    Genetic learning particle swarm optimization

    Get PDF
    Social learning in particle swarm optimization (PSO) helps collective efficiency, whereas individual reproduction in genetic algorithm (GA) facilitates global effectiveness. This observation recently leads to hybridizing PSO with GA for performance enhancement. However, existing work uses a mechanistic parallel superposition and research has shown that construction of superior exemplars in PSO is more effective. Hence, this paper first develops a new framework so as to organically hybridize PSO with another optimization technique for “learning.” This leads to a generalized “learning PSO” paradigm, the *L-PSO. The paradigm is composed of two cascading layers, the first for exemplar generation and the second for particle updates as per a normal PSO algorithm. Using genetic evolution to breed promising exemplars for PSO, a specific novel *L-PSO algorithm is proposed in the paper, termed genetic learning PSO (GL-PSO). In particular, genetic operators are used to generate exemplars from which particles learn and, in turn, historical search information of particles provides guidance to the evolution of the exemplars. By performing crossover, mutation, and selection on the historical information of particles, the constructed exemplars are not only well diversified, but also high qualified. Under such guidance, the global search ability and search efficiency of PSO are both enhanced. The proposed GL-PSO is tested on 42 benchmark functions widely adopted in the literature. Experimental results verify the effectiveness, efficiency, robustness, and scalability of the GL-PSO

    Robotic Wireless Sensor Networks

    Full text link
    In this chapter, we present a literature survey of an emerging, cutting-edge, and multi-disciplinary field of research at the intersection of Robotics and Wireless Sensor Networks (WSN) which we refer to as Robotic Wireless Sensor Networks (RWSN). We define a RWSN as an autonomous networked multi-robot system that aims to achieve certain sensing goals while meeting and maintaining certain communication performance requirements, through cooperative control, learning and adaptation. While both of the component areas, i.e., Robotics and WSN, are very well-known and well-explored, there exist a whole set of new opportunities and research directions at the intersection of these two fields which are relatively or even completely unexplored. One such example would be the use of a set of robotic routers to set up a temporary communication path between a sender and a receiver that uses the controlled mobility to the advantage of packet routing. We find that there exist only a limited number of articles to be directly categorized as RWSN related works whereas there exist a range of articles in the robotics and the WSN literature that are also relevant to this new field of research. To connect the dots, we first identify the core problems and research trends related to RWSN such as connectivity, localization, routing, and robust flow of information. Next, we classify the existing research on RWSN as well as the relevant state-of-the-arts from robotics and WSN community according to the problems and trends identified in the first step. Lastly, we analyze what is missing in the existing literature, and identify topics that require more research attention in the future

    On the Feasibility of Real-Time 3D Hand Tracking using Edge GPGPU Acceleration

    Get PDF
    This paper presents the case study of a non-intrusive porting of a monolithic C++ library for real-time 3D hand tracking, to the domain of edge-based computation. Towards a proof of concept, the case study considers a pair of workstations, a computationally powerful and a computationally weak one. By wrapping the C++ library in Java container and by capitalizing on a Java-based offloading infrastructure that supports both CPU and GPGPU computations, we are able to establish automatically the required server-client workflow that best addresses the resource allocation problem in the effort to execute from the weak workstation. As a result, the weak workstation can perform well at the task, despite lacking the sufficient hardware to do the required computations locally. This is achieved by offloading computations which rely on GPGPU, to the powerful workstation, across the network that connects them. We show the edge-based computation challenges associated with the information flow of the ported algorithm, demonstrate how we cope with them, and identify what needs to be improved for achieving even better performance.Comment: 6 pages, 5 figure
    corecore