Hao-Xiang Wen

Person reidentification (re-id) has gained significant progress and aroused great interest in computer vision. However, due to the effect of weak illumination and poor alignment, person re-id is still a challenging task. Many previous works focus on either illumination enhancement methods or pose estimation. However, those methods are difficult to apply in real-world scenarios, which usually contain various interference factors. To improve the performance of re-id, we propose an Illumination-Invariant and Pose-Aligned Network (IIPA-Net). The illumination change is handled by a retinex decompose network, and the pose variation problem is solved by a local feature matching method. Based on the multimodal nature of a person, we propose a part attention module to optimize the global feature. Finally, a data-driven training strategy is proposed to train the proposed architecture effectively. Experiments show that the proposed framework outperforms other state-of-the-art approaches on both normal- and low-light datasets.

This letter discusses the convergence condition of the narrowband FxLMS (NFxLMS) algorithm in Z‐domain. First, two new concepts about NFxLMS root locus, that is critical start point (CSP) and critical cross point (CCP), are introduced and defined. For NFxLMS with the simplest case, a special characteristic of the root locus is observed that the CCP always locates itself near the CSP in the Z plane. By exploiting this characteristic, directly solving the root locus equation is eliminated from the stability analysis, and the upper bound of the step size for NFxLMS is eventually estimated as a function of the reference frequency.

This paper investigates the cluster-delay mean square consensus problem of a class of first-order nonlinear stochastic multi-agent systems with impulse time windows. Specifically, on the one hand, we have applied a discrete control mechanism (i.e., impulsive control) into the system instead of a continuous one, which has the advantages of low control cost, high convergence speed; on the other hand, we considered the existence of impulse time windows when modeling the system, that is, a single impulse appears randomly within a time window rather than an ideal fixed position. In addition, this paper also considers the influence of stochastic disturbances caused by fluctuations in the external environment. Then, based on algebraic graph theory and Lyapunov stability theory, some sufficiency conditions that the system must meet to reach the consensus state are given. Finally, we designed a simulation example to verify the feasibility of the obtained results.

This paper focuses primarily on the mean square consensus problem of a class of nonlinear multi-agent systems suffering from stochastic impulsive deception attacks. The attacks here are modeled by completely stochastic destabilizing impulses, where their gains and instants satisfy all distributions and the Markovian process. Compared with existing methods, which assume that only gains are stochastic, it is difficult to deal with systems with different types of random variables. Thus, estimating the influence of these different types on the consensus problem is a key point of this paper. Based on the properties of stochastic processes, some sufficient conditions to solve the consensus problem are derived and some special cases are considered. Finally, a numerical example is given to illustrate the main results. Our results show that the consensus can be obtained if impulsive attacks do not occur too frequently, and it can promote system stability if the gains are below the defined threshold.

A sparse partial update (SPU) algorithm and its improved version improved SPU (ISPU) algorithm, are proposed in this paper for sparse system identification. The SPU first categorizes its filter coefficients into active and inactive coefficients. Then all the active coefficients are included in each adaptation, while only a small portion of the inactive coefficients is periodically chosen to be included in the adaptation. The SPU emphasizes convergence of the active coefficients by updating them at every adaptation, while the periodical adaptation of the inactive coefficients ensures its robustness and tracking capability. By eliminating most of the inactive coefficients from adaptation, the SPU significantly reduces the number of adapting coefficients in each adaptation. The decline in the number of adapting coefficients eventually leads to improvement in both computation and convergence speed. To avoid performance degradation in the case of identifying a dispersive system, an ISPU is further proposed by making modifications to the SPU. The simulation results demonstrate that the ISPU not only outperforms other sparse adaptive algorithms in identifying a sparse system but also performs at least as well as the NLMS algorithm in identifying a dispersive system.

Color histogram-based trackers have obtained excellent performance against many challenging situations. However, since the appearance of color is sensitive to illumination, they tend to achieve lower accuracy when illumination is severely variant throughout a sequence. To overcome this limitation, we propose a novel hyperline clustering based discriminant model, an illumination invariant model that is able to distinguish the object from its surrounding background. Furthermore, we exploit this model and propose an anchor based scale estimation to cope with shape deformation and scale variation. Numerous experiments on recent online tracking benchmark datasets demonstrate that our approach achieve favorable performance compared with several state-of-the-art tracking algorithms. In particular, our approach achieves higher accuracy than comparative methods in the illumination variant and shape deformation challenging situations.

Color image segmentation is very important in the field of image processing as it is commonly used for image semantic recognition, image searching, video surveillance or other applications. Although clustering algorithms have been successfully applied for image segmentation, conventional clustering algorithms such as K-means clustering algorithms are not sufficiently robust to illumination changes, which is common in real-world environments. Motivated by the observation that the RGB value distributions of the same color under different illuminations are located in an identical hyperline, we formulate color classification as a hyperline clustering problem. We then propose a K-hyperline clustering algorithm-based color image segmentation approach. Experiments on both synthetic and real images demonstrate the outstanding performance and robustness of the proposed algorithm as compared to existing clustering algorithms.

A novel scheme is proposed to locate the dispersive region, whose location is essential for parallel echo cancellation. In the scheme, a first filter adapts to a subsampled version of the input signal to roughly identify the impulse response. After each adaptation, a squaring function and a moving window integration procedure are performed on the first filter, and the region with the maximum integration value is considered to be the dispersive region. Finally, a second short filter is used to precisely identify the active coefficients belonging to the located dispersive region to implement the actual echo cancellation. Simulation results suggest that the parallel structure improves its convergence speed 3 times and its computation can be reduced by 3/8 compared with the traditional NLMS algorithm by decreasing the filter length. Due to the more accurate estimate of the location, the misalignment noise of the proposed algorithm is at least 10 dB lower than that of the conventional dispersive region locating algorithm. Moreover, the proposed algorithm based on the parallel structure outperforms other sparse adaptive algorithms in all aspects.