Foreground moving object detection is an important process in various computer vision applications such as intelligent visual surveillance, HCI, object-based video compression, etc. One of the most successful moving o...Foreground moving object detection is an important process in various computer vision applications such as intelligent visual surveillance, HCI, object-based video compression, etc. One of the most successful moving object detection algorithms is based on Adaptive Gaussian Mixture Model （AGMM）. Although ACMM-hased object detection shows very good performance with respect to object detection accuracy, AGMM is very complex model requiring lots of floatingpoint arithmetic so that it should pay for expensive computational cost. Thus, direct implementation of the AGMM-based object detection for embedded DSPs without floating-point arithmetic HW support cannot satisfy the real-time processing requirement. This paper presents a novel rcal-time implementation of adaptive Gaussian mixture model-based moving object detection algorithm for fixed-point DSPs. In the proposed implementation, in addition to changes of data types into fixed-point ones, magnification of the Gaussian distribution technique is introduced so that the integer and fixed-point arithmetic can be easily and consistently utilized instead of real nmnher and floatingpoint arithmetic in processing of AGMM algorithm. Experimental results shows that the proposed implementation have a high potential in real-time applications.展开更多
Real-time task scheduling is of primary significance in multiprocessor systems.Meeting deadlines and achieving high system utilization are the two main objectives of task scheduling in such systems.In this paper,we re...Real-time task scheduling is of primary significance in multiprocessor systems.Meeting deadlines and achieving high system utilization are the two main objectives of task scheduling in such systems.In this paper,we represent those two goals as the minimization of the average response time and the average task laxity.To achieve this,we propose a genetic-based algorithm with problem-specific and efficient genetic operators.Adaptive control parameters are also employed in our work to improve the genetic algorithms' efficiency.The simulation results show that our proposed algorithm outperforms its counterpart considerably by up to 36% and 35% in terms of the average response time and the average task laxity,respectively.展开更多
In this paper, a new hybrid algorithm based on exploration power of a new improvement self-adaptive strategy for controlling parameters in DE （differential evolution） algorithm and exploitation capability of Nelder-...In this paper, a new hybrid algorithm based on exploration power of a new improvement self-adaptive strategy for controlling parameters in DE （differential evolution） algorithm and exploitation capability of Nelder-Mead simplex method is presented （HISADE-NMS）. The DE has been used in many practical cases and has demonstrated good convergence properties. It has only a few control parameters as number of particles （NP）, scaling factor （F） and crossover control （CR）, which are kept fixed throughout the entire evolutionary process. However, these control parameters are very sensitive to the setting of the control parameters based on their experiments. The value of control parameters depends on the characteristics of each objective function, therefore, we have to tune their value in each problem that mean it will take too long time to perform. In the new manner, we present a new version of the DE algorithm for obtaining self-adaptive control parameter settings. Some modifications are imposed on DE to improve its capability and efficiency while being hybridized with Nelder-Mead simplex method. To valid the robustness of new hybrid algorithm, we apply it to solve some examples of structural optimization constraints.展开更多
基金supported by Soongsil University Research Fund and BK 21 of Korea
文摘Foreground moving object detection is an important process in various computer vision applications such as intelligent visual surveillance, HCI, object-based video compression, etc. One of the most successful moving object detection algorithms is based on Adaptive Gaussian Mixture Model （AGMM）. Although ACMM-hased object detection shows very good performance with respect to object detection accuracy, AGMM is very complex model requiring lots of floatingpoint arithmetic so that it should pay for expensive computational cost. Thus, direct implementation of the AGMM-based object detection for embedded DSPs without floating-point arithmetic HW support cannot satisfy the real-time processing requirement. This paper presents a novel rcal-time implementation of adaptive Gaussian mixture model-based moving object detection algorithm for fixed-point DSPs. In the proposed implementation, in addition to changes of data types into fixed-point ones, magnification of the Gaussian distribution technique is introduced so that the integer and fixed-point arithmetic can be easily and consistently utilized instead of real nmnher and floatingpoint arithmetic in processing of AGMM algorithm. Experimental results shows that the proposed implementation have a high potential in real-time applications.
文摘Real-time task scheduling is of primary significance in multiprocessor systems.Meeting deadlines and achieving high system utilization are the two main objectives of task scheduling in such systems.In this paper,we represent those two goals as the minimization of the average response time and the average task laxity.To achieve this,we propose a genetic-based algorithm with problem-specific and efficient genetic operators.Adaptive control parameters are also employed in our work to improve the genetic algorithms' efficiency.The simulation results show that our proposed algorithm outperforms its counterpart considerably by up to 36% and 35% in terms of the average response time and the average task laxity,respectively.
文摘In this paper, a new hybrid algorithm based on exploration power of a new improvement self-adaptive strategy for controlling parameters in DE （differential evolution） algorithm and exploitation capability of Nelder-Mead simplex method is presented （HISADE-NMS）. The DE has been used in many practical cases and has demonstrated good convergence properties. It has only a few control parameters as number of particles （NP）, scaling factor （F） and crossover control （CR）, which are kept fixed throughout the entire evolutionary process. However, these control parameters are very sensitive to the setting of the control parameters based on their experiments. The value of control parameters depends on the characteristics of each objective function, therefore, we have to tune their value in each problem that mean it will take too long time to perform. In the new manner, we present a new version of the DE algorithm for obtaining self-adaptive control parameter settings. Some modifications are imposed on DE to improve its capability and efficiency while being hybridized with Nelder-Mead simplex method. To valid the robustness of new hybrid algorithm, we apply it to solve some examples of structural optimization constraints.
