This article addresses the image denoising problem in the situations of strong noise. We propose a dual sparse decomposition method. This method makes a sub-dictionary decomposition on the over-complete dictionary in the sparse decomposition. The sub-dictionary decomposition makes use of a novel criterion based on the occurrence frequency of atoms of the over-complete dictionary over the data s...

We propose a sub-structural niching method that fully exploits the problem decomposition capability of linkagelearning methods such as the estimation distribution algorithms and concentrate on maintaining diversity at the sub-structural level. The proposed method consists of three key components: (1) Problem decomposition and sub-structure identification, (2) sub-structure fitness estimation, a...

This article first proposed a Bipartite Request Dependency Graph (BRDG) that describes the object-level interrelationships between user click requests and embedded web object requests. These two kinds of requests are classified from HTTP data by an identification algorithm. The interrelationships between user click requests and embedded web object reflect the web page structural, which contain ...

Although traditional signal-based structural health monitoring algorithms have been successfully employed for small structures, their application for large and complex bridges has been challenging due to non-stationary signal characteristics with a high level of noise. In this paper, a promising damage detection algorithm is proposed by incorporation of adaptive signal processing and Artificial...

Tree projections provide a mathematical framework that encompasses all the various (purely) structural decomposition methods that have been proposed in the literature to single out classes of nearly-acyclic (hyper)graphs, such as the tree decomposition method, which is the most powerful decomposition method on graphs, and the (generalized) hypertree decomposition method, which is its natural co...

Real software rarely conforms to one single view of the program structure; instead, software is sufficiently complex that the structure of the program is best understood as a collection of orthogonal divisions of the program into components. However, most software tools only recognize the decomposition of the program into source files, forcing the programmer to adopt one primary program decompo...

In this paper we derive a generic form of structural decomposition for the constraint satisfaction problem, which we call a guarded decomposition. We show that many existing decomposition methods can be characterised in terms of finding guarded decompositions satisfying certain specified additional conditions. Using the guarded decomposition framework we are also able to define a new form of de...