HIGHLIGHTS A new method of extracting the feature points in superpixels is proposed to compute candidate disparities using non-local cost aggregation. novel two-stage optimization framework for superpixel proposals by first getting labels quickly and then consists label sets updating pixels within corresponding instead assigning a randomly those pixels. The weight combination intensity, gradien...

In this paper, we investigate a distributed Nash equilibrium seeking problem for a timevarying multi-agent network consisting of two subnetworks. We propose a subgradientbased distributed algorithm to seek a Nash equilibrium of a zero-sum game, where the two subnetworks share the same sum objective function. We show that the proposed distributed algorithm with homogenous stepsize can achieve a ...

We present a new subband affine projection (SAP) algorithm for the adaptive acoustic echo cancellation with long echo path delay. Generally, the acoustic echo canceller suffers from the long echo path and large computational complexity. To solve this problem, the proposed algorithm combines merits of the affine projection (AP) algorithm and the subband filtering. Convergence speed of the propos...

The main aim of this paper is to simulate different types of Adaptive Algorithms for Spatial Beam forming, which is achieved by combining elements of a phased array in such a way that signals at particular angles experience constructive interference while others experience destructive interference. Here, simulations are done on different types of Adaptive Algorithms in MATLAB and Simulink to de...

In the last few years, we have seen an upsurge of interest in content-based image retrieval (CBIR)—the selection of images from a collection via features extracted from images themselves. Often, a single image attribute may not have enough discriminative information for successful retrieval. On the other hand when multiple features are used, it is hard to determine the suitable weighing factors...

We introduce a modified learning updating mechanism into the evolutionary Prisoner’s Dilemma on Newman-Watts (NW) networks. During the evolutionary process, each individual updates its strategy according to individual deterministic switch in combination with a feedback between its score aspiration and actual score. And individual’s score is a linear combination of individual’s total payoff and ...

Five existing LVQ algorithms are reviewed. The Premature Clustering Phenomenon, which downgrades the performance of LVQ is explained. By introducing and applying the “equalizing factor” as a remedy for the premature clustering phenomenon a breakthrough is achieved in improving the performance of the LVQ network, and its performance becomes competitive with that of the best known classi6ers. For...