A progressive image compression scheme is investigated using reversible integer discrete cosine transform (RDCT) which is derived from the matrix factorization theory. Previous techniques based on DCT suffer from bad ...
详细信息
A progressive image compression scheme is investigated using reversible integer discrete cosine transform (RDCT) which is derived from the matrix factorization theory. Previous techniques based on DCT suffer from bad performance in lossy image compression compared with wavelet image codec. And lossless compression methods such as IntDCT, I2I-DCT and so on could not compare with JPEG-LS or integer discrete wavelet transform (DWT) based codec. In this paper, lossy to lossless image compression can be implemented by our proposed scheme which consists of RDCT, coefficients reorganization, bit plane encoding, and reversible integer pre- and post-filters. Simulation results show that our method is competitive against JPEG-LS and JPEG2000 in lossless compression. Moreover, our method outperforms JPEG2000 (reversible 5/3 filter) for lossy compression, and the performance is even comparable with JPEG2000 which adopted irreversible 9/7 floating-point filter (9/7F filter).
Based on the theory of clonal selection in immunology, by introducing Baldwin effect, an improved clonal selection algorithm, termed as Baldwin clonal selection algorithm (BCSA), is proposed to solve the optimal appro...
详细信息
Based on the theory of clonal selection in immunology, by introducing Baldwin effect, an improved clonal selection algorithm, termed as Baldwin clonal selection algorithm (BCSA), is proposed to solve the optimal approximation of linear systems. For engineering computing, the novel algorithm adopts three operations to evolve and improve the population: clonal proliferation operation, Baldwinian learning operation and clonal selection operation. The experimental study on the optimal approximation of a stable linear system and an unstable one show that the approximate models searched by the new algorithm have better performance indices than those obtained by some existing algorithms including the differential evolution algorithm, multi-agent genetic algorithm and artificial immune response algorithm.
In this paper, we introduce Lamarckian learning theory into the clonal selection algorithm and propose a sort of Lamarckian clonal selection algorithm, termed as LCSA. The major aim is to utilize effectively the infor...
详细信息
In this paper, we introduce Lamarckian learning theory into the clonal selection algorithm and propose a sort of Lamarckian clonal selection algorithm, termed as LCSA. The major aim is to utilize effectively the information of each individual to reinforce the exploitation with the help of Lamarckian local search. Recombination operator and tournament selection operator are incorporated into LCSA to further enhance the ability of global exploration. We compared LCSA with the clonal selection algorithm (CSA) in solving twenty benchmark problems to test the performance of LCSA. The results demonstrate that LCSA is effective and efficient in solving numerical optimization problems.
This paper aims at the combination of the artificial immune network and the support vector domain description for clustering. A new artificial immune antibody network is proposed. In the network, the antibody neighbor...
详细信息
This paper aims at the combination of the artificial immune network and the support vector domain description for clustering. A new artificial immune antibody network is proposed. In the network, the antibody neighborhood is represented as a support vector hypersphere, and an adaptive learning coefficient is presented. The input data set is firstly divided into subsets by antibodies, then each subset is mapped into a hypersphere respectively in a high dimensional feature space by support vector domain description. Finally the clustering results of the local support vector hyperspheres are combined to yield a global clustering solution by the minimal spanning tree, which need not a predefined number of clustering. The experimental results with several data sets illustrate the effectiveness of the proposed algorithm.
On visual tracking, a particle filter algorithm was presented to track a moving target under clutter environment which can deal with rotation, scale changes, variations in the light source and partial occlusions. So i...
详细信息
On visual tracking, a particle filter algorithm was presented to track a moving target under clutter environment which can deal with rotation, scale changes, variations in the light source and partial occlusions. So it can track the target with robustness. The proposed method was based on particle filter, integrated with color histogram in the measurement model, and the system model was second order autoregressive process. The algorithm took into account the latest observations and the tracked target can be rigid or non-rigid. Also the method can run in real-time. The experimental results confirm that the method is effective even when the monocular camera is moving and the target object is partially occluded in a clutter background.
This paper provided a mathematic model for Three Gorges-Gezhou dam co-scheduling problems, based on full analysis of Three Gorges-Gezhou dam's actual needs, to maximize the total throughput of Three Gorges-Gezhou ...
详细信息
This paper provided a mathematic model for Three Gorges-Gezhou dam co-scheduling problems, based on full analysis of Three Gorges-Gezhou dam's actual needs, to maximize the total throughput of Three Gorges-Gezhou dam, to maximize the utilization ratio of shiplock area and minimize the total navigation shiplock waiting time under eight constraint conditions. Then a scheduling algorithm based on GA was pointed out. The three gorges south lock, Gezhou dam lock, the three gorges north lock were optimization searched separately in the GA algorithm. The scheduling results of the three gorges south lock were taken as the origin of the whole plan period, and also were taken as the basis of the Gezhou dam scheduling together with the ship applied information. The scheduling results of Gezhou dam were regarded as the basis of the three gorges north lock scheduling together with the ship applied information, so repeated, until the optimal scheduling results were given, or the most iterative step was reached. The applied result shows that making a period plan of two dam five lock only needs 2 minutes, and the plan is quite effective according to practical application.
This paper presents a sliding-mode-based diagonal recurrent cerebellar model articulation controller (SDRCMAC) for multiple-input-multiple-output (MIMO) uncertain nonlinear systems. Sliding mode technology is used to ...
This paper presents a sliding-mode-based diagonal recurrent cerebellar model articulation controller (SDRCMAC) for multiple-input-multiple-output (MIMO) uncertain nonlinear systems. Sliding mode technology is used to reduce the dimension of the control system. Two learning stages are adopted to train the SDRCMAC and to improve the stability of the control system. Lyapunov stability theorem and Barbalat's lemma are adopted to guarantee the asymptotical stability of the system. Performance is illustrated on a two-link robotic control and motor control of the human arm in the sagittal plane.
Multiobjective evolutionary clustering approach has been successfully utilized in data clustering. In this paper, we propose a novel unsupervised machine learning algorithm namely multiobjective evolutionary clusterin...
详细信息
Multiobjective evolutionary clustering approach has been successfully utilized in data clustering. In this paper, we propose a novel unsupervised machine learning algorithm namely multiobjective evolutionary clustering ensemble algorithm (MECEA) to perform the texture image segmentation. MECEA comprises two main phases. In the first phase, MECEA uses a multiobjective evolutionary clustering algorithm to optimize two complementary clustering objectives: one based on compactness in the same cluster, and the other based on connectedness of different clusters. The output of the first phase is a set of Pareto solutions, which correspond to different tradeoffs between two clustering objectives, and different numbers of clusters. In the second phase, we make use of the meta-clustering algorithm (MCLA) to combine all the Pareto solutions to get the final segmentation. The segmentation results are evaluated by comparing with three known algorithms: K-means, fuzzy K-means (FCM), and evolutionary clustering algorithm (ECA). It is shown that MECEA is an adaptive clustering algorithm, which outperforms the three algorithms in the experiments we carried out.
We consider the problem of looking for small universal spiking neural P systems with exhaustive use of rules, which was formulated as an open problem by Gheorghe Paun in a survey paper. Here, spiking neural P systems ...
详细信息
We consider the problem of looking for small universal spiking neural P systems with exhaustive use of rules, which was formulated as an open problem by Gheorghe Paun in a survey paper. Here, spiking neural P systems are used in two versions: as devices computing functions and as devices generating sets of numbers, with two ways of encoding the result of a computation. As devices of computing functions, if we associate the result with the distance between the first two spikes emitted by the output neuron, we produce a universal computing spiking neural P system with exhaustive use of rules (without delay) having 125 neurons; if we introduce the usual way of defining the result of a computation in membrane systems to encode the result, namely, the number of spikes emitted during a computation, then a universal computing system (without delay) with 126 neurons is also obtained in the sense of the exhaustive use of rules. For spiking neural P systems used as generators of sets of numbers, we construct a universal system (without delay) by using 128 neurons under the first way of defining the computation result, and a system (without delay) by using 127 neurons under the second way of defining the computation result.
Several neutrosophic combination rules based on the Dempster-Shafer theory (DST) and Dezert-Smarandache theory (DSmT) are presented in this study. The new information fusing approaches proposed the neutrosophic belief...
详细信息
暂无评论