Sparse representation has attracted much attention from researchers in fields of signal processing, image processing, computer vision and pattern recognition. Sparse representation also has a good reputation in both theoretical research and practical applications. Many different algorithms have been proposed for sparse representation. The main purpose of this article is to provide a comprehensive study and an updated review on sparse representation and to supply a guidance for researchers. The taxonomy of sparse representation methods can be studied from various viewpoints. For example, in terms of different norm minimizations used in sparsity constraints, the methods can be roughly categorized into five groups: sparse representation with l0-norm minimization, sparse representation with lp-norm (0

No abstract

In domain adaptation, maximum mean discrepancy (MMD) has been widely adopted as a discrepancy metric between the distributions of source and target domains. However, existing MMD-based domain adaptation methods generally ignore the changes of class prior distributions, i.e., class weight bias across domains. This remains an open problem but ubiquitous for domain adaptation, which can be caused by changes in sample selection criteria and application scenarios. We show that MMD cannot account for class weight bias and results in degraded domain adaptation performance. To address this issue, a weighted MMD model is proposed in this paper. Specifically, we introduce class-specific auxiliary weights into the original MMD for exploiting the class prior probability on source and target domains, whose challenge lies in the fact that the class label in target domain is unavailable. To account for it, our proposed weighted MMD model is defined by introducing an auxiliary weight for each class in the source domain, and a classification EM algorithm is suggested by alternating between assigning the pseudo-labels, estimating auxiliary weights and updating model parameters. Extensive experiments demonstrate the superiority of our weighted MMD over conventional MMD for domain adaptation.

The overall understanding of the molecular etiologies of intellectual disability (ID) and developmental delay (DD) is increasing as next-generation sequencing technologies identify genetic variants in individuals with such disorders. However, detailed analyses conclusively confirming these variants, as well as the underlying molecular mechanisms explaining the diseases, are often lacking. Here, we report on an ID syndrome caused by de novo heterozygous loss-of-function (LoF) mutations in SON. The syndrome is characterized by ID and/or DD, malformations of the cerebral cortex, epilepsy, vision problems, musculoskeletal abnormalities, and congenital malformations. Knockdown of son in zebrafish resulted in severe malformation of the spine, brain, and eyes. Importantly, analyses of RNA from affected individuals revealed that genes critical for neuronal migration and cortex organization (TUBG1, FLNA, PNKP, WDR62, PSMD3, and HDAC6) and metabolism (PCK2, PFKL, IDH2, ACY1, and ADA) are significantly downregulated because of the accumulation of mis-spliced transcripts resulting from erroneous SON-mediated RNA splicing. Our data highlight SON as a master regulator governing neurodevelopment and demonstrate the importance of SON-mediated RNA splicing in human development.

a b s t r a c tThis paper presents a simple yet efficient image retrieval approach by proposing a new image feature detector and descriptor, namely the micro-structure descriptor (MSD). The micro-structures are defined based on an edge orientation similarity, and the MSD is built based on the underlying colors in microstructures with similar edge orientation. With micro-structures serving as a bridge, the MSD extracts features by simulating human early visual processing and it effectively integrates color, texture, shape and color layout information as a whole for image retrieval. The proposed MSD algorithm has high indexing performance and low dimensionality. Specifically, it has only 72 dimensions for full color images, and hence it is very efficient for image retrieval. The proposed method is extensively tested on Corel datasets with 15,000 natural images. The results demonstrate that it is much more efficient and effective than representative feature descriptors, such as Gabor features and multi-textons histogram, for image retrieval.Crown

No abstract

No abstract

Recently, regression analysis has become a popular tool for face recognition. Most existing regression methods use the one-dimensional, pixel-based error model, which characterizes the representation error individually, pixel by pixel, and thus neglects the two-dimensional structure of the error image. We observe that occlusion and illumination changes generally lead, approximately, to a low-rank error image. In order to make use of this low-rank structural information, this paper presents a two-dimensional image-matrix-based error model, namely, nuclear norm based matrix regression (NMR), for face representation and classification. NMR uses the minimal nuclear norm of representation error image as a criterion, and the alternating direction method of multipliers (ADMM) to calculate the regression coefficients. We further develop a fast ADMM algorithm to solve the approximate NMR model and show it has a quadratic rate of convergence. We experiment using five popular face image databases: the Extended Yale B, AR, EURECOM, Multi-PIE and FRGC. Experimental results demonstrate the performance advantage of NMR over the state-of-the-art regression-based methods for face recognition in the presence of occlusion and illumination variations.