Adaptive moving shadow detection and removal by new semi-supervised learning technique

The efficient application of current methods of shadow detection in video is hindered by the difficulty in defining their parameters or models and/or their application domain dependence. This paper presents a new shadow detection and removal method that aims to overcome these inefficiencies. It proposes a semi-supervised learning rule using a new variant of co-training technique for shadow detection and removal in uncontrolled scenes. The new variant both reduces the run-time through a periodical execution of a co-training process according to a novel temporal framework, and generates a more generic prediction model for an accurate classification. The efficiency of the proposed method is shown experimentally on a testbed of videos that were recorded by a static camera and that included several constraints, e.g., dynamic changes in the natural scene and various visual shadow features. The conducted experimental study produced quantitative and qualitative results that highlighted the robustness of our shadow detection method and its accuracy in removing cast shadows. In addition, the practical usefulness of the proposed method was evaluated by integrating it in a Highway Control and Management System software called RoadGuard.     

Two CEGAR-based approaches for the safety verification of PLC-controlled plants

In this paper we address the safety analysis of chemical plants controlled by programmable logic controllers (PLCs). We consider a specification of the control program of the PLCs, extended with the specification of the dynamic plant behavior. The resulting hybrid models can be transformed to hybrid automata, for which advanced techniques for reachability analysis exist. However, the hybrid automata models are often too large to be analyzed. We propose two counterexample-guided abstraction refinement (CEGAR) approaches to keep the size of the hybrid models moderate.     

Contract-based verification of discrete-time multi-rate Simulink models

This paper presents an approach to modular contract-based verification of discrete-time multi-rate Simulink models. The verification approach uses a translation of Simulink models to sequential programs that can then be verified using traditional software verification techniques. Automatic generation of the proof obligations needed for verification of correctness with respect to contracts, and automatic proofs are also discussed. Furthermore, the paper provides detailed discussions about the correctness of each step in the verification process. The verification approach is demonstrated on a case study involving control software for prevention of pressure peaks in hydraulics systems.     

Application of particle swarm optimization in epileptic spike EEG source localization

Surgical therapy has become an important therapeutic alternative for patients with medically intractable epilepsy. Correct and anatomically precise localization of an epileptic focus is essential to decide if resection of brain tissue is possible. The inverse problem in EEG-based source localization is to determine the location of the brain sources that are responsible for the measured potentials at the scalp electrodes. We propose a new global optimization method based on particle swarm optimization (PSO) to solve the epileptic spike EEG source localization inverse problem. In a forward problem a modified subtraction method is proposed to reduce the computational time. The good accuracy and fast convergence are demonstrated for 2D and 3D cases with realistic head models. The results from the new method are promising for use in the pre-surgical clinic in the future.     

Real-time crowd motion planning

Real-time crowd motion planning requires fast, realistic methods for path planning as well as obstacle avoidance. In a previous work (Morini et al. in Cyberworlds International Conference, pp. 144–151, 2007), we introduced a hybrid architecture to handle real-time motion planning of thousands of pedestrians. In this article, we present an extended version of our architecture, introducing two new features: an improved short-term collision avoidance algorithm, and simple efficient group behavior for crowds. Our approach allows the use of several motion planning algorithms of different precision for regions of varied interest. Pedestrian motion continuity is ensured when switching between such algorithms. To assess our architecture, several performance tests have been conducted, as well as a subjective test demonstrating the impact of using groups. Our results show that the architecture can plan motion in real time for several thousands of characters.

垫片标准查询系统开发中的关键技术

鉴于国内外密封垫片标准众多、数据量庞大,设计了基于VisualBasic与MSAccess的垫片标准查询系统,实现了垫片标准的自动化查询。扩展了部分VB控件的功能,通过捕捉鼠标事件,实现了Picturebox控件的滚轮缩放以及MSHFlexGrid控件的滚轮翻页功能。可对查询结果进行二次筛选并输出至word文档,操作便捷。     

LCD motion‐blur estimation using different measurement methods

Abstract— The primary goal of this study was to find a measurement method for motion blur which is easy to carry out and gives results that can be reproduced from one lab to another. This method should be able to also take into account methods for reduction of motion blur such as backlight flashing. Two methods have been compared. The first method uses a high‐speed camera that permits us to directly picture the blurred‐edge profile. The second one exploits the mathematical analysis of the motion‐blur formation to construct the blurred‐edge profile from the temporal step response. Measurement results and method proposals are given and discussed.     

A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas

Explaining the causes of infeasibility of Boolean formulas has practical applications in numerous fields, such as artificial intelligence (repairing inconsistent knowledge bases), formal verification (abstraction refinement and unbounded model checking), and electronic design (diagnosing and correcting infeasibility). Minimal unsatisfiable subformulas (MUSes) provide useful insights into the causes of infeasibility. An unsatisfiable formula often has many MUSes. Based on the application domain, however, MUSes with specific properties might be of interest. In this paper, we tackle the problem of finding a smallest-cardinality MUS (SMUS) of a given formula. An SMUS provides a succinct explanation of infeasibility and is valuable for applications that are heavily affected by the size of the explanation. We present (1) a baseline algorithm for finding an SMUS, founded on earlier work for finding all MUSes, and (2) a new branch-and-bound algorithm called Digger that computes a strong lower bound on the size of an SMUS and splits the problem into more tractable subformulas in a recursive search tree. Using two benchmark suites, we experimentally compare Digger to the baseline algorithm and to an existing incomplete genetic algorithm approach. Digger is shown to be faster in nearly all cases. It is also able to solve far more instances within a given runtime limit than either of the other approaches.     

Quasi three-dimensional, n-bit optical memory based on the ellipsometric principle: model calculations

Model calculations on the ellipsometric memory are presented. The ellipsometric memory is an n-bit optical memory whose information is extracted by use of the ellipsometric principle. The memory cells of the device consist of thin-film multilayer structures, and the information of each memory cell is contained in the optical properties of the thin films. Several thin-film multilayer structures were examined in order to find out how different choices of layer materials and other system parameters such as layer thicknesses and wavelength affect resolutions and limitations of the ellipsometric memory. Such calculations are also useful for optimizing the readout resolution. It was found that it is possible to use memory cells having up to at least eight layers, which would permit 8-bit words to be stored at each location. It was also found that, in principle, several types of materials can be used as layer materials, and various aspects of different choices of materials are discussed.