背景模型的建立及保持方法比较

文章首先总结了一些背景的建模方法,并对这些方法进行了分类和比较,接着总结和比较了背景模型保持的方法,最后介绍了背景模型保持的一些原则。     

A controlled experiment in assessing and estimating software maintenance tasks

Context

Software maintenance is an important software engineering activity that has been reported to account for the majority of the software total cost. Thus, understanding the factors that influence the cost of software maintenance tasks helps maintainers to make informed decisions about their work.

Objective

This paper describes a controlled experiment of student programmers performing maintenance tasks on a C++ program. The objective of the study is to assess the maintenance size, effort, and effort distributions of three different maintenance types and to describe estimation models to predict the programmer’s effort spent on maintenance tasks.

Method

Twenty-three graduate students and a senior majoring in computer science participated in the experiment. Each student was asked to perform maintenance tasks required for one of the three task groups. The impact of different LOC metrics on maintenance effort was also evaluated by fitting the data collected into four estimation models.

Results

The results indicate that corrective maintenance is much less productive than enhancive and reductive maintenance and program comprehension activities require as much as 50% of the total effort in corrective maintenance. Moreover, the best software effort model can estimate the time of 79% of the programmers with the error of or less than 30%.

Conclusion

Our study suggests that the LOC added, modified, and deleted metrics are good predictors for estimating the cost of software maintenance. Effort estimation models for maintenance work may use the LOC added, modified, deleted metrics as the independent parameters instead of the simple sum of the three. Another implication is that reducing business rules of the software requires a sizable proportion of the software maintenance effort. Finally, the differences in effort distribution among the maintenance types suggest that assigning maintenance tasks properly is important to effectively and efficiently utilize human resources.     

A consensus-based method for tracking: Modelling background scenario and foreground appearance

Modelling of the background (“uninteresting parts of the scene”), and of the foreground, play important roles in the tasks of visual detection and tracking of objects. This paper presents an effective and adaptive background modelling method for detecting foreground objects in both static and dynamic scenes. The proposed method computes SAmple CONsensus (SACON) of the background samples and estimates a statistical model of the background, per pixel. SACON exploits both color and motion information to detect foreground objects. SACON can deal with complex background scenarios including nonstationary scenes (such as moving trees, rain, and fountains), moved/inserted background objects, slowly moving foreground objects, illumination changes etc.However, it is one thing to detect objects that are not likely to be part of the background; it is another task to track those objects. Sample consensus is again utilized to model the appearance of foreground objects to facilitate tracking. This appearance model is employed to segment and track people through occlusions. Experimental results from several video sequences validate the effectiveness of the proposed method.     

Optimal maintenance policy incorporating system level and unit level for mechanical systems

The study works on a multi-level maintenance policy combining system level and unit level under soft and hard failure modes. The system experiences system-level preventive maintenance (SLPM) when the conditional reliability of entire system exceeds SLPM threshold, and also undergoes a two-level maintenance for each single unit, which is initiated when a single unit exceeds its preventive maintenance (PM) threshold, and the other is performed simultaneously the moment when any unit is going for maintenance. The units experience both periodic inspections and aperiodic inspections provided by failures of hard-type units. To model the practical situations, two types of economic dependence have been taken into account, which are set-up cost dependence and maintenance expertise dependence due to the same technology and tool/equipment can be utilised. The optimisation problem is formulated and solved in a semi-Markov decision process framework. The objective is to find the optimal system-level threshold and unit-level thresholds by minimising the long-run expected average cost per unit time. A formula for the mean residual life is derived for the proposed multi-level maintenance policy. The method is illustrated by a real case study of feed subsystem from a boring machine, and a comparison with other policies demonstrates the effectiveness of our approach.     

基于ViBe的室外动态背景闪烁像素噪声消除方法

针对使用视觉背景提取(ViBe)模型在室外动态背景下进行移动目标检测时存在不规则闪烁像素点对前景检测结果造成干扰的问题,提出一种基于视觉背景提取算法的闪烁像素噪声消除方法。在背景模型建立阶段设定背景模型样本标准差阈值,约束背景模型的采样值范围以提高背景模型准确性。在前景检测阶段引入自适应检测阈值提高前景物体检测精度,在背景模型更新过程中对图像边缘背景像素点进行边缘抑制以阻止错误背景样本值更新到背景模型。在此基础上,结合形态学操作修复连通域,提高前景图像的完整性。最后选取多个视频序列将该方法与原始ViBe算法、形态学改进方法的检测结果进行对比。实验结果表明,该方法能有效消除闪烁像素噪声对前景检测造成的影响,获取更精确的前景图像。     

Improved background modeling for real-time spatio-temporal non-parametric moving object detection strategies

Answering to the growing demand of machine vision applications for the latest generation of electronic devices endowed with camera platforms, several moving object detection strategies have been proposed in recent years. Among them, spatio-temporal based non-parametric methods have recently drawn the attention of many researchers. These methods, by combining a background model and a foreground model, achieve high-quality detections in sequences recorded with non-completely static cameras and in scenarios containing complex backgrounds. However, since they have very high memory and computational associated costs, they apply some simplifications in the background modeling process, therefore decreasing the quality of the modeling.     

Fuzzy-neural self-adapting background modeling with automatic motion analysis for dynamic object detection

In this paper we propose a system that involves a Background Subtraction, BS, model implemented in a neural Self Organized Map with a Fuzzy Automatic Threshold Update that is robust to illumination changes and slight shadow problems. The system incorporates a scene analysis scheme to automatically update the Learning Rates values of the BS model considering three possible scene situations. In order to improve the identification of dynamic objects, an Optical Flow algorithm analyzes the dynamic regions detected by the BS model, whose identification was not complete because of camouflage issues, and it defines the complete object based on similar velocities and direction probabilities. These regions are then used as the input needed by a Matte algorithm that will improve the definition of the dynamic object by minimizing a cost function. Among the original contributions of this work are; an adapting fuzzy-neural segmentation model whose thresholds and learning rates are adapted automatically according to the changes in the video sequence and the automatic improvement on the segmentation results based on the Matte algorithm and Optical flow analysis. Findings demonstrate that the proposed system produces a competitive performance compared with state-of-the-art reported models by using BMC and Li databases.     

Non-parametric and parametric methods using satellite images for estimating growing stock volume in alpine and Mediterranean forest ecosystems

This paper describes applications of non-parametric and parametric methods for estimating forest growing stock volume using Landsat images on the basis of data measured in the field, integrated with ancillary information. Several k-Nearest Neighbors (k-NN) algorithm configurations were tested in two study areas in Italy belonging to Mediterranean and Alpine ecosystems. Field data were acquired by the regional forest inventory and forest management plans, and satellite images are from Landsat 5 TM and Landsat 7 ETM+. The paper describes the data used, the methodologies adopted and the results achieved in terms of pixel level accuracy of forest growing stock volume estimates. The results show that several factors affect estimation accuracy when using the k-NN method. For the two test areas a total of 3500 different configurations of the k-NN algorithm were systematically tested by changing the number and type of spectral and ancillary input variables, type of multidimensional distance measures, number of nearest neighbors and methods for spectral feature extraction using the leave-one-out (LOO) procedure. The best k-NN configurations were then used for pixel level estimation; the accuracy was estimated with a bootstrapping procedure; and the results were compared to estimates obtained using parametric regression methods implemented on the same data set.

The best k-NN growing stock volume pixel level estimates in the Alpine area have a Root Mean Square Error (RMSE) ranging between 74 and 96 m³ ha^− 1 (respectively, 22% and 28% of the mean measured value) and between 106 and 135 m³ ha^− 1 (respectively, 44% and 63% of the mean measured value) in the Mediterranean area. On the whole, the results cast a promising light on the use of non-parametric techniques for forest attribute estimation and mapping with accuracy high enough to support forest planning activities in such complex landscapes. The results of the LOO analyses also highlight the importance of a local empirical optimization phase of the k-NN procedure before defining the best algorithm configuration. In the tests performed the pixel level accuracy increased, depending on the k-NN configuration, as much as 100%.     

Quadtree-based eigendecomposition for pose estimation in the presence of occlusion and background clutter

Eigendecomposition-based techniques are popular for a number of computer vision problems, e.g., object and pose estimation, because they are purely appearance based and they require few on-line computations. Unfortunately, they also typically require an unobstructed view of the object whose pose is being detected. The presence of occlusion and background clutter precludes the use of the normalizations that are typically applied and significantly alters the appearance of the object under detection. This work presents an algorithm that is based on applying eigendecomposition to a quadtree representation of the image dataset used to describe the appearance of an object. This allows decisions concerning the pose of an object to be based on only those portions of the image in which the algorithm has determined that the object is not occluded. The accuracy and computational efficiency of the proposed approach is evaluated on 16 different objects with up to 50% of the object being occluded and on images of ships in a dockyard.

Optimal maintenance policy for multi-component systems under Markovian environment changes

In this paper, we study multi-component systems, which environmental conditions and opportunistic maintenance (OM) involve. Environmental conditions will exert an influence on deterioration processes of the components in the system. For each component, the worse the environmental conditions are, the faster its deterioration speed is. We want to determine when to preventively maintain each component under such environmental influence. Our purpose is to minimize its long-run average maintenance cost. We decompose such a multi-component system into mutually influential single-component systems, and formulate the maintenance problem of each component as a Markov decision process (MDP). Under some reasonable assumptions, we prove the existence of the optimal (n_r, N_r) type policy for each component. A policy iteration method is used to calculate its optimal maintenance policy. Based on the method, we develop an iterative approximation algorithm to obtain an acceptable maintenance policy for a multi-component system. Numerical examples find that environmental conditions and OM pose significant effects on a maintenance policy.     

DSNotify – A solution for event detection and link maintenance in dynamic datasets

The dynamics of linked datasets may lead to broken links if data providers do not react to changes appropriately. Such broken links denote interrupted navigational paths between resources and may lead to unavailability of data. As a possible solution, we developed DSNotify, an event-detection framework that informs actors about various types of changes and allows them to maintain links to resources in distributed linked data sets. For representing changes we developed the DSNotify Eventset Vocabulary. Different from other vocabularies it applies a resource-centric perspective and preserves the timely order of changes. We further describe our reusable evaluation infrastructure, which can be extended for extracting change sets from arbitrary linked datasets.     

Preventive maintenance and replacement scheduling for repairable and maintainable systems using dynamic programming

This paper presents mathematical models and a solution approach to determine the optimal preventive maintenance schedules for a repairable and maintainable series system of components with an increasing rate of occurrence of failure (ROCOF). The maintenance planning horizon has been divided into discrete and equally-sized periods and in each period, three possible actions for each component (maintain it, replace it, or do nothing) have been considered. The optimal decisions for each component in each period are investigated such that the objectives and the requirements of the system can be achieved. In particular, the cases of minimizing total cost subject to a constraint on system reliability, and maximizing system reliability subject to a budgetary constraint on overall cost have been modeled. As the optimization methodology, dynamic programming combined with branch-and-bound method is utilized and the effectiveness of the approach is presented through the use of a numerical example. Such a modeling approach should be useful for maintenance planners and engineers tasked with the problem of developing recommended maintenance plans for complex systems of components.     

Decomposition into low-rank plus additive matrices for background/foreground separation: A review for a comparative evaluation with a large-scale dataset

Background/foreground separation is the first step in video surveillance system to detect moving objects. Recent research on problem formulations based on decomposition into low-rank plus sparse matrices shows a suitable framework to separate moving objects from the background. The most representative problem formulation is the Robust Principal Component Analysis (RPCA) solved via Principal Component Pursuit (PCP) which decomposes a data matrix into a low-rank matrix and a sparse matrix. However, similar robust implicit or explicit decompositions can be made in the following problem formulations: Robust Non-negative Matrix Factorization (RNMF), Robust Matrix Completion (RMC), Robust Subspace Recovery (RSR), Robust Subspace Tracking (RST) and Robust Low-Rank Minimization (RLRM). The main goal of these similar problem formulations is to obtain explicitly or implicitly a decomposition into low-rank matrix plus additive matrices. These formulation problems differ from the implicit or explicit decomposition, the loss function, the optimization problem and the solvers. As the problem formulation can be NP-hard in its original formulation, and it can be convex or not following the constraints and the loss functions used, the key challenges concern the design of efficient relaxed models and solvers which have to be with iterations as few as possible, and as efficient as possible. In the application of background/foreground separation, constraints inherent to the specificities of the background and the foreground as the temporal and spatial properties need to be taken into account in the design of the problem formulation. Practically, the background sequence is then modeled by a low-rank subspace that can gradually change over time, while the moving foreground objects constitute the correlated sparse outliers. Although, many efforts have been made to develop methods for the decomposition into low-rank plus additive matrices that perform visually well in foreground detection with reducing their computational cost, no algorithm today seems to emerge and to be able to simultaneously address all the key challenges that accompany real-world videos. This is due, in part, to the absence of a rigorous quantitative evaluation with synthetic and realistic large-scale dataset with accurate ground truth providing a balanced coverage of the range of challenges present in the real world. In this context, this work aims to initiate a rigorous and comprehensive review of the similar problem formulations in robust subspace learning and tracking based on decomposition into low-rank plus additive matrices for testing and ranking existing algorithms for background/foreground separation. For this, we first provide a preliminary review of the recent developments in the different problem formulations which allows us to define a unified view that we called Decomposition into Low-rank plus Additive Matrices (DLAM). Then, we examine carefully each method in each robust subspace learning/tracking frameworks with their decomposition, their loss functions, their optimization problem and their solvers. Furthermore, we investigate if incremental algorithms and real-time implementations can be achieved for background/foreground separation. Finally, experimental results on a large-scale dataset called Background Models Challenge (BMC 2012) show the comparative performance of 32 different robust subspace learning/tracking methods.     

求解动态维修资源优化调度的多目标进化算法

为解决维修资源调度过程中出现的维修资源预测不准、资源冲突的问题,本文建立了不同作战阶段的多供应中心?多需求点的的动态维修资源优化调度模型,使得多个供应中心可以及时、高效地对需求点进行维修资源调度,减少了资源调度时间和每个需求点的维修资源不满足量。为了更好地求解提出的模型,本文提出了一种改进的多目标进化算法,在经典的多目标进化算法的基础上,使用正态分布交叉算子、全局探索增强型差分进化算子和自适应变异算子的协同进化策略,提高了算法的局部搜索能力和种群的多样性。仿真实验表明,本文提出的算法具有良好的收敛性和分布均匀性,并且具有较高的求解效率。     

Maintenance costs and makespan minimization for assembly permutation flow shop scheduling by considering preventive and corrective maintenance

The joint optimization of production scheduling and maintenance planning has a significant influence on production continuity and machine reliability. However, limited research considers preventive maintenance (PM) and corrective maintenance (CM) in assembly permutation flow shop scheduling. This paper addresses the bi-objective joint optimization of both PM and CM costs in assembly permutation flow shop scheduling. We also propose a new mixed integer linear programming model for the minimization of the makespan and maintenance costs. Two lemmas are inferred to relax the expected number of failures and CM cost to make the model linear. A restarted iterated Pareto greedy (RIPG) algorithm is applied to solve the problem by including a new evaluation of the solutions, based on a PM strategy. The RIPG algorithm makes use of novel bi-objective-oriented greedy and referenced local search phases to find non-dominated solutions. Three types of experiments are conducted to evaluate the proposed MILP model and the performance of the RIPG algorithm. In the first experiment, the MILP model is solved with an epsilon-constraint method, showing the effectiveness of the MILP model in small-scale instances. In the remaining two experiments, the RIPG algorithm shows its superiority for all the instances with respect to four well-known multi-objective metaheuristics.     

云环境下基于Bayesian主观信任模型的动态级调度算法

针对云环境下存在的信任问题,提出了一种基于Bayesian方法的主观信任模型,用于量化和评估节点的可信程度。该模型给出了信任传递与合成的数学表述和实现方法,同时考虑云资源节点具有动态性、异构性、欺骗性等特征,引入了惩罚机制和分级剪枝过滤机制。最后将该模型应用于DLS算法得到基于Bayesian主观信任模型的动态级调度算法(BST-DLS)。分析及仿真实验结果表明,提出的BSTDLS算法能够以较小的调度长度为代价,有效地提高云环境下任务执行的成功率。     

New integration of preventive maintenance and production planning with cell formation and group scheduling for dynamic cellular manufacturing systems

This paper proposes a new integration method for cell formation, group scheduling, production, and preventive maintenance (PM) planning problems in a dynamic cellular manufacturing system (CMS). The cell formation sub-problem aims to form part families and machine groups, which minimizes the inter-cell material handling, under-utilization, and relocation costs. The production planning aspect is a multi-item capacitated lot-sizing problem accompanied by sub-contracting decisions, while the group scheduling problem deals with the decisions on the sequential order of the parts and their corresponding completion times. The purpose of the maintenance sub-problem is to determine the availability of the system and the time when the noncyclical perfect PM must be implemented to reduce the number of corrective actions. Numerical examples are generated and solved by Bender’s decomposition pack in GAMS to evaluate the interactions of the proposed model. Statistical analysis, based on a nonparametric method, is also used to study the behavior of the model’s cost components in two different situations. It is shown that by adding the PM planning decisions to the tactical decisions of the dynamic CMS, the optimal configuration and production plans of the system are heavily affected. The results indicate that omitting the PM actions increases the number of sudden failures, which leads to a higher total cost. Finally, it is concluded that the boost in the total availability of the dynamic CMS is one of the main advantages of the proposed integrated method.     

An optimization algorithm inspired by propagation of yeast for fleet maintenance decision making problem involving fatigue structures

To minimize airline maintenance costs and maximize fleet availability, we developed a fleet maintenance decision-making model based on CBM with collaborative optimization (CO) for fatigue structures. The model is divided into two levels: a system level and a subsystem level. Different optimization routines are used at these two levels. The system level focuses on maximizing fleet availability and the subsystem level focuses on minimizing aircraft maintenance costs. Moreover, we proposed an optimization algorithm inspired by the propagation of yeast (OA/PY) to handle the situation where optimal solution is not unique. Finally, a case study regarding a fleet of 10 aircrafts is conducted, and the results demonstrated the effectiveness of the proposed algorithm. In the case study, aircraft maintenance planning (subsystem level) was obtained, and then it was adjusted with OA/PY to obtain optimal fleet maintenance plan (system level). Total incremental maintenance cost caused by the adjustment in the proposed method was reduced by 70.65%.