In this position paper we examine the limitation of region growing segmentation techniques to extract semantically meaningful objects from an image. We propose a region growing algorithm that performs on a semantic level, driven by the knowledge of what each region represents at every iteration step of the merging process. This approach utilizes simultaneous segmentation and labeling of regions...

We apply a Runge-Kutta-based waveform relaxation method to initial-value problems for implicit differential equations. In the implementation of such methods, a sequence of nonlinear systems has to be solved iteratively in each step of the integration process. The size of these systems increases linearly with the number of stages of the underlying Runge-Kutta method, resulting in high linear alg...

Asynchronous events sequences are widely distributed in the natural world and human activities, such as earthquakes records, users’ activities social media, so on. How to distill information from these seemingly disorganized data is a persistent topic that researchers focus One of most useful models point process model, on basis, obtain many noticeable results. Moreover, recent years, foundatio...

We present an improved version of an infeasible interior-point method for linear optimization published in 2006. In the earlier version each iteration consisted of one so-called feasibility step and a few – at most three – centering steps. In this paper each iteration consists of only a feasibility step, whereas the iteration bound improves the earlier bound by a factor 2 √ 2. The improvements ...

In this paper, we use a one-step iteration scheme to approximate common fixed points of two quasi-asymptotically nonexpansive mappings. We prove weak and strong convergence theorems in a uniformly convex Banach space. Our results generalize the corresponding results of Yao and Chen [15] to a wider class of mappings while extend those of Khan, Abbas and Khan [4] to an improved one-step iteration...

A reliable technique for deductive program verification should be proven sound with respect to the semantics of programming language. For each different language, construction a separate soundness proof is often laborious undertaking. In language-independent verification, common aspects computer programs are addressed enable reasoning all languages. this work, we propose solution about iteratio...