Nonlinear observer design for state and disturbance estimation

A new systematic framework for nonlinear observer design that allows the concurrent estimation of the process state variables together with key unknown process or sensor disturbances is proposed. The nonlinear observer design problem is addressed within a similar methodological framework as the one introduced in [N. Kazantzis, C. Kravaris, Nonlinear observer design using Lyapunov's auxiliary theorem, Systems Control Lett. 34 (1998) 241; A.J. Krener, M. Xiao, Nonlinear observer design in the Siegel domain, SIAM J. Control Optim. 41 (2002) 932.] for state estimation purposes only. From a mathematical standpoint, the problem under consideration is addressed through a system of first-order singular PDEs for which a rather general set of solvability conditions is derived. A nonlinear observer is then designed with a state-dependent gain that is computed from the solution of the system of singular PDEs. Under the aforementioned conditions, both state and disturbance estimation errors converge to zero with assignable rates. The convergence properties of the proposed nonlinear observer are tested through simulation studies in an illustrative example involving a biological reactor.     

Segmentation of historical machine-printed documents using Adaptive Run Length Smoothing and skeleton segmentation paths

In this paper, we strive towards the development of efficient techniques in order to segment document pages resulting from the digitization of historical machine-printed sources. This kind of documents often suffer from low quality and local skew, several degradations due to the old printing matrix quality or ink diffusion, and exhibit complex and dense layout. To face these problems, we introduce the following innovative aspects: (i) use of a novel Adaptive Run Length Smoothing Algorithm (ARLSA) in order to face the problem of complex and dense document layout, (ii) detection of noisy areas and punctuation marks that are usual in historical machine-printed documents, (iii) detection of possible obstacles formed from background areas in order to separate neighboring text columns or text lines, and (iv) use of skeleton segmentation paths in order to isolate possible connected characters. Comparative experiments using several historical machine-printed documents prove the efficiency of the proposed technique.     

Computer methods for automating preoperative dental implant planning: implant positioning and size assignment

The paper presents computer-aided methods that allocate a dental implant and suggest its size, during the pre-operative planning stage, in conformance with introduced optimization criteria and established clinical requirements. Based on computed tomography data of the jaw and prosthesis anatomy, single tooth cases are planned for the best-suited implant insertion at a user-defined region. An optimum implantation axis line is produced and cylindrical implants of various candidate sizes are then automatically positioned, while their occlusal end is leveled to bone ridge, and evaluated. Radial safety margins are used for the assessment of the implant safety distance from neighboring anatomical structures and bone quantity and quality are estimated and taken into consideration. A case study demonstrates the concept and allows for its discussion.     

An architecture for managing virtual circuit and virtual path services in ATM networks

ATM networks rely on the Virtual Circuit (VC) and Virtual Path (VP) concepts to provide unicast connection-oriented services with Quality of Service (QoS) guarantees. This paper presents a model for managing the configuration and performance of the VC and VP services in these networks. The model consists of a connection management architecture that provides the services and is instrumented for network management purposes, and a network management architecture that uses the OSI management model to provide access to the appropriate service monitoring and control functions. The network management architecture proposes complete managed object definitions that achieve a variety of monitoring and control objectives: service configuration, service performance at the call and cell level, and service control. The latter includes the capability to establish VPs and control their allocated networking capacity and also control parameters of the signaling system that affect the performance of the VC service. The architecture was implemented in its entirety on the Xunet ATM testbed, and several experiments were conducted to illustrate the trade-off between the throughput of the VC service and the allocation of capacity to VPs. The experiments further demonstrated that the signaling system can create throughput bottlenecks in the absence of VPs in the network, and therefore, the network operator can increase performance by controlling the VP distribution.     

A state estimator including conventional and synchronized phasor measurements

This paper presents an effective weighted least square formulation for the solution of the state estimation problem, considering conventional as well as synchronized phasor measurements. The proposed algorithm is based on a reference-free formulation, using both rectangular and polar coordinates for branch current phasor measurements, and alleviates any numerical problems encountered during initialization stage of the state estimation algorithm. Analytical equations are provided for the conventional and the phasor measurements and their corresponding partial derivatives with respect to state variables. The proposed algorithm is tested with a seven bus system and is compared with the traditional state estimator. Simulation results show that the proposed algorithm improves the precision greatly and gets better behavior as compared with the traditional state estimator.     

Visual understanding industrial workflows under uncertainty on distributed service oriented architectures

Service Oriented Architecture (SOA) is an evolution of distributed computing based on the request/reply design paradigm for synchronous and asynchronous applications. In such architectures, application developers or system integrators can build scenarios by composing one or more services without knowing the services’ underlying implementations. In this paper, we adopt a SOA framework for on-line scheduling complex industrial workflows. The proposed SOA consists of three main layers; the input layer, the benchmarking layer, the prediction layer and the scheduler. The main innovation of our SOA architecture is the prediction layer that supports computer vision tools able to visually observe how an industrial workflow is actually executed. This way, we can automatically estimate the actual execution time for a process. In particular a new self-initialized visual tracker algorithm is proposed in this paper to robustly trace workers’ trajectory in a plant via visual observations. Then, part-to-whole curve matching is presented so as to find correspondences among the traced curve and the ideal one and thus improving scheduler efficiency. The input layer interoperably describes industrial operations using the XPDL (an XML-based) format. The benchmarker evaluates much faster than real-time and in an off-line mode how long it takes for an industrial workflow to be executed on a given resource guaranteeing an almost real-time implementation of the video processing algorithms on the plant. The last component of the proposed SOA is the scheduler with the goal to assign the workflows to the available resources. In this paper, a Maximum Benefit First (MBF) scheduler is presented which maximizes the total gain received by the industry when completing execution of all the beneficial operations with minimum violations of their delivery deadlines (that is with the minimum compensations). Experiments have been conducted on a real-world industrial plant of Nissan Iberica automobile construction indicating the efficiency of the proposed system.     

Spatially Varying Mixtures Incorporating Line Processes for Image Segmentation

Spatially varying mixture models are characterized by the dependence of their mixing proportions on location (contextual mixing proportions) and they have been widely used in image segmentation. In this work, Gauss-Markov random field (MRF) priors are employed along with spatially varying mixture models to ensure the preservation of region boundaries in image segmentation. To preserve region boundaries, two distinct models for a line process involved in the MRF prior are proposed. The first model considers edge preservation by imposing a Bernoulli prior on the normally distributed local differences of the contextual mixing proportions. It is a discrete line process model whose parameters are computed by variational inference. The second model imposes Gamma prior on the Student’s-t distributed local differences of the contextual mixing proportions. It is a continuous line process whose parameters are also automatically estimated by the Expectation-Maximization (EM) algorithm. The proposed models are numerically evaluated and two important issues in image segmentation by mixture models are also investigated and discussed: the constraints to be imposed on the contextual mixing proportions to be probability vectors and the MRF optimization strategy in the frameworks of the standard and variational EM algorithm.