On a Neural Network that Performs an Enhanced Nearest-Neighbour Matching

We review some of the main methods of solving the image matching problem in Particle-Tracking Velocimetry (PTV). This is a technique of Experimental Fluid Dynamics for determining the velocity fields of moving fluids. This problem is a two-dimensional random-points matching problem that condtitutes a prototypal problem, analogous to the one-dimensional matching problem for Julesz [1] random-dot stereograms. Our study deals with a particular method of solution, namely the neural network algorithm proposed by Labonté [2,3]. Our interest in this neural network comes from the fact that it has been shown to outperform the best matching methods in PTV, and the belief that it is actually a method applicable to many other instances of the correspondence problem. We obtain many new results concerning the nature of this algorithm, the main one of which consists in showing how this neural network functions as an enhancer for nearest-neighbour particle image matching. We calculate its complexity, and produce two different types of learning curves for it. We exhibit the fact that the RMS error of the neural network decreases at least exponentially with the number of cycles of the neural network. The neural network constructs a Self-Organised Map (SOM), which corresponds to distorting back the two photos until they merge into a single photo. We explain how this distortion is driven, under the network dynamics, by the few good nearest-neighbours (sometimes as few as 20%) that exist initially. These are able to pull with them the neighboring images, toward their matching partners. We report the results of measuremnts that corroborate our analysis of this process. Received: 22 February 1999, Received in revised form: 22 September 1999, Accepted: 18 October 1999     

Multi-fingered robot hand optimal task force distribution: Neural inverse kinematics approach

Grasping and manipulation force distribution optimization of multi-fingered robotic hands can be formulated as a problem for minimizing an objective function subject to form-closure constraints, kinematics, and balance constraints of external force. In this paper we present a novel neural network for dexterous hand-grasping inverse kinematics mapping used in force optimization. The proposed optimization is shown to be globally convergent to the optimal grasping force. The approach followed here is to let an artificial neural network (ANN) learn the nonlinear inverse kinematics functional relating the hand joint positions and displacements to object displacement. This is done by considering the inverse hand Jacobian, in addition to the interaction between hand fingers and the object. The proposed neural-network approach has the advantages that the complexity for implementation is reduced, and the solution accuracy is increased, by avoiding the linearization of quadratic friction constraints. Simulation results show that the proposed neural network can achieve optimal grasping force.     

Neural network based mobile phone localization using Bluetooth connectivity

Location information is useful for mobile phones. There exists a dilemma between the relatively high price of GPS devices and the dependence of location information acquisition on GPS for most phones in current stage. To tackle this problem, in this paper, we investigate the position inference of phones without GPS according to Bluetooth connectivity and positions of beacon phones. With the position of GPS-equipped phones as beacons and with the Bluetooth connections between neighbor phones as constraints, we formulate the problem as an optimization problem defined on the Bluetooth network. The solution to this optimization problem is not unique. Heuristic information is employed to improve the performance of the result in the feasible set. Recurrent neural networks are developed to solve the problem distributively in real time. The convergence of the neural network and the solution feasibility to the defined problem are both theoretically proven. The hardware implementation of the proposed neural network is also explored in this paper. Simulations and comparisons with different application backgrounds are considered. The results demonstrate the effectiveness of the proposed method.     

A Model for the Dynamic Interaction Between Evolution and Learning

The interaction between learning and evolution has elicited much interest particularly among researchers who use evolutionary algorithms for the optimization of neural structures. In this article, we will propose an extension of the existing models by including a developmental phase – a growth process – of the neural network. In this way, we are able to examine the dynamical interaction between genetic information and information learned during development. Several measures are proposed to quantitatively examine the benefits and the effects of such an overlap between learning and evolution. The proposed model, which is based on the recursive encoding method for structure optimization of neural networks, is applied to the problem domain of time series prediction. Furthermore, comments are made on problem domains which associate growing networks (size) during development with problems of increasing complexity.     

Time-varying two-phase optimization and its application toneural-network learning

In this paper, a time-varying two-phase (TVTP) optimization neural network is proposed based on the two-phase neural network and the time-varying programming neural network. The proposed TVTP algorithm gives exact feasible solutions with a finite penalty parameter when the problem is a constrained time-varying optimization. It can be applied to system identification and control where it has some constraints on weights in the learning of the neural network. To demonstrate its effectiveness and applicability, the proposed algorithm is applied to the learning of a neo-fuzzy neuron model.     

A Primal-dual Neural Network for Shortest Path Problem

The shortest path (SP) problem is a classical combinatorial optimization problem which plays an important role in a packet-switched computer and communication network. A new primal-dual neural network to solve the shortest path problem (PDSPN) is presented in this paper. The proposed neural network combines many features such as no network coefficients set,easy implementation in a VLSI circuit, and is proved to be completely stable to the exact solutions. The simulation example shows its efficiency in finding the "optimum" path(s) for data transmission in computer and communication network.     

An efficient neurodynamic model to solve nonconvex nonlinear optimization problems and its applications

This paper presents a recurrent neural network for solving nonconvex nonlinear optimization problems subject to nonlinear inequality constraints. First, the p-power transformation is exploited for local convexification of the Lagrangian function in nonconvex nonlinear optimization problem. Next, the proposed neural network is constructed based on the Karush–Kuhn–Tucker (KKT) optimality conditions and the projection function. An important property of this neural network is that its equilibrium point corresponds to the optimal solution of the original problem. By utilizing an appropriate Lyapunov function, it is shown that the proposed neural network is stable in the sense of Lyapunov and convergent to the global optimal solution of the original problem. Also, the sensitivity of the convergence is analysed by changing the scaling factors. Compared with other existing neural networks for such problem, the proposed neural network has more advantages such as high accuracy of the obtained solutions, fast convergence, and low complexity. Finally, simulation results are provided to show the benefits of the proposed model, which compare to or outperform existing models.     

PSO-optimized modular neural network trained by OWO-HWO algorithm for fault location in analog circuits

Fault diagnosis of analog circuits is a key problem in the theory of circuit networks and has been investigated by many researchers in recent decades. In this paper, an active filter circuit is used as the circuit under test (CUT) and is simulated in both fault-free and faulty conditions. A modular neural network model is proposed in this paper for soft fault diagnosis of the CUT. To optimize the structure of neural network modules in the proposed scheme, particle swarm optimization (PSO) algorithm is used to determine the number of hidden layer nodes of neural network modules. In addition, the output weight optimization–hidden weight optimization (OWO-HWO) training algorithm is employed, instead of conventional output weight optimization–backpropagation (OWO-BP) algorithm, to improve convergence speed in training of the neural network modules in proposed modular model. The performance of the proposed method is compared to that of monolithic multilayer perceptrons (MLPs) trained by OWO-BP and OWO-HWO algorithms, K-nearest neighbor (KNN) classifier and a related system with the same CUT. Experimental results show that the PSO-optimized modular neural network model which is trained by the OWO-HWO algorithm offers higher correct fault location rate in analog circuit fault diagnosis application as compared to the classic and monolithic investigated neural models.     

双损失估计下强化学习型图像匹配方法

学习型特征检测器利用神经网络来检测和匹配图像特征点,其网络参数通常通过优化低层视觉的匹配准确率而训练得到,然而在高级视觉任务中,低层图像配准率的提升未必能带来更佳性能.针对该问题,提出一种双损失误差策略下的强化学习方法,一方面,将学习不变特征变换(LIFT)所得到的特征点和描述符以概率形式表示,估算出图像间的相对位姿,...     

A Hybrid Forward Algorithm for RBF Neural Network Construction

This paper proposes a novel hybrid forward algorithm (HFA) for the construction of radial basis function (RBF) neural networks with tunable nodes. The main objective is to efficiently and effectively produce a parsimonious RBF neural network that generalizes well. In this study, it is achieved through simultaneous network structure determination and parameter optimization on the continuous parameter space. This is a mixed integer hard problem and the proposed HFA tackles this problem using an integrated analytic framework, leading to significantly improved network performance and reduced memory usage for the network construction. The computational complexity analysis confirms the efficiency of the proposed algorithm, and the simulation results demonstrate its effectiveness     

Detecting ground control points via convolutional neural network for stereo matching

In this paper, we present a novel approach to detect ground control points (GCPs) for stereo matching problem. First of all, we train a convolutional neural network (CNN) on a large stereo set, and compute the matching confidence of each pixel by using the trained CNN model. Secondly, we present a ground control points selection scheme according to the maximum matching confidence of each pixel. Finally, the selected GCPs are used to refine the matching costs, then we apply the new matching costs to perform optimization with semi-global matching algorithm for improving the final disparity maps. We evaluate our approach on the KITTI 2012 stereo benchmark dataset. Our experiments show that the proposed approach significantly improves the accuracy of disparity maps.     

Network reliability optimization problem of interconnection network under node-edge failure model

The network reliability optimization problem for an interconnection network is to maximize the network reliability subjected to some constraints such as the total cost of the network. Even though, the problem is NP-Hard, many researchers have solved this problem in different ways but with a common assumption that nodes are perfect. But, this assumption is quite unrealistic in nature. In this paper, a new method based on artificial neural network is proposed to solve the network reliability optimization problem considering both the nodes and links of the interconnection networks to be imperfect. The problem is mapped onto an artificial neural network by constructing an energy function whose minimization process drives the neural network into one of its stable states. This stable state corresponds to a solution for the network reliability problem. Some existing methods are studied and compared with proposed method in evaluating the network reliability of some fully connected networks. The comparison reports the proposed method to be better than its counterparts in maximizing the network reliability. The proposed method is used to maximize the reliability of few fully connected networks subjected to some predefined total cost, where the node as well as the links of the networks may fail. Further, the behaviors of the cost as well as the time on the network reliability are discussed.     

Representation of neural networks through their multi-linearization

The studies on interpretability of neural networks have been playing an important role in understanding the knowledge developed through their learning and promoting the use of neurocomputing in practical problems. The rule-based setting in which neural networks are interpreted provides a convenient way of expressing knowledge in a transparent and modular manner and at a desired level of granularity (specificity). In this study, we formulate a certain engineering-based style of interpretation in which a given neural network is represented as a collection of local linear models where such models are developed around a collection of linearization nodes. The notion of multi-linearization of neural networks captures the essence of the proposed interpretation. We formulate the problem as an optimization of (i) a collection of linearization nodes around which individual linear models are formed and (ii) aggregation of the individual linearizations, where the linearization fields are subject to optimization. Given the non-differentiable character of the problem, we consider the use of population-based optimization of Particle Swarm Optimization (PSO). Numeric experiments are provided to illustrate the main aspects of the multi-linearization of neural networks.     

基于模糊RBF神经网络的PID及其应用

针对传统的PID控制器参数固定而导致在控制中效果差的问题,提出一种基于模糊RBF神经网络智能PID控制器的设计方法。该方法结合了模糊控制的推理能力强与神经网络学习能力强的特点,将模糊控制与RBF神经网络相结合以在线调整PID控制器参数,整定出一组适合于控制对象的kp, ki, kd参数。将算法运用到电机控制系统的PID参数寻优中,仿真结果表明基于此算法设计的PID控制器改善了电机控制系统的动态性能和稳定性。     

基于广义投影神经网络优化的模型预测控制*

为降低模型预测控制优化问题的计算复杂度,以时滞系统的模型预测控制问题作为研究对象,利用神经网络动态平衡点与优化问题解相对应的特点,提出一种基于广义投影神经网络的模型预测控制优化算法。首先,将模型预测控制优化问题描述为一个带约束的二次规划问题,进一步,通过广义投影神经网络模型进行在线优化。该方法充分发挥了神经网络并行、结构简单的优点,通过具体实例仿真,验证了本文算法的有效性与优越性。     

Solving general convex nonlinear optimization problems by an efficient neurodynamic model

In this paper, a neural network model is constructed on the basis of the duality theory, optimization theory, convex analysis theory, Lyapunov stability theory and LaSalle invariance principle to solve general convex nonlinear programming (GCNLP) problems. Based on the Saddle point theorem, the equilibrium point of the proposed neural network is proved to be equivalent to the optimal solution of the GCNLP problem. By employing Lyapunov function approach, it is also shown that the proposed neural network model is stable in the sense of Lyapunov and it is globally convergent to an exact optimal solution of the original problem. The simulation results also show that the proposed neural network is feasible and efficient.     

Solving Quadratic Programming Problems by Delayed Projection Neural Network

In this letter, the delayed projection neural network for solving convex quadratic programming problems is proposed. The neural network is proved to be globally exponentially stable and can converge to an optimal solution of the optimization problem. Three examples show the effectiveness of the proposed network     

A neural network approach to job-shop scheduling

A novel analog computational network is presented for solving NP-complete constraint satisfaction problems, i.e. job-shop scheduling. In contrast to most neural approaches to combinatorial optimization based on quadratic energy cost function, the authors propose to use linear cost functions. As a result, the network complexity (number of neurons and the number of resistive interconnections) grows only linearly with problem size, and large-scale implementations become possible. The proposed approach is related to the linear programming network described by D.W. Tank and J.J. Hopfield (1985), which also uses a linear cost function for a simple optimization problem. It is shown how to map a difficult constraint-satisfaction problem onto a simple neural net in which the number of neural processors equals the number of subjobs (operations) and the number of interconnections grows linearly with the total number of operations. Simulations show that the authors' approach produces better solutions than existing neural approaches to job-shop scheduling, i.e. the traveling salesman problem-type Hopfield approach and integer linear programming approach of J.P.S. Foo and Y. Takefuji (1988), in terms of the quality of the solution and the network complexity.     

基于改进Hopfield神经网络的图像特征点匹配算法

针对图像特征点匹配算法的运行时间呈指数增长的问题,提出了一种新的匹配算法NHop.该算法通过加入新的网络输入输出函数、点对间差异的度量和启发式选择目标点的方式,对传统的Hopfield神经网络进行了改进.新算法不仅解决了传统Hopfield神经网络运行时间长、能量函数易陷入局部极小点的问题,而且也有效地实现了图像特征点的匹配.实验结果表明,与传统的Hopfield神经网络相比,NHop算法的匹配速度更快、准确率更高,对于图像特征点的匹配效果更好.     

基于改进混合粒子群算法和匹配理论的无人机电力巡检卸载策略

无人机搭载深度神经网络进行自主电力巡检时由于受到设备本身计算能力、电池容量、深度神经网络计算负载的限制,无法独立处理巡检任务中产生的海量图像数据。为解决该问题,提出了一种基于改进混合粒子群算法和匹配理论的无人机电力巡检卸载策略,该策略将系统成本最小化问题分解为深度神经网络计算任务协同分割和边缘服务器选择两个子问题。针对协同分割子问题,基于深度神经网络计算任务的执行流程提出了一种错时传输方法,通过改进混合粒子群算法求解多无人机任务协同分割层。针对边缘服务器选择子问题,定义无人机与边缘服务器各自偏好函数,根据偏好函数通过匹配理论建立两者间的稳定匹配,得到边缘服务器选择策略。仿真结果表明,与其他卸载策略相比,所提策略能有效降低无人机能耗和计算任务处理时延,促进边缘服务器负载均衡。