Approximation learning methods of Harmonic Mappings in relation to Hardy Spaces

A new Hardy space Hardy space approach of Dirichlet type problem based on Tikhonov regularization and Reproducing Hilbert kernel space is discussed in this paper, which turns out to be a typical extremal problem located on the upper upper-high complex plane. If considering this in the Hardy space, the optimization operator of this problem will be highly simplified and an efficient algorithm is possible. This is mainly realized by the help of reproducing properties of the functions in the Hardy space of upper-high complex plane, and the detail algorithm is proposed. Moreover, harmonic mappings, which is a significant geometric transformation, are commonly used in many applications such as image processing, since it describes the energy minimization mappings between individual manifolds. Particularly, when we focus on the planer mappings between two Euclid planer regions, the harmonic mappings are exist and unique, which is guaranteed solidly by the existence of harmonic function. This property is attractive and simulation results are shown in this paper to ensure the capability of applications such as planer shape distortion and surface registration.Comment: 2016 3rd International Conference on Informative and Cybernetics for Computational Social Systems (ICCSS

Multimodal estimation of distribution algorithms

Taking the advantage of estimation of distribution algorithms (EDAs) in preserving high diversity, this paper proposes a multimodal EDA. Integrated with clustering strategies for crowding and speciation, two versions of this algorithm are developed, which operate at the niche level. Then these two algorithms are equipped with three distinctive techniques: 1) a dynamic cluster sizing strategy; 2) an alternative utilization of Gaussian and Cauchy distributions to generate offspring; and 3) an adaptive local search. The dynamic cluster sizing affords a potential balance between exploration and exploitation and reduces the sensitivity to the cluster size in the niching methods. Taking advantages of Gaussian and Cauchy distributions, we generate the offspring at the niche level through alternatively using these two distributions. Such utilization can also potentially offer a balance between exploration and exploitation. Further, solution accuracy is enhanced through a new local search scheme probabilistically conducted around seeds of niches with probabilities determined self-adaptively according to fitness values of these seeds. Extensive experiments conducted on 20 benchmark multimodal problems confirm that both algorithms can achieve competitive performance compared with several state-of-the-art multimodal algorithms, which is supported by nonparametric tests. Especially, the proposed algorithms are very promising for complex problems with many local optima

Novel Approaches for Regional Multifocus Image Fusion

Image fusion is a research topic about combining information from multiple images into one fused image. Although a large number of methods have been proposed, many challenges remain in obtaining clearer resulting images with higher quality. This chapter addresses the multifocus image fusion problem about extending the depth of field by fusing several images of the same scene with different focuses. Existing research in multifocus image fusion tends to emphasis on the pixel-level image fusion using transform domain methods. The region-level image fusion methods, especially the ones using new coding techniques, are still limited. In this chapter, we provide an overview of regional multi-focus image fusion, and two different orthogonal matching pursuit-based sparse representation methods are adopted for regional multi-focus image fusion. Experiment results show that the regional image fusion using sparse representation can achieve a comparable even better performance for multifocus image fusion problems

Reinstatement of long-term memory following erasure of its behavioral and synaptic expression in Aplysia.

Long-term memory (LTM) is believed to be stored in the brain as changes in synaptic connections. Here, we show that LTM storage and synaptic change can be dissociated. Cocultures of Aplysia sensory and motor neurons were trained with spaced pulses of serotonin, which induces long-term facilitation. Serotonin (5HT) triggered growth of new presynaptic varicosities, a synaptic mechanism of long-term sensitization. Following 5HT training, two antimnemonic treatments-reconsolidation blockade and inhibition of PKM--caused the number of presynaptic varicosities to revert to the original, pretraining value. Surprisingly, the final synaptic structure was not achieved by targeted retraction of the 5HT-induced varicosities but, rather, by an apparently arbitrary retraction of both 5HT-induced and original synapses. In addition, we find evidence that the LTM for sensitization persists covertly after its apparent elimination by the same antimnemonic treatments that erase learning-related synaptic growth. These results challenge the idea that stable synapses store long-term memories

Neural-learning-based force sensorless admittance control for robots with input deadzone

This paper presents a neural networks based admittance control scheme for robotic manipulators when interacting with the unknown environment in the presence of the actuator deadzone without needing force sensing. A compliant behaviour of robotic manipulators in response to external torques from the unknown environment is achieved by admittance control. Inspired by broad learning system (BLS), a flatted neural network structure using Radial Basis Function (RBF) with incremental learning algorithm is proposed to estimate the external torque, which can avoid retraining process if the system is modelled insufficiently. To deal with uncertainties in the robot system, an adaptive neural controller with dynamic learning framework is developed to ensure the tracking performance. Experiments on the Baxter robot have been implemented to test the effectiveness of the proposed method

Siamese Labels Auxiliary Network(SiLaNet)

Auxiliary information attracts more and more attention in the area of machine learning. Attempts so far to include such auxiliary information in state-of-the-art learning process have often been based on simply appending these auxiliary features to the data level or feature level. In this paper, we intend to propose a novel training method with new options and architectures. Siamese labels, which were used in the training phase as auxiliary modules. While in the testing phase, the auxiliary module should be removed. Siamese label module makes it easier to train and improves the performance in testing process. In general, the main contributions can be summarized as, 1) Siamese Labels are firstly proposed as auxiliary information to improve the learning efficiency; 2) We establish a new architecture, Siamese Labels Auxiliary Network (SilaNet), which is to assist the training of the model; 3) Siamese Labels Auxiliary Network is applied to compress the model parameters by 50% and ensure the high accuracy at the same time. For the purpose of comparison, we tested the network on CIFAR-10 and CIFAR100 using some common models. The proposed SilaNet performs excellent efficiency both on the accuracy and robustness