Search

The general tensor-based methods can recover missing values of multidimensional images by exploiting the low-rankness on the pixel level. However, especially when considerable pixels of an image are missing, the low-rankness is not reliable on the pixel level, resulting in some details losing in their results, which hinders the performance of subsequent image applications (e.g., image recognition and segmentation). In this article, we suggest a novel multiscale feature (MSF) tensorization by exploiting the MSFs of multidimensional images, which not only helps to recover the missing values on a higher level, that is, the feature level but also benefits subsequent image applications. By exploiting the low-rankness of the resulting MSF tensor constructed by the new tensorization, we propose the convex and nonconvex MSF tensor train rank minimization (MSF-TT) to conjointly recover the MSF tensor and the corresponding original tensor in a unified framework. We develop the alternating directional method of multipliers (ADMMs) to solve the convex MSF-TT and the proximal alternating minimization (PAM) to solve the nonconvex MSF-TT. Moreover, we establish the theoretical guarantee of convergence for the PAM algorithm. Numerical examples of real-world multidimensional images show that the proposed MSF-TT outperforms other compared approaches in image recovery and the recovered MSF tensor can benefit the subsequent image recognition. [ABSTRACT FROM AUTHOR]

Domain adaptation aims at extracting knowledge from auxiliary source domains to assist the learning task in a target domain. In classification problems, since the distributions of the source and target domains are different, directly using source data to build a classifier for the target domain may hamper the classification performance on the target data. Fortunately, in many tasks, there can be some features that are transferable, i.e., the source and target domains share similar properties. On the other hand, it is common that the source data contain noisy features which may degrade the learning performance in the target domain. This issue, however, is barely studied in existing works. In this paper, we propose to find a feature subset that is transferable across the source and target domains. As a result, the domain discrepancy measured on the selected features can be reduced. Moreover, we seek to find the most discriminative features for classification. To achieve the above goals, we formulate a new sparse learning model that is able to jointly reduce the domain discrepancy and select informative features for classification. We develop two optimization algorithms to address the derived learning problem. Extensive experiments on real-world data sets demonstrate the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

Image smoothing is a fundamental procedure in applications of both computer vision and graphics. The required smoothing properties can be different or even contradictive among different tasks. Nevertheless, the inherent smoothing nature of one smoothing operator is usually fixed and thus cannot meet the various requirements of different applications. In this paper, we first introduce the truncated Huber penalty function which shows strong flexibility under different parameter settings. A generalized framework is then proposed with the introduced truncated Huber penalty function. When combined with its strong flexibility, our framework is able to achieve diverse smoothing natures where contradictive smoothing behaviors can even be achieved. It can also yield the smoothing behavior that can seldom be achieved by previous methods, and superior performance is thus achieved in challenging cases. These together enable our framework capable of a range of applications and able to outperform the state-of-the-art approaches in several tasks, such as image detail enhancement, clip-art compression artifacts removal, guided depth map restoration, image texture removal, etc. In addition, an efficient numerical solution is provided and its convergence is theoretically guaranteed even the optimization framework is non-convex and non-smooth. A simple yet effective approach is further proposed to reduce the computational cost of our method while maintaining its performance. The effectiveness and superior performance of our approach are validated through comprehensive experiments in a range of applications. Our code is available at https://github.com/wliusjtu/Generalized-Smoothing-Framework . [ABSTRACT FROM AUTHOR]

Heterogeneous Information Network (HIN) collecitve classification studies the problem of predicting labels for one type of nodes in a HIN which contains multiple types of nodes multiple types of links among them. Previous studies have revealed that exploiting relative importance of links is quite useful to improve node classification performance as connected nodes tend to have similar labels. Most existing approaches exploit the relative importance of links either by directly counting the number of connections among nodes or by learning the weight of each type of link from labeled data only. However, these approaches either neglect the importance of types of links to the class labels or may lead to overfitting problem. We propose a Tensor-based Markov chain (T-Mark) approach, which is able to automatically and simultaneously predict the labels for unlabeled nodes and give the relative importance of types of links that actually improve the classification accuracy. Specifically, we build two tensor equations by using the HIN and features of nodes from both labeled and unlabeled data. A Markov chain-based model is proposed and it is solved by an iterative process to obtain the stationary distributions. Theoretical analyses of the existence and uniqueness of such probability distributions are given. Extensive experimental results demonstrate that T-Mark is able to achieve superior performance in the comparison and obtain reasonable relative importance of links. [ABSTRACT FROM AUTHOR]

Poisson observations for videos are important models in video processing and computer vision. In this paper, we study the third-order tensor completion problem with Poisson observations. The main aim is to recover a tensor based on a small number of its Poisson observation entries. A existing matrix-based method may be applied to this problem via the matricized version of the tensor. However, this method does not leverage on the global low-rankness of a tensor and may be substantially suboptimal. Our approach is to consider the maximum likelihood estimate of the Poisson distribution, and utilize the Kullback-Leibler divergence for the data-fitting term to measure the observations and the underlying tensor. Moreover, we propose to employ a transformed tensor nuclear norm ball constraint and a bounded constraint of each entry, where the transformed tensor nuclear norm is used to get a lower transformed multi-rank tensor with suitable unitary transformation matrices. We show that the upper bound of the error of the estimator of the proposed model is less than that of the existing matrix-based method. Also an information theoretic lower error bound is established. An alternating direction method of multipliers is developed to solve the resulting convex optimization model. Extensive numerical experiments on synthetic data and real-world datasets are presented to demonstrate the effectiveness of our proposed model compared with existing tensor completion methods. [ABSTRACT FROM AUTHOR]

This work proposes a novel deep learning (DL) framework to solve the electromagnetic inverse scattering (EMIS) problems. The proposed framework integrates the complex-valued deep convolutional neural network (DConvNet) into the supervised descent method (SDM) to realize both off-line training and on-line “imaging” prediction for EMIS. The offline training consists of two parts: 1) DConvNet training: the training dataset is created, and the proposed DConvNet is trained to realize the EM forward process and 2) SDM training: the trained DConvNet is integrated into the SDM framework, and the average descent directions between the initial prediction and the true label of SDM iterative schemes are learned based on the same dataset in part 1). In the online step, the contrasts (permittivities) reconstruction of scatterers is realized by the SDM iteration process based on learned descent directions, while its forward process is achieved by the trained complex-valued DConvNet. Ultimately, this framework provides a new perspective to integrate the prior information into the EMIS solving process with the maintained accuracy. Unlike the conventional SDM, the novel proposed framework can significantly shorten the computation and realize the real-time imaging. Various numerical examples and discussions are provided to demonstrate the efficiency and accuracy of the proposed novel framework. [ABSTRACT FROM AUTHOR]

The image nonlocal self-similarity (NSS) prior refers to the fact that a local patch often has many nonlocal similar patches to it across the image and has been widely applied in many recently proposed machining learning algorithms for image processing. However, there is no theoretical analysis on its working principle in the literature. In this paper, we discover a potential causality between NSS and low-rank property of color images, which is also available to grey images. A new patch group based NSS prior scheme is proposed to learn explicit NSS models of natural color images. The numerical low-rank property of patched matrices is also rigorously proved. The NSS-based QMC algorithm computes an optimal low-rank approximation to the high-rank color image, resulting in high PSNR and SSIM measures and particularly the better visual quality. A new tensor NSS-based QMC method is also presented to solve the color video inpainting problem based on quaternion tensor representation. The numerical experiments on color images and videos indicate the advantages of NSS-based QMC over the state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Recently, transform-based tensor nuclear norm (TNN) minimization methods have received increasing attention for recovering third-order tensors in multi-dimensional imaging problems. The main idea of these methods is to perform the linear transform along the third mode of third-order tensors and then minimize the nuclear norm of frontal slices of the transformed tensor. The main aim of this paper is to propose a nonlinear multilayer neural network to learn a nonlinear transform by solely using the observed tensor in a self-supervised manner. The proposed network makes use of the low-rank representation of the transformed tensor and data-fitting between the observed tensor and the reconstructed tensor to learn the nonlinear transform. Extensive experimental results on different data and different tasks including tensor completion, background subtraction, robust tensor completion, and snapshot compressive imaging demonstrate the superior performance of the proposed method over state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Recently, deep-learning-based denoising methods for hyperspectral images (HSIs) have been comprehensively studied and achieved impressive performance because they can effectively extract complex and nonlinear image features. Compared with deep-learning-based methods, the nonlocal similarity-based denoising methods are more suitable for images containing edges or regular textures. We propose a powerful HSI denoising method, termed non-local 3-D convolutional neural network (NL-3DCNN), combining traditional machine learning and deep learning techniques. NL-3DCNN exploits the high spectral correlation of an HSI using subspace representation, and the corresponding representation coefficients are termed eigenimages. The high spatial correlation in eigenimages is exploited by grouping nonlocal similar patches, which are denoised by a 3-D convolutional neural network. The numerical and graphical denoising results of the simulated and real data show that the proposed method is superior to the state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Precipitation nowcasting is an important task, which can be used in numerous applications. The key challenge of the task lies in radar echo map prediction. Previous studies leverage the convolutional recurrent neural network (ConvRNN) to address the problem. However, the approaches are built upon mean square losses, and the results tend to have inaccurate appearances, shapes, and positions for predictions. To alleviate this problem, we explore the idea of adversarial regularization and systematically compare four types of generative adversarial networks (GANs), which are the combinations of GAN/Wasserstein GAN (WGAN) and its multiscale version. Extensive experiments on a real-world radar dataset and four typical meteorological examples are conducted. The results validate the effectiveness of adversarial regularization. The developed models show superior performances over the existing prediction approaches in the majority of circumstances. Moreover, we find that the WGAN regularization often delivers better results than the GAN regularization due to its robustness, and the multiscale WGAN, in general, performs the best among all the methods. To reproduce the results, we release the source code at https://github.com/luochuyao/MultiScaleGAN and the test system at http://39.97.217.145:80/. [ABSTRACT FROM AUTHOR]

One of the main challenges in multi-source domain adaptation is how to reduce the domain discrepancy between each source domain and a target domain, and then evaluate the domain relevance to determine how much knowledge should be transferred from different source domains to the target domain. However, most prior approaches barely consider both discrepancies and relevance among domains. In this paper, we propose an algorithm, called Iterative Refinement based on Feature Selection and the Wasserstein distance (IRFSW), to solve semi-supervised domain adaptation with multiple sources. Specifically, IRFSW aims to explore both the discrepancies and relevance among domains in an iterative learning procedure, which gradually refines the learning performance until the algorithm stops. In each iteration, for each source domain and the target domain, we develop a sparse model to select features in which the domain discrepancy and training loss are reduced simultaneously. Then a classifier is constructed with the selected features of the source and labeled target data. After that, we exploit optimal transport over the selected features to calculate the transferred weights. The weight values are taken as the ensemble weights to combine the learned classifiers to control the amount of knowledge transferred from source domains to the target domain. Experimental results validate the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

The ever-increasing spectral resolution of hyperspectral images (HSIs) is often obtained at the cost of a decrease in the signal-to-noise ratio of the measurements, thus calling for effective denoising techniques. HSIs from the real world lie in low-dimensional subspaces and are self-similar. The low dimensionality stems from the high correlation existing among the reflectance vectors, and self-similarity is common in real-world images. In this article, we exploit the above two properties. The low dimensionality is a global property that enables the denoising to be formulated just with respect to the subspace representation coefficients, thus greatly improving the denoising performance and reducing the computational complexity during processing. The self-similarity is exploited via a low-rank tensor factorization of nonlocal similar 3-D patches. The proposed factorization hinges on the optimal shrinkage/thresholding of the singular value decomposition (SVD) singular values of low-rank tensor unfoldings. As a result, the proposed method is user friendly and insensitive to its parameters. Its effectiveness is illustrated in a comparison with state-of-the-art competitors. A MATLAB demo of this work is available at https://github.com/LinaZhuang for the sake of reproducibility. [ABSTRACT FROM AUTHOR]

A complete characterization for the restricted isometry constant (RIC) bounds on $\delta _{{{ tk}}}$ for all $ {t}>0$ is an important problem on recovery of sparse signals with prior support information via weighted $\ell _{{p}}$ -minimization ($0 < {p} \leqslant 1$). In this paper, new bounds on the restricted isometry constants $\delta _{{{ tk}}}$ ($0 < {t} < \frac {4}{3}{d}$), where $d$ is a key constant determined by prior support information, are established to guarantee the sparse signal recovery via the weighted $\ell _{{p}}$ minimization in both noiseless and noisy settings. This result fills a vacancy on $\delta _{{{ tk}}}$ with $0 < {t} < \frac {4}{3}{d}$ , compared with previous works on $\delta _{{{ tk}}}$ (${t} \geqslant \frac {4}3{d}$). We show that, when the accuracy of prior support estimate is at least 50%, the new recovery condition in terms of $\delta _{{{ tk}}}$ ($0 < {t} < \frac {4}{3}{d}$) via weighted $\ell _{1}$ minimization is weaker than the condition required by classical $\ell _{1}$ minimization without weighting. Our weighted $\ell _{1}$ minimization gives better recovery error bounds in noisy setting. Similarly, the new recovery condition in terms of $\delta _{{{ tk}}}$ ($0 < {t} < \frac {4}{3}{d}$) is extended to weighted $\ell _{{p}}$ ($0 < {p} < 1$) minimization, and it is also weaker than the condition obtained by standard non-convex $\ell _{{p}}$ ($0 < {p} < 1$) minimization without weighting. Numerical illustrations are provided to demonstrate our new theoretical results. [ABSTRACT FROM AUTHOR]

Heterogeneous domain adaptation (HDA) is a challenging problem because of the different feature representations in the source and target domains. Most HDA methods search for mapping matrices from the source and target domains to discover latent features for learning. However, these methods barely consider the reconstruction error to measure the information loss during the mapping procedure. In this paper, we propose to jointly capture the information and match the source and target domain distributions in the latent feature space. In the learning model, we propose to minimize the reconstruction loss between the original and reconstructed representations to preserve information during transformation and reduce the Maximum Mean Discrepancy between the source and target domains to align their distributions. The resulting minimization problem involves two projection variables with orthogonal constraints that can be solved by the generalized gradient flow method, which can preserve orthogonal constraints in the computational procedure. We conduct extensive experiments on several image classification datasets to demonstrate that the effectiveness and efficiency of the proposed method are better than those of state-of-the-art HDA methods. [ABSTRACT FROM AUTHOR]

This paper addresses the tensor completion problem, which aims to recover missing information of multi-dimensional images. How to represent a low-rank structure embedded in the underlying data is the key issue in tensor completion. In this work, we suggest a novel low-rank tensor representation based on coupled transform, which fully exploits the spatial multi-scale nature and redundancy in spatial and spectral/temporal dimensions, leading to a better low tensor multi-rank approximation. More precisely, this representation is achieved by using two-dimensional framelet transform for the two spatial dimensions, one/two-dimensional Fourier transform for the temporal/spectral dimension, and then Karhunen–Loéve transform (via singular value decomposition) for the transformed tensor. Based on this low-rank tensor representation, we formulate a novel low-rank tensor completion model for recovering missing information in multi-dimensional visual data, which leads to a convex optimization problem. To tackle the proposed model, we develop the alternating directional method of multipliers (ADMM) algorithm tailored for the structured optimization problem. Numerical examples on color images, multispectral images, and videos illustrate that the proposed method outperforms many state-of-the-art methods in qualitative and quantitative aspects. [ABSTRACT FROM AUTHOR]

Although image denoising as a basic task of image restoration has been widely studied in the past decades, there are not many studies on mixed noise denoising. In this paper, we propose two structured dictionary learning models to recover images corrupted by mixed Gaussian and impulse noise. These two models can be merged as $\ell _{p}$ -norm fidelity plus $\ell _{q}$ -norm regularization. The fidelity term is used to fit image patches and the regularization term is employed for sparse coding. Particularly, we utilize proximal (and proximal linearized) alternating minimization methods as the main solvers to deal with these two models. We remove the Gaussian noise under the assumption that the uncorrupted image can be approximated with a linear representation under an appropriate orthogonal basis. We use different ways to remove impulse noise for these two models. The experimental results are reported to compare the existing methods and demonstrate the performance of the proposed denoising model is better than the other existing methods in terms of some quality assessment metrics. [ABSTRACT FROM AUTHOR]

The main aim of this paper is to develop a framelet representation of the tensor nuclear norm for third-order tensor recovery. In the literature, the tensor nuclear norm can be computed by using tensor singular value decomposition based on the discrete Fourier transform matrix, and tensor completion can be performed by the minimization of the tensor nuclear norm which is the relaxation of the sum of matrix ranks from all Fourier transformed matrix frontal slices. These Fourier transformed matrix frontal slices are obtained by applying the discrete Fourier transform on the tubes of the original tensor. In this paper, we propose to employ the framelet representation of each tube so that a framelet transformed tensor can be constructed. Because of framelet basis redundancy, the representation of each tube is sparsely represented. When the matrix slices of the original tensor are highly correlated, we expect the corresponding sum of matrix ranks from all framelet transformed matrix frontal slices would be small, and the resulting tensor completion can be performed much better. The proposed minimization model is convex and global minimizers can be obtained. Numerical results on several types of multi-dimensional data (videos, multispectral images, and magnetic resonance imaging data) have tested and shown that the proposed method outperformed the other testing methods. [ABSTRACT FROM AUTHOR]

3D point cloud—a new signal representation of volumetric objects—is a discrete collection of triples marking exterior object surface locations in 3D space. Conventional imperfect acquisition processes of 3D point cloud—e.g., stereo-matching from multiple viewpoint images or depth data acquired directly from active light sensors—imply non-negligible noise in the data. In this paper, we extend a previously proposed low-dimensional manifold model for the image patches to surface patches in the point cloud, and seek self-similar patches to denoise them simultaneously using the patch manifold prior. Due to discrete observations of the patches on the manifold, we approximate the manifold dimension computation defined in the continuous domain with a patch-based graph Laplacian regularizer, and propose a new discrete patch distance measure to quantify the similarity between two same-sized surface patches for graph construction that is robust to noise. We show that our graph Laplacian regularizer leads to speedy implementation and has desirable numerical stability properties given its natural graph spectral interpretation. Extensive simulation results show that our proposed denoising scheme outperforms state-of-the-art methods in objective metrics and better preserves visually salient structural features like edges. [ABSTRACT FROM AUTHOR]

In this paper, we consider the recovery of $k$ -sparse signals using the weighted $\ell _{p}$ ($0< p \leqslant 1$) minimization when some partial prior information on the support is available. First, we present a unified analysis of restricted isometry constant $\delta _{tk}$ with $d< t \leqslant 2d$ ($d \geqslant 1$ is determined by the prior support information) for sparse signal recovery by the weighted $\ell _{p}$ ($0< p \leqslant 1$) minimization in both noiseless and noisy settings. This result fills a vacancy on $\delta _{tk}$ with $t< 2$ , compared with previous works on $\delta _{(a+1)k}$ ($a>1$). Second, we provide a sufficient condition on $\delta _{tk}$ with $1< t \leqslant 2$ for the recovery of sparse signals using the $\ell _{p}$ ($0< p \leqslant 1$) minimization, which extends the existing optimal result on $\delta _{2k}$ in the literature. Last, various numerical examples are presented to demonstrate the better performance of the weighted $\ell _{p}$ ($0< p \leqslant 1$) minimization is achieved when the accuracy of prior information on the support is at least 50%, compared with that of the $\ell _{p}$ ($0< p \leqslant 1$) minimization. [ABSTRACT FROM AUTHOR]

Multi-domain biological network association and clustering have attracted a lot of attention in biological data integration and understanding, which can provide a more global and accurate understanding of biological phenomenon. In many problems, different domains may have different cluster structures. Due to rapid growth of data collection from different sources, some domains may be strongly or weakly associated with the other domains. A key challenge is how to determine the degree of association among different domains, and to achieve accurate clustering results by data integration. In this paper, we propose an unsupervised learning approach for multi-domain network association by using block signed graph clustering. In particular, with consistency weights calculation, the proposed algorithm automatically identify domains relevant to each other strongly (or weakly) by assigning them larger (or smaller) weights. This approach not only significantly improve clustering accuracy but also understand multi-domain networks association. In each iteration of the proposed algorithm, we update consistency weights based on cluster structure of each domain, and then make use of different sets of eigenvectors to obtain different cluster structures in each domain. Experimental results on both synthetic data sets and real data sets (including neuron activity data and gene expression data) empirically demonstrate the effectiveness of the proposed algorithm in clustering performance and in domain association capability. [ABSTRACT FROM AUTHOR]

In this paper, we propose and develop a novel nonlocal variational technique based on structural similarity (SS) information for image restoration problems. In the literature, patches extracted from images are compared according to their pixel values, and then nonlocal filtering can be employed for image restoration. The disadvantage of this approach is that intensity-based patch distance may not be effective in image restoration, especially for images containing texture or structural information. The main aim of this paper is to propose using SS between image patches to develop nonlocal regularization models. In particular, two types of nonlocal regularizing functions are studied: an SS-based nonlocal quadratic function (SS-NLH1) and an SS-based nonlocal total variation function (SS-NLTV) for regularization of image restoration problems. Moreover, we employ iterative algorithms to solve these SS-NLH1 and SS-NLTV variational models numerically and discuss the convergence of these algorithms. The experimental results are presented to demonstrate the effectiveness of the proposed models. [ABSTRACT FROM AUTHOR]

Recent advent of graph signal processing (GSP) has spurred intensive studies of signals that live naturally on irregular data kernels described by graphs (e.g., social networks, wireless sensor networks). Though a digital image contains pixels that reside on a regularly sampled 2-D grid, if one can design an appropriate underlying graph connecting pixels with weights that reflect the image structure, then one can interpret the image (or image patch) as a signal on a graph, and apply GSP tools for processing and analysis of the signal in graph spectral domain. In this paper, we overview recent graph spectral techniques in GSP specifically for image/video processing. The topics covered include image compression, image restoration, image filtering, and image segmentation. [ABSTRACT FROM AUTHOR]

Multi-label problems arise in various domains, including automatic multimedia data categorization, and have generated significant interest in computer vision and machine learning community. However, existing methods do not adequately address two key challenges: exploiting correlations between labels and making up for the lack of labelled data or even missing labelled data. In this paper, we proposed to use a semi-supervised singular value decomposition (SVD) to handle these two challenges. The proposed model takes advantage of the nuclear norm regularization on the SVD to effectively capture the label correlations. Meanwhile, it introduces manifold regularization on mapping to capture the intrinsic structure among data, which provides a good way to reduce the required labelled data with improving the classification performance. Furthermore, we designed an efficient algorithm to solve the proposed model based on the alternating direction method of multipliers, and thus, it can efficiently deal with large-scale data sets. Experimental results for synthetic and real-world multimedia data sets demonstrate that the proposed method can exploit the label correlations and obtain promising and better label prediction results than the state-of-the-art methods. [ABSTRACT FROM PUBLISHER]

Missing information, such as dead pixel values and cloud effects, is very common image quality degradation problems in remote sensing. Missing information can reduce the accuracy of the subsequent image processing, in applications such as classification, unmixing, and target detection, and even the quantitative retrieval process. The main aim of this paper is to study an adaptive weighted tensor completion (AWTC) method for the recovery of remote sensing images with missing data. Our idea is to collectively make use of the spatial, spectral, and temporal information to build a new weighted tensor low-rank regularization model for recovering the missing data. In the model, the weights are determined adaptively by considering the contribution of the spatial, spectral, and temporal information in each dimension. Experimental results based on both simulated and real data sets are presented to verify that the proposed method can recover missing data, and its performance is found to be better than the other tested methods. In the simulated experiments, the peak signal-to-noise ratio is improved by more than 3 dB, compared with the original tensor completion model. In the real data experiments, the proposed AWTC model can better recover the dead line problem in Aqua Moderate Resolution Imaging Spectroradiometer band 6 and the scan-line corrector-off problem in enhanced thematic mapper plus images, with the smallest spectral distortion. [ABSTRACT FROM PUBLISHER]

Multi-label classification deals with the problem where each example is associated with multiple class labels. Since the labels are often dependent to other labels, exploiting label dependencies can significantly improve the multi-label classification performance. The label dependency in existing studies is often given as prior knowledge or learned from the labels only. However, in many real applications, such prior knowledge may not be available, or labeled information might be very limited. In this paper, we propose a new algorithm, called Ml-Forest , to learn an ensemble of hierarchical multi-label classifier trees to reveal the intrinsic label dependencies. In Ml-Forest, we construct a set of hierarchical trees, and develop a label transfer mechanism to identify the multiple relevant labels in a hierarchical way. In general, the relevant labels at higher levels of the trees capture more discriminable label concepts, and they will be transferred into lower level children nodes that are harder to discriminate. The relevant labels in the hierarchy are then aggregated to compute label dependency and make the final prediction. Our empirical study shows encouraging results of the proposed algorithm in comparison with the state-of-the-art multi-label classification algorithms under Friedman test and post-hoc Nemenyi test. [ABSTRACT FROM PUBLISHER]

Heterogeneous transfer learning has recently gained much attention as a new machine learning paradigm in which the knowledge can be transferred from source domains to target domains in different feature spaces. Existing works usually assume that source domains can provide accurate and useful knowledge to be transferred to target domains for learning. In practice, there may be noise appearing in given source (text) and target (image) domains data, and thus, the performance of transfer learning can be seriously degraded. In this paper, we propose a robust and non-negative collective matrix factorization model to handle noise in text-to-image transfer learning, and make a reliable bridge to transfer accurate and useful knowledge from the text domain to the image domain. The proposed matrix factorization model can be solved by an efficient iterative method, and the convergence of the iterative method can be shown. Extensive experiments on real data sets suggest that the proposed model is able to effectively perform transfer learning in noisy text and image domains, and it is superior to the popular existing methods for text-to-image transfer learning. [ABSTRACT FROM AUTHOR]

Network has been a general tool for studying the complex interactions between different genes, proteins, and other small molecules. Module as a fundamental property of many biological networks has been widely studied and many computational methods have been proposed to identify the modules in an individual network. However, in many cases, a single network is insufficient for module analysis due to the noise in the data or the tuning of parameters when building the biological network. The availability of a large amount of biological networks makes network integration study possible. By integrating such networks, more informative modules for some specific disease can be derived from the networks constructed from different tissues, and consistent factors for different diseases can be inferred. In this paper, we have developed an effective method for module identification from multiple networks under different conditions. The problem is formulated as an optimization model, which combines the module identification in each individual network and alignment of the modules from different networks together. An approximation algorithm based on eigenvector computation is proposed. Our method outperforms the existing methods, especially when the underlying modules in multiple networks are different in simulation studies. We also applied our method to two groups of gene coexpression networks for humans, which include one for three different cancers, and one for three tissues from the morbidly obese patients. We identified 13 modules with three complete subgraphs, and 11 modules with two complete subgraphs, respectively. The modules were validated through Gene Ontology enrichment and KEGG pathway enrichment analysis. We also showed that the main functions of most modules for the corresponding disease have been addressed by other researchers, which may provide the theoretical basis for further studying the modules experimentally. [ABSTRACT FROM PUBLISHER]

In this paper, we address the total variation (TV)-based nonlinear image restoration problems. In nonlinear image restoration problems, an original image is corrupted by a spatiallyinvariant blur, the build-in nonlinearity in imaging system, and the additive Gaussian white noise. We study the objective function consisting of the nonlinear least squares data-fitting term and the TV regularization term of the restored image. By making use of the structure of the objective function, an efficient alternating direction method of multipliers can be developed for solving the proposed model. The convergence of the numerical scheme is also studied. Numerical examples, including nonlinear image restoration and high-dynamic range imaging are reported to demonstrate the effectiveness of the proposed model and the efficiency of the proposed numerical scheme. [ABSTRACT FROM AUTHOR]

This paper analyzes the cartoon and texture structures to inspect and visualize defective objects in a patterned fabric image. It presents a method of an image decomposition (ID) and solves it by a convex optimization algorithm. Our experimental results on benchmark fabric images are superior to those by other methods. [ABSTRACT FROM AUTHOR]