Search

This paper proposes a new decentralized data-driven load restoration (DDLR) scheme for transmission and distribution (TD) systems with high penetration of wind power. Robust DDLR models are constructed in order to handle uncertainties and ensure the feasibility of decentralized schemes. The Wasserstein metric is used to describe the ambiguity sets of probability distributions in order to build the complete DDLR model and realize computationally tractable formulation. A data-driven model-nested analytical target cascading (DATC) algorithm is developed to obtain the final load restoration result by iteratively solving small-scale mathematical models. The proposed DDLR scheme provides load restoration results with adjustable robustness, and performance efficiency is independent from the amount of data. The DDLR scheme makes full use of the available data while respecting information privacy requirements of independent operated systems, and ensures the feasibility of a decentralized load restoration strategy even in the worst-case condition. The effectiveness of the proposed method is validated using a small-scale TD system and a large-scale system with the IEEE 118-bus TS and thirty IEEE-33 DSs, showing high computational efficiency and superior restoration performance. [ABSTRACT FROM AUTHOR]

Diagnosis by comparison is a realistic approach to detect faults of multiprocessor systems. This paper considers a pessimistic diagnostic strategy for hypercube-like multiprocessor systems under the comparison model. The pessimistic strategy is a diagnostic process whereby all faulty nodes can be correctly identified and at most one fault-free node may be misjudged as a faulty node. We propose a pessimistic diagnosis algorithm based on the largest component in the faulty system. For a system with N = 2n nodes and n ≥ 5 , when the number of faulty nodes is bounded by 2n − 2 , the algorithm can correctly identify all nodes except at most one node left undiagnosed. The time complexity of the algorithm is O(Nlog2N). [ABSTRACT FROM PUBLISHER]

In this paper, we investigate the use of first-order reliability methods to quantify the uncertainty in the remaining useful life (RUL) estimate of components used in engineering applications. The prediction of RUL is affected by several sources of uncertainty, and it is important to systematically quantify their combined effect on the RUL prediction in order to aid risk assessment, risk mitigation, and decision-making. While sampling-based algorithms have been conventionally used for quantifying the uncertainty in RUL, analytical approaches are computationally cheaper, and sometimes they are better suited for online decision-making. Exact analytical algorithms may not be available for practical engineering applications, but effective approximations can be made using first-order reliability methods. This paper describes three first-order reliability-based methods for RUL uncertainty quantification: first-order second moment method (FOSM), the first-order reliability method (FORM), and the inverse first-order reliability method (inverse-FORM). The inverse-FORM methodology is particularly useful in the context of online health monitoring, and this method is illustrated using the power system of an unmanned aerial vehicle, where the goal is to predict the end of discharge of a lithium-ion battery. [ABSTRACT FROM AUTHOR]

This paper presents a closed-form noniterative transformation of the Maxwell-Garnett mixing rule for biphased mixtures to the triple-pole Debye relaxation formula. For the first time, it is formally proven that such a transformation is complete for conductive constituent materials. In other words, the Maxwell-Garnett representation of any biphased mixture of any conductive materials always has its formal equivalent in the Debye form with three poles at most. For specific aspect ratios of ellipsoidal inclusions, the number of poles reduces to one or two, which is formally proven herein, while in previous studies, a single-pole Debye model was arbitrarily assumed. The proposed transformation provides Debye parameters as an explicit function of a mixture composition, which is competitive to alternative techniques based on laborious curve-fitting algorithms. The newly proposed approach is of particular importance to time-domain modeling of dilute mixtures, where the Maxwell-Garnett mixing rule is usually approximated with available dispersive models. Computational examples given in this paper show advantages of the presented method over previous Maxwell-Garnett to Debye conversion algorithms, in terms of accuracy, robustness, and computational cost. [ABSTRACT FROM AUTHOR]

IC3 is one of the most successful algorithms for hardware model checking. Since its invention in 2010, several variants of the original algorithm have been published, proposing optimizations and/or alternative procedures for many different steps of the algorithm. In this paper, we present a thorough empirical comparison of a large set of optimizations and procedures for the steps of IC3, considering “high-level” variants/extensions to the basic algorithm, as well as “low-level” optimizations/configuration settings. We implemented each of them in the same tool, optimizing the implementations to the best of our knowledge. This enabled for a flexible experimentation in a controlled environment, and to gain new insights about their most important differences and commonalities, as well as about their performance characteristics. We conducted the experiments using as benchmarks the problems used in the last four editions of the hardware model checking competition. The analysis helped us to identify several settings leading to significant improvements with respect to a basic implementation of IC3. [ABSTRACT FROM AUTHOR]

We consider a statistical model for the problem of finding subgraphs with specified topology in an otherwise random graph. This task plays an important role in the analysis of social and biological networks. In these types of networks, small subgraphs with a specific structure have important functional roles, and they are referred to as motifs. Within this model, one or multiple copies of a subgraph is added (planted) in an Erdős–Renyi random graph with $n$ vertices and edge probability $q_{0}$. We ask whether the resulting graph can be distinguished reliably from a pure Erdős–Renyi random graph, and we present two types of result. First we investigate the question from a purely statistical perspective, and ask whether there isanytest that can distinguish between the two graph models. We provide necessary and sufficient conditions that are essentially tight for small enough subgraphs. Next we study two polynomial-time algorithms for solving the same problem: a spectral algorithm and a semidefinite programming (SDP) relaxation. For the spectral algorithm, we establish sufficient conditions under which it distinguishes the two graph models with high probability. Under the same conditions the spectral algorithm indeed identifies the hidden subgraph. The spectral algorithm is substantially sub-optimal with respect to the optimal test. We show that a similar gap is present for the more sophisticated SDP approach. [ABSTRACT FROM AUTHOR]

This letter proposes a method to determine the optimal shift frequency (OSF) for shifted frequency (SF)-based simulation. The SF-based simulation algorithm is briefly introduced, and the error of SF-based simulation is quantitatively analyzed. The OSF that minimizes the error is deduced, which can improve the simulation accuracy. Furthermore, the influence of time-step size on the OSF is investigated. Numerical test results demonstrate the effectiveness of the method in determining the OSF for SF-based simulation. [ABSTRACT FROM AUTHOR]

Topic modeling has become a widely used tool for document management. However, there are few topic models distinguishing the importance of documents on different topics. In this paper, we propose a framework LIMTopic to incorporate link based importance into topic modeling. To instantiate the framework, RankTopic and HITSTopic are proposed by incorporating topical pagerank and topical HITS into topic modeling respectively. Specifically, ranking methods are first used to compute the topical importance of documents. Then, a generalized relation is built between link importance and topic modeling. We empirically show that LIMTopic converges after a small number of iterations in most experimental settings. The necessity of incorporating link importance into topic modeling is justified based on KL-Divergences between topic distributions converted from topical link importance and those computed by basic topic models. To investigate the document network summarization performance of topic models, we propose a novel measure called log-likelihood of ranking-integrated document-word matrix. Extensive experimental results show that LIMTopic performs better than baseline models in generalization performance, document clustering and classification, topic interpretability and document network summarization performance. Moreover, RankTopic has comparable performance with relational topic model (RTM) and HITSTopic performs much better than baseline models in document clustering and classification. [ABSTRACT FROM AUTHOR]

Model checking is a formal method for verifying whether the system satisfies a user-defined specification. Compared to simulation, model checking is restricted in capacity. On the other hand, simulation is weak in detecting bugs that require long and complex sequences of events to be exposed. This paper combines model checking and simulation in an abstraction-refinement scheme to mitigate the problems of both methods. Abstraction refinement iteratively constructs a simplified model to verify the original model. While a simplified model mitigates the weakness of model checking, the set of simplified error traces model helps guide simulation toward deep bugs. In abstraction refinement, concretization—a process of deriving an error trace in the original model from the abstract ones—is used to invalidate spurious abstract error traces or to refute a property. In this paper, we describe a novel concretization algorithm that combines simulation with satisfiability to efficiently refute properties with very long error traces. [ABSTRACT FROM AUTHOR]

This paper focuses on the optimization of a linear actuator by the “output space mapping (OSM)” method. The underlying objective of this work lies in the minimization of the time required for the achievement of this optimal design. Indeed, in addition to the sole costs of optimization processes strictly speaking, the time needed for the developpement of the models is taken into account. In the context of OSM, two different finite-element models of the same actuator are used. This paper presents these modeling solutions and considers their corresponding accuracy. Results of this multi-objective optimization method are presented and compared with those obtained by the sequential simplex (SS) method based solely on the fine model. Both approaches give similar results. However, the comparison of their performances clearly shows that the OSM algorithm is an effective technique for reducing the computation time of optimization studies, even in the case of relatively simple electromagnetic structures. Hence, this approach leads to an original and effective optimization methodology. [ABSTRACT FROM AUTHOR]

Hyperspectral images exhibit strong dependencies across spatial and spectral neighbors, which have been proved to be very useful for hyperspectral image classification. The recently defined conditional random field (CRF) can effectively model and use the dependencies for classification of hyperspectral images in a unified probabilistic framework. However, in order to be computationally tractable, the usual CRFs are limited to incorporate only pairwise potentials. Thus, the usual CRFs can capture only pairwise interactions and neglect higher order dependencies, which are potentially useful high-level properties particularly for the classification of hyperspectral image consisting of complex components. This paper overcomes this limitation by developing hyperspectral image classification algorithm based on a CRF with sparse higher order potentials, which are specially designed to incorporate complex characteristics of hyperspectral images. To efficiently implement the CRF model at training step, this paper develops an efficient local method under the piecewise training framework, while at inference step, this proposes a simple strategy to combine the piecewisely trained model to overcome the possible over-counting problems. Moreover, the combined model with the specially defined potentials can be efficiently inferred by graph cut method. Experiments on the real-world data attest to the accuracy, effectiveness, and efficiency of the proposed model on modeling and classifying hyperspectral images. [ABSTRACT FROM AUTHOR]

The paper proposes a new message passing algorithm for cycle-free factor graphs. The proposed “entropy message passing” (EMP) algorithm may be viewed as sum-product message passing over the entropy semiring, which has previously appeared in automata theory. The primary use of EMP is to compute the entropy of a model. However, EMP can also be used to compute expressions that appear in expectation maximization and in gradient-descent algorithms. [ABSTRACT FROM AUTHOR]

We present, in this paper, the FAIR algorithm: a fast algorithm for document image restoration. This algorithm has been submitted to different contests where it showed good performance in comparison to the state of the art. In addition, this method is scale invariant and fast enough to be used in real-time applications. The method is based on a double-threshold edge detection approach that makes it possible to detect small details while remaining robust against noise. The performance of the proposition is evaluated on several types of degraded document images where considerable background noise or variation in contrast and illumination exist. [ABSTRACT FROM PUBLISHER]

When a catadioptric imaging system suffers from limited depth of field, a single image cannot capture all the objects with clear focus. To solve this problem, a set of multifocal images can be used to extend the depth of the field by fusing the best-focused image regions to an overall well-focused composite image. In this paper, we propose a novel model-based method that avoids the computational cost problem of previous extended-depth-of-field algorithms. On the basis of the special optical geometry properties of catadioptric systems, the proposed model describes the shapes of the best-focused image regions in multifocal images by a series of neighboring concentric annuluses. Then we propose a method to estimate the model parameters. On the basis of this model, an overall well-focused image is obtained by combining the best-focused regions with a fast and reliable online operation. Experiments on catadioptric images of a variety of different scenes and camera settings verify the validity of the model and the robust performance of the proposed method. [ABSTRACT FROM AUTHOR]

In this paper, an error surface-considered modeling algorithm for quarter-pixel motion estimation during video encoding is presented. We previously proposed two algorithms: a model-based quarter-pixel motion estimation (MBQME) algorithm and a hierarchical modelbased quarter-pixel motion estimation (HMBQME) algorithm. MBQME is an interpolation-free algorithm that has a minimum motion estimation time, while HMBQME has selective interpolation according to the decision process. Consequently, the peak signal-to-noise ratio (PSNR) for HMBQME is better than that of MBQME, but the motion estimation time is also increased. As an alternative method, we propose an error surface-considered modeling algorithm. In this scheme, the tendency of the error surface is first assessed. Using the strength of the edge at the error surface, we can classify the error surface region as plain or textured. For plain regions, interpolation-free and simplestructured modeling is appropriate for the quarter-pixel motion estimation method. In this case, we modified conventional mathematical modeling algorithm suitable for plain region. For textured regions, additional interpolation is needed for more accurate modeling. We calculate the half-pixel SAD values and perform more accurate modeling so as to find the best motion vector (MV). The experimental results show that the proposed scheme has better PSNR performance than any previous algorithms with minimum motion estimation time. [ABSTRACT FROM PUBLISHER]

Dummy fill has been demonstrated to be an effective technique to reduce process variation and improve manufacturability for advanced integrated circuit (IC) designs. However, the computation load, often several days for a realistic IC design, is a significant portion of the cycle time for delivering first silicon on new or modified designs. In this paper, we propose a novel design flow and dummy-fill algorithm based on Boolean operations, which greatly improves computational efficiency and pattern density uniformity, and enables dummy generation to be combined with the mask-preparation Boolean operations performed by the mask-fabrication facility. Mask data preparation can be performed in parallel with dummy generation and post-dummy simulation checks at the design house, resulting in improved first-silicon cycle time. Experimental results demonstrate these benefits in the context of an advanced foundry process technology. [ABSTRACT FROM PUBLISHER]

Segmenting semantically meaningful whole objects from images is a challenging problem, and it becomes especially so without higher level common sense reasoning. In this paper, we present an interactive segmentation framework that integrates image appearance and boundary constraints in a principled way to address this problem. In particular, we assume that small sets of pixels, which are referred to as seed pixels, are labeled as the object and background. The seed pixels are used to estimate the labels of the unlabeled pixels using Dirichlet process multiple-view learning, which leverages 1) multiple-view learning that integrates appearance and boundary constraints and 2) Dirichlet process mixture-based nonlinear classification that simultaneously models image features and discriminates between the object and background classes. With the proposed learning and inference algorithms, our segmentation framework is experimentally shown to produce both quantitatively and qualitatively promising results on a standard dataset of images. In particular, our proposed framework is able to segment whole objects from images given insufficient seeds. [ABSTRACT FROM AUTHOR]

Recently, extensive research efforts have been dedicated to view-based methods for 3-D object retrieval due to the highly discriminative property of multiviews for 3-D object representation. However, most of state-of-the-art approaches highly depend on their own camera array settings for capturing views of 3-D objects. In order to move toward a general framework for 3-D object retrieval without the limitation of camera array restriction, a camera constraint-free view-based (CCFV) 3-D object retrieval algorithm is proposed in this paper. In this framework, each object is represented by a free set of views, which means that these views can be captured from any direction without camera constraint. For each query object, we first cluster all query views to generate the view clusters, which are then used to build the query models. For a more accurate 3-D object comparison, a positive matching model and a negative matching model are individually trained using positive and negative matched samples, respectively. The CCFV model is generated on the basis of the query Gaussian models by combining the positive matching model and the negative matching model. The CCFV removes the constraint of static camera array settings for view capturing and can be applied to any view-based 3-D object database. We conduct experiments on the National Taiwan University 3-D model database and the ETH 3-D object database. Experimental results show that the proposed scheme can achieve better performance than state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Expertise retrieval, whose task is to suggest people with relevant expertise on the topic of interest, has received increasing interest in recent years. One of the issues is that previous algorithms mainly consider the documents associated with the experts while ignoring the community information that is affiliated with the documents and the experts. Motivated by the observation that communities could provide valuable insight and distinctive information, we investigate and develop two community-aware strategies to enhance expertise retrieval. We first propose a new smoothing method using the community context for statistical language modeling, which is employed to identify the most relevant documents so as to boost the performance of expertise retrieval in the document-based model. Furthermore, we propose a query-sensitive AuthorRank to model the authors' authorities based on the community coauthorship networks and develop an adaptive ranking refinement method to enhance expertise retrieval. Experimental results demonstrate the effectiveness and robustness of both community-aware strategies. Moreover, the improvements made in the enhanced models are significant and consistent. [ABSTRACT FROM AUTHOR]

Fire-flame detection using a video camera is difficult because a flame has irregular characteristics, i.e., vague shapes and color patterns. Therefore, in this paper, we propose a novel fire-flame detection method using fuzzy finite automata (FFA) with probability density functions based on visual features, thereby providing a systemic approach to handling irregularity in computational systems and the ability to handle continuous spaces by combining the capabilities of automata with fuzzy logic. First, moving regions are detected via background subtraction, and the candidate flame regions are then identified by applying flame color models. In general, flame regions have a continuous irregular pattern; therefore, probability density functions are generated for the variation in intensity, wavelet energy, and motion orientation and applied to the FFA. The proposed algorithm is successfully applied to various fire/non-fire videos, and its detection performance is better than that of other methods. [ABSTRACT FROM AUTHOR]

Computational color constancy is a fundamental prerequisite for many computer vision applications. This paper presents a survey of many recent developments and state-of-the-art methods. Several criteria are proposed that are used to assess the approaches. A taxonomy of existing algorithms is proposed and methods are separated in three groups: static methods, gamut-based methods, and learning-based methods. Further, the experimental setup is discussed including an overview of publicly available datasets. Finally, various freely available methods, of which some are considered to be state of the art, are evaluated on two datasets. [ABSTRACT FROM PUBLISHER]

Human action recognition and annotation is an active research topic in computer vision. How to model various actions, varying with time resolution, visual appearance, and others, is a challenging task. In this paper, we propose a boosted exemplar learning (BEL) approach to model various actions in a weakly supervised manner, i.e., only action bag-level labels are provided but action instance level ones are not. The proposed BEL method can be summarized as three steps. First, for each action category, amount of class-specific candidate exemplars are learned through an optimization formulation considering their discrimination and co-occurrence. Second, each action bag is described as a set of similarities between its instances and candidate exemplars. Instead of simply using a heuristic distance measure, the similarities are decided by the exemplar-based classifiers through the multiple instance learning, in which a positive (or negative) video or image set is deemed as a positive (or negative) action bag and those frames similar to the given exemplar in Euclidean Space as action instances. Third, we formulate the selection of the most discriminative exemplars into a boosted feature selection framework and simultaneously obtain an action bag-based detector. Experimental results on two publicly available datasets: the KTH dataset and Weizmann dataset, demonstrate the validity and effectiveness of the proposed approach for action recognition. We also apply BEL to learn representations of actions by using images collected from the Web and use this knowledge to automatically annotate action in YouTube videos. Results are very impressive, which proves that the proposed algorithm is also practical in unconstraint environments. [ABSTRACT FROM AUTHOR]

Minimization of total variation (TV) is a well-known method for image denoising. Recently, the relationship between TV minimization problems and binary MRF models has been much explored. This has resulted in some very efficient combinatorial optimization algorithms for the TV minimization problem in the discrete setting via graph cuts. To overcome limitations, such as staircasing effects, of the relatively simple TV model, variational models based upon higher order derivatives have been proposed. The Euler's elastica model is one such higher order model of central importance, which minimizes the curvature of all level lines in the image. Traditional numerical methods for minimizing the energy in such higher order models are complicated and computationally complex. In this paper, we will present an efficient minimization algorithm based upon graph cuts for minimizing the energy in the Euler's elastica model, by simplifying the problem to that of solving a sequence of easy graph representable problems. This sequence has connections to the gradient flow of the energy function, and converges to a minimum point. The numerical experiments show that our new approach is more effective in maintaining smooth visual results while preserving sharp features better than TV models. [ABSTRACT FROM PUBLISHER]

Multistate systems (MSS) are systems in which the system and its components are characterized by multiple states or performance levels. Component importance or sensitivity analysis facilitates the identification of vulnerabilities within the system, and aids in the quantification of criticalities of the system components. Multistate component importance analysis poses unique challenges to existing methods that are primarily based on binary-state applications. This paper presents an analytical method based on multistate multivalued decision diagrams (MMDD) for multistate component importance analysis. The contribution of this work is two-fold: 1) a novel, efficient algorithm for directly generating an MMDD model from multistate capacity network specifications without inefficient enumeration of multistate minimal path or cut vectors; and 2) an efficient, exact MMDD-based approach for evaluating MSS reliability and importance measures. The advantages of the proposed method are illustrated through a comparison with existing methods, and through detailed analyses of three case studies. [ABSTRACT FROM AUTHOR]

From the perspective of the Bayesian approach, the denoising problem is essentially a prior probability modeling and estimation task. In this paper, we propose an approach that exploits a hidden Bayesian network, constructed from wavelet coefficients, to model the prior probability of the original image. Then, we use the belief propagation (BP) algorithm, which estimates a coefficient based on all the coefficients of an image, as the maximum-a-posterior (MAP) estimator to derive the denoised wavelet coefficients. We show that if the network is a spanning tree, the standard BP algorithm can perform MAP estimation efficiently. Our experiment results demonstrate that, in terms of the peak-signal-to-noise-ratio and perceptual quality, the proposed approach outperforms state-of-the-art algorithms on several images, particularly in the textured regions, with various amounts of white Gaussian noise. [ABSTRACT FROM PUBLISHER]

This paper presents a novel approach to automatic face modeling for realistic synthesis from an unknown face image, using a probabilistic face diffuse model and a generic face specular map. We construct a probabilistic face diffuse model for estimating the albedo and normals of the input face. Then, we develop a generic face specular map for estimating the specularity of face. Using the estimated albedo, normal, and specular information, we can synthesize the face under arbitrary lighting and viewing directions realistically. Unlike many existing techniques, our approach can extract both the diffuse and specular information of face without involving an intensive 3-D matching procedure. We conduct three different experiments to show our improvement over the prior art. First, we compare the proposed algorithm with previous techniques, including the state of the art, to demonstrate our achievement in realistic face synthesis. Moreover, we evaluate the proposed algorithm over nonautomatic face modeling techniques through a subjective user study. This evaluation is meaningful in that it tells us how far our results as well as others are from the real photograph in terms of the perceptual quality. Finally, we apply our face model for improving the face recognition performance under varying illumination conditions and show that the proposed algorithm is effective in enhancing the face recognition rate. Thanks to the compact representation and the effective inference scheme, our technique is applicable for many practical applications, such as avatar creation, digital face cloning, face normalization, de-identification and many others. [ABSTRACT FROM AUTHOR]

Speckles (multiplicative noise) in synthetic aperture radar (SAR) make it difficult to interpret the observed image. Due to the edge-preserving feature of total variation (TV), variational models with TV regularization have attracted much interest in reducing speckles. Algorithms based on the augmented Lagrangian function have been proposed to efficiently solve speckle-reduction variational models with TV regularization. However, these algorithms require inner iterations or inverses involving the Laplacian operator at each iteration. In this paper, we adapt Tseng's alternating minimization algorithm with a shifting technique to efficiently remove the speckle without any inner iterations or inverses involving the Laplacian operator. The proposed method is very simple and highly parallelizable; therefore, it is very efficient to despeckle huge-size SAR images. Numerical results show that our proposed method outperforms the state-of-the-art algorithms for speckle-reduction variational models with a TV regularizer in terms of central-processing-unit time. [ABSTRACT FROM AUTHOR]

Multiplicative noise removal based on total variation (TV) regularization has been widely researched in image science. In this paper, inspired by the spatially adapted methods for denoising Gaussian noise, we develop a variational model, which combines the TV regularizer with local constraints. It is also related to a TV model with spatially adapted regularization parameters. The automated selection of the regularization parameters is based on the local statistical characteristics of some random variable. The corresponding subproblem can be efficiently solved by the augmented Lagrangian method. Numerical examples demonstrate that the proposed algorithm is able to preserve small image details, whereas the noise in the homogeneous regions is sufficiently removed. As a consequence, our method yields better denoised results than those of the current state-of-the-art methods with respect to the signal-to-noise-ratio values. [ABSTRACT FROM AUTHOR]

Groupwise nonrigid image registration is a powerful tool to automatically establish correspondences across sets of images. Such correspondences are widely used for constructing statistical models of shape and appearance. As existing techniques usually treat registration as an optimization problem, a good initialization is required. Although the standard initialization—affine transformation—generally works well, it is often inadequate when registering images of complex structures. In this paper we present a more sophisticated method that uses the sparse matches of a parts+geometry model as the initialization. We show that both the model and its matches can be automatically obtained, and that the matches are able to effectively initialize a groupwise nonrigid registration algorithm, leading to accurate dense correspondences. We also show that the dense mesh models constructed during the groupwise registration process can be used to accurately annotate new images. We demonstrate the efficacy of the approach on three datasets of increasing difficulty, and report on a detailed quantitative evaluation of its performance. [ABSTRACT FROM PUBLISHER]

The discrete complex image method (DCIM) has been well-established and widely employed as a tool to compute spatial-domain Green's functions in planar multilayered media. Although the use of the DCIM in conjunction with the method of moments has been quite satisfactory for the efficient analysis of printed structures in layered media, it has not been considered much as a legitimate tool for commercial applications. Up until recently, there has been mainly two reasons for the reluctance of its acceptance in commercial products: the lack of a proper error criterion in the spatial domain and the manual selection of the order of images. As the former shortcoming has recently been eliminated by establishing a proper error criterion in the spatial domain, this paper intends to propose a viable solution for the latter problem, i.e., for the choice of the number of images. Note that, thus far, this choice has been based on the number of significant singular values obtained as a by-product of the method, which is neither rigorous, nor optimum in any sense, and renders it nonrobust and unreliable. As a remedy for this remaining shortcoming, a model selection approach known as minimum description length (MDL) has been introduced into the algorithm of the DCIM with success. The MDL approach, exploiting the regularities in the data, selects the order of the model based on the tradeoff between the quality of fitting and complexity of the model. [ABSTRACT FROM AUTHOR]

Reliably detecting objects in broad-area overhead or satellite images has become an increasingly pressing need, as the capabilities for image acquisition are growing rapidly. The problem is particularly difficult in the presence of large intraclass variability, e.g., finding “boats” or “buildings,” where model-based approaches tend to fail because no good model or template can be defined for the highly variable targets. This paper explores an automatic approach to detect and classify targets in high-resolution broad-area satellite images, which relies on detecting statistical signatures of targets, in terms of a set of biologically-inspired low-level visual features. Broad-area images are cut into small image chips, analyzed in two complementary ways: “attention/saliency” analysis exploits local features and their interactions across space, while “gist” analysis focuses on global nonspatial features and their statistics. Both feature sets are used to classify each chip as containing target(s) or not, using a support vector machine. Four experiments were performed to find “boats” (Experiments 1 and 2), “buildings” (Experiment 3) and “airplanes” (Experiment 4). In experiment 1, 14 416 image chips were randomly divided into training (300 boat, 300 nonboat) and test sets (13 816), and classification was performed on the test set (ROC area: 0.977 \pm 0.003). In experiment 2, classification was performed on another test set of 11 385 chips from another broad-area image, keeping the same training set as in experiment 1 (ROC area: 0.952 \pm 0.006). In experiment 3, 600 training chips (300 for each type) were randomly selected from 108 885 chips, and classification was conducted (ROC area: 0.922 \pm 0.005). In experiment 4, 20 training chips (10 for each type) were randomly selected to classify the remaining 2581 chips (ROC area: 0.976 \pm 0.003). The proposed algorithm outperformed the state-of-the-art SIFT, HMAX, and hidden-scale salient structure methods, and previous gist-only features in all four experiments. This study shows that the proposed target search method can reliably and effectively detect highly variable target objects in large image datasets. [ABSTRACT FROM AUTHOR]

A new algorithm was developed, which reduces the self-force in particle-in-cell codes on unstructured meshes in a predictable and controllable way. This is accomplished by computing a charge density weighting function for a particle, which reproduces the Green's function solution to Poisson's equation at nodes when using a standard finite element method methodology. This provides a superior local potential and allows for particle–particle particle-mesh techniques to be used to subtract off local force contributions, including fictitious self-forces resulting in accurate long-range forces on a particle and improved local Coulomb collisions. Local physical forces are then computed using the Green's function on local particle pairs and added to the long-range forces. Results were shown with up to five orders reduction in self-force and superior intraparticle forces for two test cases. [ABSTRACT FROM PUBLISHER]

We present the first ratio-based image segmentation method that allows imposing curvature regularity of the region boundary. Our approach is a generalization of the ratio framework pioneered by Jermyn and Ishikawa so as to allow penalty functions that take into account the local curvature of the curve. The key idea is to cast the segmentation problem as one of finding cyclic paths of minimal ratio in a graph where each graph node represents a line segment. Among ratios whose discrete counterparts can be globally minimized with our approach, we focus in particular on the elastic ratio $ \displaystyle\int_0^\cal L(C)\nabla I(C(s))\cdot(C^\prime(s))^\perp\, ds\over \displaystyle \nu\, \cal L(C)+\int_0^\cal L(C)\vert \kappa_C(s)\vert ^q\,ds $that depends, given an image I, on the oriented boundary C of the segmented region candidate. Minimizing this ratio amounts to finding a curve, neither small nor too curvy, through which the brightness flux is maximal. We prove the existence of minimizers for this criterion among continuous curves with mild regularity assumptions. We also prove that the discrete minimizers provided by our graph-based algorithm converge, as the resolution increases, to continuous minimizers. In contrast to most existing segmentation methods with computable and meaningful, i.e., nondegenerate, global optima, the proposed approach is fully unsupervised in the sense that it does not require any kind of user input such as seed nodes. Numerical experiments demonstrate that curvature regularity allows substantial improvement of the quality of segmentations. Furthermore, our results allow drawing conclusions about global optima of a parameterization-independent version of the snakes functional: the proposed algorithm allows determining parameter values where the functional has a meaningful solution and simultaneously provides the corresponding global solution. [ABSTRACT FROM PUBLISHER]

Conventional linear subspace learning methods like principal component analysis (PCA), linear discriminant analysis (LDA) derive subspaces from the whole data set. These approaches have limitations in the sense that they are linear while the data distribution we are trying to model is typically nonlinear. Moreover, these algorithms fail to incorporate local variations of the intrinsic sample distribution manifold. Therefore, these algorithms are ineffective when applied on large scale datasets. Kernel versions of these approaches can alleviate the problem to certain degree but face a serious computational challenge when data set is large, where the computing involves Eigen/QP problems of size N\,\times\,N. When N is large, kernel versions are not computationally practical. To tackle the aforementioned problems and improve recognition/searching performance, especially on large scale image datasets, we propose a novel local subspace indexing model for image search termed Subspace Indexing Model on Grassmann Manifold (SIM-GM). SIM-GM partitions the global space into local patches with a hierarchical structure; the global model is, therefore, approximated by piece-wise linear local subspace models. By further applying the Grassmann manifold distance, SIM-GM is able to organize localized models into a hierarchy of indexed structure, and allow fast query selection of the optimal ones for classification. Our proposed SIM-GM enjoys a number of merits: 1) it is able to deal with a large number of training samples efficiently; 2) it is a query-driven approach, i.e., it is able to return an effective local space model, so the recognition performance could be significantly improved; 3) it is a common framework, which can incorporate many learning algorithms. Theoretical analysis and extensive experimental results confirm the validity of this model. [ABSTRACT FROM PUBLISHER]

A second-order wave equation-based implicit discontinuous Galerkin time-domain (DGTD) method is proposed to efficiently model electrically small problems. The proposed method employs the second-order wave equation for electric field (or magnetic field) as the governing equation of the DG formulation, instead of the first-order Maxwell’s curl equations. A modified version of the Riemann solver (upwind flux) is introduced to evaluate the numerical flux resulting from the weak form of the wave equation. Compared with previous first-order Maxwell’s curl equation-based implicit DGTD methods, which typically solve all electric and magnetic field unknowns for each subdomain, the proposed method only needs to solve for the electric field unknowns plus the surface magnetic field unknowns at subdomain interfaces. This reduces the dimensions of the resultant linear system and thus allows for modeling larger problems. Furthermore, unlike element-based DGTD methods, the proposed method is subdomain-based. The computational region is divided into multiple subdomains based on the domain-decomposition method, and each subdomain may contain multiple elements. Different element types and orders of basis functions can be employed in different subdomains to exploit the geometry property of the model. A nonconformal mesh is allowed between different subdomains to increase meshing flexibility. The Newmark-beta time-integration scheme is used for implicit temporal discretization, and fast direct linear solvers, such as the lower-diagonal-upper decomposition algorithm, are employed to accelerate time integration when all the subdomains are in a sequential order. Numerical results show that the proposed method is more efficient in terms of CPU time, and also saves memory with respect to the previous implicit DGTD method when modeling electrically small problems. [ABSTRACT FROM PUBLISHER]

An efficient algorithm without flux correction for the simulation of corona discharges is proposed. The algorithm referred to as the position-state separation (POSS) method is used to solve convection-dominated continuity equations commonly present in corona discharges modeling. The proposed solution method combines an Eulerian scheme for the solution of the convective acceleration, the diffusion and the reaction subproblems, and a Lagrangian scheme for the solution of the linear convection subproblem. Several classical numerical experiments in different dimensions and coordinate systems are conducted to demonstrate the excellent performance of POSS regarding low computational cost, robustness, and high resolution. It is shown that the time complexity of the method when dealing with the convection of charged particles increases linearly with the number of unknowns. For the simulation of corona discharges where local electric fields do not change strongly in time, the time step of POSS could be much larger than the Courant–Friedrichs–Lewy time step. These special features enable POSS to have great potential in the modeling of corona discharges in long interelectrode gaps and for long simulation times. [ABSTRACT FROM AUTHOR]

A nonlinear model predictive control strategy is presented for unmanned aerial vehicle (UAV) trajectory determination. The objective is to find optimal paths in the atmosphere by maximizing the UAV?s energy (kinetic and potential) over a finite but receding horizon. The main assumption is that the updraft distribution is unknown, creating a realistic situation. The updrafts are only estimated online using standard on-board inertial sensors. Real-time implementation of the algorithm is shown to be possible in principle. [ABSTRACT FROM AUTHOR]

We investigate whether it is possible to use the bidomain model and body surface potential maps (BSPMs) to compute the size and position of ischemic regions in the human heart. This leads to a severely ill posed inverse problem for a potential equation. We do not use the classical inverse problems of electrocardiography, in which the unknown sources are the epicardial potential distribution or the activation sequence. Instead we employ the bidomain theory to obtain a model that also enables identification of ischemic regions transmurally. This approach makes it possible to distinguish between subendocardial and transmural cases, only using the BSPM data. The main focus is on testing a previously published algorithm on clinical data, and the results are compared with images taken with perfusion scintigraphy. For the four patients involved in this study, the two modalities produce results that are rather similar: The relative differences between the center of mass and the size of the ischemic regions, suggested by the two modalities, are 10.8% \pm 4.4% and 7.1% \pm 4.6%, respectively. We also present some simulations which indicate that the methodology is robust with respect to uncertainties in important model parameters. However, in contrast to what has been observed in investigations only involving synthetic data, inequality constraints are needed to obtain sound results. [ABSTRACT FROM AUTHOR]

Existing approaches to image reconstruction in photoacoustic computed tomography (PACT) with acoustically heterogeneous media are limited to weakly varying media, are computationally burdensome, and/or cannot effectively mitigate the effects of measurement data incompleteness and noise. In this work, we develop and investigate a discrete imaging model for PACT that is based on the exact photoacoustic (PA) wave equation and facilitates the circumvention of these limitations. A key contribution of the work is the establishment of a procedure to implement a matched forward and backprojection operator pair associated with the discrete imaging model, which permits application of a wide-range of modern image reconstruction algorithms that can mitigate the effects of data incompleteness and noise. The forward and backprojection operators are based on the k-space pseudospectral method for computing numerical solutions to the PA wave equation in the time domain. The developed reconstruction methodology is investigated by use of both computer-simulated and experimental PACT measurement data. [ABSTRACT FROM AUTHOR]

Consistent, continuous, and long time series of global biophysical variables derived from satellite data are required for global change research. A novel climatology fitting approach called CACAO (Consistent Adjustment of the Climatology to Actual Observations) is proposed to reduce noise and fill gaps in time series by scaling and shifting the seasonal climatological patterns to the actual observations. The shift and scale CACAO parameters adjusted for each season allow quantifying shifts in the timing of seasonal phenology and inter-annual variations in magnitude as compared to the average climatology. CACAO was assessed first over simulated daily Leaf Area Index (LAI) time series with varying fractions of missing data and noise. Then, performances were analyzed over actual satellite LAI products derived from AVHRR Long-Term Data Record for the 1981–2000 period over the BELMANIP2 globally representative sample of sites. Comparison with two widely used temporal filtering methods—the asymmetric Gaussian (AG) model and the Savitzky-Golay (SG) filter as implemented in TIMESAT—revealed that CACAO achieved better performances for smoothing AVHRR time series characterized by high level of noise and frequent missing observations. The resulting smoothed time series captures well the vegetation dynamics and shows no gaps as compared to the 50–60\% of still missing data after AG or SG reconstructions. Results of simulation experiments as well as confrontation with actual AVHRR time series indicate that the proposed CACAO method is more robust to noise and missing data than AG and SG methods for phenology extraction. [ABSTRACT FROM PUBLISHER]

We present and analyze the behavior of an evolutionary algorithm designed to estimate the parameters of a complex organ behavior model. The model is adaptable to account for patient’s specificities. The aim is to finely tune the model to be accurately adapted to various real patient datasets. It can then be embedded, for example, in high fidelity simulations of the human physiology. We present here an application focused on respiration modeling. The algorithm is automatic and adaptive. A compound fitness function has been designed to take into account for various quantities that have to be minimized. The algorithm efficiency is experimentally analyzed on several real test cases: 1) three patient datasets have been acquired with the “breath hold” protocol, and 2) two datasets corresponds to 4-D CT scans. Its performance is compared with two traditional methods (downhill simplex and conjugate gradient descent): a random search and a basic real-valued genetic algorithm. The results show that our evolutionary scheme provides more significantly stable and accurate results. [ABSTRACT FROM PUBLISHER]

A SPICE lumped circuit subcell model is formulated within the discontinuous Galerkin finite-element time-domain (DGFETD) discretization of Maxwell's equations. A fourth-order exponential time difference (ETD) algorithm is used for circuits that lead to stiff systems. The ETD method reduces to a standard fourth-order Runge–Kutta (RK4) time-integration for nonstiff regions. A number of test cases, including a microstrip transmission line terminated with general RLC networks, load arrays, and a diode detector are presented for the validation of the proposed hybrid DGFETD/SPICE solution method. [ABSTRACT FROM PUBLISHER]

When dealing with motion blur, there is an inevitable tradeoff between the amount of blur and the amount of noise in the acquired images. The effectiveness of any restoration algorithm typically depends on these amounts, and it is difficult to find their best balance in order to ease the restoration task. To face this problem, we provide a methodology for deriving a statistical model of the restoration performance of a given deblurring algorithm in case of arbitrary motion. Each restoration-error model allows us to investigate how the restoration performance of the corresponding algorithm varies as the blur due to motion develops. Our modeling treats the point-spread-function trajectories as random processes and, following a Monte Carlo approach, expresses the restoration performance as the expectation of the restoration error conditioned on some motion-randomness descriptors and on the exposure time. This allows us to coherently encompass various imaging scenarios, including camera shake and uniform (rectilinear) motion, and, for each of these, identify the specific exposure time that maximizes the image quality after deblurring. [ABSTRACT FROM AUTHOR]

We develop an efficient general-purpose blind/no-reference image quality assessment (IQA) algorithm using a natural scene statistics (NSS) model of discrete cosine transform (DCT) coefficients. The algorithm is computationally appealing, given the availability of platforms optimized for DCT computation. The approach relies on a simple Bayesian inference model to predict image quality scores given certain extracted features. The features are based on an NSS model of the image DCT coefficients. The estimated parameters of the model are utilized to form features that are indicative of perceptual quality. These features are used in a simple Bayesian inference approach to predict quality scores. The resulting algorithm, which we name BLIINDS-II, requires minimal training and adopts a simple probabilistic model for score prediction. Given the extracted features from a test image, the quality score that maximizes the probability of the empirically determined inference model is chosen as the predicted quality score of that image. When tested on the LIVE IQA database, BLIINDS-II is shown to correlate highly with human judgments of quality, at a level that is competitive with the popular SSIM index. [ABSTRACT FROM AUTHOR]

Detection of salient motion in a video involves determining which motion is attended to by the human visual system in the presence of background motion that consists of complex visuals that are constantly changing. Salient motion is marked by its predictability compared to the more complex unpredictable motion of the background such as fluttering of leaves, ripples in water, dispersion of smoke, and others. We introduce a novel approach to detect salient motion based on the concept of “observability” from the output pixels, when the video sequence is represented as a linear dynamical system. The group of output pixels with maximum saliency is further used to model the holistic dynamics of the salient region. The pixel saliency map is bolstered by two region-based saliency maps, which are computed based on the similarity of dynamics of the different spatiotemporal patches in the video with the salient region dynamics, in a global as well as a local sense. The resulting algorithm is tested on a set of challenging sequences and compared to state-of-the-art methods to showcase its superior performance on grounds of its computational efficiency and ability to detect salient motion. [ABSTRACT FROM PUBLISHER]

We compare the performance of three algorithms for production planning with workload-dependent lead times. These include a clearing function model using two different methods for estimating the clearing functions, and two iterative algorithms that combine linear programming and simulation models. Our experimental comparison uses a simulation model of a re-entrant bottleneck system built with attributes of a real-world semiconductor fabrication environment. We vary the bottleneck utilization, demand patterns, the mean time to failure, and the mean time to repair. Results indicate that the clearing function model performs better than the iterative algorithms on the scaled-down system considered, giving less variable production plans and higher profit values. [ABSTRACT FROM PUBLISHER]

Quantitative methods such as model-based predictive control are known to facilitate the design of strategies to manipulate biological systems. This study develops a sparse-grid-based adaptive model predictive control (MPC) strategy to direct HL60 cellular differentiation. Sparse-grid sampling and interpolation support a computationally efficient adaptive MPC scheme in which multiple data-consistent regions of the model parameter space are identified and used to calculate a control compromise. The algorithm is evaluated in silico with structural model mismatch. Simulations demonstrate how the multiscenario control strategy more effectively manages the mismatch compared to a single scenario approach. Furthermore, the controller is evaluated in vitro to differentiate HL60 cells in both normal and perturbed environments. The controller-derived input sequence successfully achieves and sustains the specified target level of granulocytes when implemented in the laboratory. The results and analysis given here imply that adoption of this experiment planning technique to direct cell differentiation within more complex tissue engineered constructs will require the use of a reasonably accurate mathematical model and an extension of this algorithm to multiobjective controller design. [ABSTRACT FROM PUBLISHER]

An implementation of the inverse vector Jiles-Atherton model for the solution of non-linear hysteretic finite element problems is presented. The implementation applies the fixed point method with differential reluctivity values obtained from the Jiles-Atherton model. Differential reluctivities are usually computed using numerical differentiation, which is ill-posed and amplifies small perturbations causing large sudden increases or decreases of differential reluctivity values, which may cause numerical problems. A rule based algorithm for conditioning differential reluctivity values is presented. Unwanted perturbations on the computed differential reluctivity values are eliminated or reduced with the aim to guarantee convergence. Details of the algorithm are presented together with an evaluation of the algorithm by a numerical example. The algorithm is shown to guarantee convergence, although the rate of convergence depends on the choice of algorithm parameters. [ABSTRACT FROM AUTHOR]

Continuously shrinking feature sizes result in an increasing susceptibility of circuits to transient faults, e.g., due to environmental radiation. Approaches to implement fault tolerance are known. But assessing the fault tolerance of a given implementation is a hard verification problem. Here, we propose the use of formal methods to assess the robustness of a digital circuit with respect to transient faults. Our formal model uses a fixed bound in time and exploits fault detection circuitry to cope with the complexity of the underlying sequential equivalence check. As a result, a lower and an upper bound on the robustness are returned together with vulnerable components. The underlying algorithm and techniques to improve the efficiency are presented. In experiments, we evaluate the method on circuits with different fault detection mechanisms. [ABSTRACT FROM PUBLISHER]

A new ray-tracing method in 3-D heterogeneous isotropic media is proposed based on the bilinear travel-time interpolation and wavefront group marching method (GMM). In this method, an irregular cell discretization scheme is used to accurately describe arbitrarily undulant interfaces in a model. The ray tracing is carried out by forward–backward processing. In the forward step, the travel time in an irregular cell is expressed in terms of the bilinear interpolation of the known travel times on the cell's surfaces. Then, the wavefront is evolved from the source to the whole computational domain by using the newly developed travel-time solver and the fast wavefront expansion GMM. In the backward step, each ray path is traced from the receiver by finding the intersection points of potential ray propagation vectors with the surfaces of the relevant cells. The same travel-time solver is used to compute the candidate intersection points on all surfaces of each relevant cell, and the point with the minimum travel time is selected as a ray point from which the similar step is continued until the sources are found. Several numerical experiments are presented to demonstrate that the new algorithm is accurate, efficient, and robust. [ABSTRACT FROM AUTHOR]