Search

The purpose of this paper is to prove the positivity of double point divisors of general inner projections for projective S2-varieties with invertible dualizing sheaves, without assuming the smoothness or the normality of varieties. As applications, we characterize two types of projective varieties: varieties with trivial double point divisors and varieties with d − e − 1 ≤ n for dimension n, degree d and codimension e. [ABSTRACT FROM AUTHOR]

Linear discriminant analysis (LDA) is one of the most widely used methods in discriminant classification and pattern recognition. However, with the rapid development of information science and technology, the dimensionality of collected data is high or ultrahigh, which causes the failure of LDA. To address this issue, a feature screening procedure based on the Fisher's linear projection and the marginal score test is proposed to deal with the ultrahigh-dimensional binary classification problem. The sure screening property is established to ensure that the important features could be retained and the irrelevant predictors could be eliminated. The finite sample properties of the proposed procedure are assessed by Monte Carlo simulation studies and a real-life data example.

Linear discriminant analysis (LDA) is one of the most widely used methods in discriminant classification and pattern recognition. However, with the rapid development of information science and technology, the dimensionality of collected data is high or ultrahigh, which causes the failure of LDA. To address this issue, a feature screening procedure based on the Fisher's linear projection and the marginal score test is proposed to deal with the ultrahigh-dimensional binary classification problem. The sure screening property is established to ensure that the important features could be retained and the irrelevant predictors could be eliminated. The finite sample properties of the proposed procedure are assessed by Monte Carlo simulation studies and a real-life data example. [ABSTRACT FROM AUTHOR]

Isolated evaluation of multiparametric in vivo chemical exchange saturation transfer (CEST) MRI often requires complex computational processing for both correction of B0 and B1 inhomogeneity and contrast generation. For that, sufficiently densely sampled Z‐spectra need to be acquired. The list of acquired frequency offsets largely determines the total CEST acquisition time, while potentially representing redundant information. In this work, a linear projection‐based multiparametric CEST evaluation method is introduced that offers fast B0 and B1 inhomogeneity correction, contrast generation and feature selection for CEST data, enabling reduction of the overall measurement time. To that end, CEST data acquired at 7 T in six healthy subjects and in one brain tumor patient were conventionally evaluated by interpolation‐based inhomogeneity correction and Lorentzian curve fitting. Linear regression was used to obtain coefficient vectors that directly map uncorrected data to corrected Lorentzian target parameters. L1‐regularization was applied to find subsets of the originally acquired CEST measurements that still allow for such a linear projection mapping. The linear projection method allows fast and interpretable mapping from acquired raw data to contrast parameters of interest, generalizing from healthy subject training data to unseen healthy test data and to the tumor patient dataset. The L1‐regularization method shows that a fraction of the acquired CEST measurements is sufficient to preserve tissue contrasts, offering up to a 2.8‐fold reduction of scan time. Similar observations as for the 7‐T data can be made for data from a clinical 3‐T scanner. Being a fast and interpretable computation step, the proposed method is complementary to neural networks that have recently been employed for similar purposes. The scan time acceleration offered by the L1‐regularization ("CEST‐LASSO") constitutes a step towards better applicability of multiparametric CEST protocols in a clinical context. [ABSTRACT FROM AUTHOR]

Copyright of Espacio, Tiempo y Forma. Serie VII, Historia del Arte is the property of Editorial UNED and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Solution appraisal, which has been realized on the basis of projections from the true medium to the solution, is an essential procedure in practical studies, especially in computer tomography. The projection operator in a linear problem or its linear approximation in a nonlinear problem is the resolution matrix for the solution (or model). Practical applications of a resolution matrix can be used to quantitatively retrieve the resolvability of the medium, the constrainability of the solution parameters, and the relationship between the solution and the factors in the study system. A given row vector of the matrix for a solution parameter can be used to quantify the resolvability, deviation from expectation, and difference between that solution parameter and its neighbor from the main-diagonal element, row-vector sum, and difference between neighboring elements in the row vector, respectively. The resolution length of a solution parameter should be estimated from the row vector, although it may be unreliable when the vector is unstable (e.g., due to errors). Comparatively, the resolution lengths that are estimated from the column vectors of the observation-constrained parameters are reliable in this instance. Previous studies have generally employed either the direct resolution matrix or the hybrid resolution matrix as the model resolution matrix. The direct resolution matrix and hybrid resolution matrix in an inversion with damping (or general Tikhonov regularization) are Gramian (e.g., symmetric). The hybrid resolution matrix in an inversion using zero-row-sum regularization matrices (e.g., higher-order Tikhonov regularizations) is one-row-sum but is not a stochastic matrix. When the two resolution matrices appear in iterative nonlinear inversions, they are not a projection of the solution, but rather the gradient of the projection or a projection of the solution improvement immediately after a given iteration. Regardless, their resultant resolution lengths in iterative nonlinear inversions of surface-wave dispersion remain similar to those from the projection of the solution. The solution is influenced by various factors in the study, but the direct resolution matrix is derived only from the observation matrix, whereas the hybrid resolution matrix is derived from the observation and regularization matrices. The limitations imply that the appropriateness using the two resolution matrices may be questionable in practical applications. Here we propose a new complete resolution matrix to overcome the limitations, in which all of the factors (e.g., errors) in linear or nonlinear (inverse or non-inverse) studies can be incorporated. Insights on all of the above are essential for ensuring a reliable and appropriate application of the resolution matrix to appraise the model/solution and understand the relationship between the solution and all of the factors in the study system, which is also important for improving the system. [ABSTRACT FROM AUTHOR]

In this study, we consider the problem of regressing covariance matrices on associated covariates. Our goal is to use covariates to explain variation in covariance matrices across units. As such, we introduce Covariate Assisted Principal (CAP) regression, an optimization-based method for identifying components associated with the covariates using a generalized linear model approach. We develop computationally efficient algorithms to jointly search for common linear projections of the covariance matrices, as well as the regression coefficients. Under the assumption that all the covariance matrices share identical eigencomponents, we establish the asymptotic properties. In simulation studies, our CAP method shows higher accuracy and robustness in coefficient estimation over competing methods. In an example resting-state functional magnetic resonance imaging study of healthy adults, CAP identifies human brain network changes associated with subject demographics. [ABSTRACT FROM AUTHOR]

We work over an algebraically closed field of characteristic zero. For a nondegenerate projective variety X ⊆ P N , the locus of points from which X is projected nonbirationally onto its image, is called the Segre locus of X. The purpose here is to give an upper bound of the number of the irreducible components of the Segre locus of a projective variety in terms of its invariants. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Jilin University (Science Edition) / Jilin Daxue Xuebao (Lixue Ban) is the property of Zhongguo Xue shu qi Kan (Guang Pan Ban) Dian zi Za zhi She and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

We present a technique to perform dimensionality reduction on data that is subject to uncertainty. Our method is a generalization of traditional principal component analysis (PCA) to multivariate probability distributions. In comparison to non-linear methods, linear dimensionality reduction techniques have the advantage that the characteristics of such probability distributions remain intact after projection. We derive a representation of the PCA sample covariance matrix that respects potential uncertainty in each of the inputs, building the mathematical foundation of our new method: uncertainty-aware PCA. In addition to the accuracy and performance gained by our approach over sampling-based strategies, our formulation allows us to perform sensitivity analysis with regard to the uncertainty in the data. For this, we propose factor traces as a novel visualization that enables to better understand the influence of uncertainty on the chosen principal components. We provide multiple examples of our technique using real-world datasets. As a special case, we show how to propagate multivariate normal distributions through PCA in closed form. Furthermore, we discuss extensions and limitations of our approach. [ABSTRACT FROM AUTHOR]

The support vector machines (SVM) is difficult to deal with large datasets for its low training efficiency. One of the important solutions has been developed by dividing a whole dataset into smaller subsets with data partition and combining the results of the classifiers over the divided subsets. However, traditional data partition approaches are difficult to preserve the class boundary of the dataset or control the size of divided subsets, so that their performance will be greatly influenced. To overcome this difficulty, we propose an accelerator for SVM algorithm based on the local geometrical information. In this algorithm, the feature space is divided into several regions with the approximately equal number of training instances by linear projection, and then each SVM classifier trained over the extended region only predicts the unlabeled instances within that original region. The proposed algorithm can not only hold the decision boundary of the raw data, but also saves a lot of execution time for implementing it in a parallel environment. Furthermore, the number of instances within each divided regions can be effectively controlled; it is conducive to choose the complexity of the execution in each of the processors. Experiments show that the classification performance of the proposed algorithm compares favorably with four state-of-the-art algorithms with the least training time. [ABSTRACT FROM AUTHOR]

Copyright of Computer Measurement & Control is the property of Magazine Agency of Computer Measurement & Control and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In recent years, there have been several L1-norm-based linear projection methods and max–min-based dimensionality reduction methods, which show robustness to outliers and noises and show large margin for discrimination. In this paper, we propose L1-norm-based max–min large margin (MLM-L1) for linear projection-based dimensionality reduction. It makes use of the robustness of L1-norm to outliers and noises and the max–min idea for large margin. A non-greedy iterative algorithm (NMLM-L1) is proposed to solve the optimization problem of the proposed MLM-L1. Experiments on several face image databases show that the proposed method has better classification performance than its closely related methods. [ABSTRACT FROM AUTHOR]

In this paper, we consider a linear supervised dimension reduction method for classification settings: stochastic discriminant analysis (SDA). This method matches similarities between points in the projection space with those in a response space. The similarities are represented by transforming distances between points to joint probabilities using a transformation which resembles Student’s t-distribution. The matching is done by minimizing the Kullback–Leibler divergence between the two probability distributions. We compare the performance of our SDA method against several state-of-the-art methods for supervised linear dimension reduction. In our experiments, we found that the performance of the SDA method is often better and typically at least equal to the compared methods. We have made experiments with various types of data sets having low, medium, or high dimensions and quite different numbers of samples, and with both sparse and dense data sets. If there are several classes in the studied data set, the low-dimensional projections computed using our SDA method provide often higher classification accuracies than the compared methods. [ABSTRACT FROM AUTHOR]

Aimed at a low-energy consumption of Green Internet of Things (IoT), this paper presents an energy-efficient compressive image coding scheme, which provides compressive encoder and real-time decoder according to Compressive Sensing (CS) theory. The compressive encoder adaptively measures each image block based on the block-based gradient field, which models the distribution of block sparse degree, and the real-time decoder linearly reconstructs each image block through a projection matrix, which is learned by Minimum Mean Square Error (MMSE) criterion. Both the encoder and decoder have a low computational complexity, so that they only consume a small amount of energy. Experimental results show that the proposed scheme not only has a low encoding and decoding complexity when compared with traditional methods, but it also provides good objective and subjective reconstruction qualities. In particular, it presents better time-distortion performance than JPEG. Therefore, the proposed compressive image coding is a potential energy-efficient scheme for Green IoT. [ABSTRACT FROM AUTHOR]

We work over an algebraically closed field of characteristic zero. The purpose of this paper is to characterize a nondegenerate projective variety X with a linear projection which induces a nonbirational map to its image. As an application, for smooth X of degree d and codimension e, we prove the "semiampleness" of the (d - e + 1)th twist of the ideal sheaf. This improves a linear bound of the regularity of smooth projective varieties by Bayer-Mumford-Bertram-Ein-Lazarsfeld, and gives an asymptotic regularity bound. [ABSTRACT FROM AUTHOR]

In this paper, a new linear dimensionality reduction method named Two-Dimensional Discriminant Locality Preserving Projection Based on ℓ 1 -norm Maximization (2DDLPP-L1) is proposed for preprocessing of image data. 2DDLPP-L1 makes full use of the robustness of ℓ 1 -norm to noises and outliers. Furthermore, 2DDLPP-L1 is a 2D-based method which extracts image features directly from image matrices, avoiding instability and high complexity of matrix computation. Two graphs, separation graph and cohesiveness graph, are constructed with feature vectors as vertices to represent the inter-class separation and intra-class cohesiveness. An iterative algorithm with proof of convergence is proposed to solve the optimal projection matrix. Experiments on several face image databases demonstrate that the performance and robustness of 2DDLPP-L1 are better than its related methods. [ABSTRACT FROM AUTHOR]

Space partitioning trees, which sequentially divide and subdivide a space into disjoint subsets using splitting hyperplanes, play a key role in accelerating the query of samples in the cybernetics and computer vision domains. Associated methods, however, suffer from the curse of dimensionality or stringent assumptions on the data distribution. This paper presents a new concept, termed kernel dimension reduction-tree (KDR-tree), that relies on linear projections computed based on an unsupervised kernel dimension reduction approach. The proposed concept does not rely on any assumption on the data distribution and can capture higher-order statistical information encapsulated within the data. This paper then develops two variants of the KDR-tree concept: 1) to handle residual data [i.e., the residual-based KDR-tree (rKDR-tree) algorithm] and 2) to cope with larger datasets, [i.e., the sampling-based KDR-tree (sKDR-tree) algorithm]. By directly comparing the KDR-tree concept to competitive techniques, involving several benchmark datasets, this paper shows that the sKDR-tree yields a better performance for non-Gaussian distributed datasets. Based on the analysis of three datasets, this paper highlights, experimentally, that the rKDR-tree has the potential to discover the intrinsic dimension. This paper also provides a theoretical analysis about the KDR-tree concept to outline why it outperforms existing techniques if the data distribution is non-Gaussian. [ABSTRACT FROM PUBLISHER]

We study simple outer linear projections of projective varieties whose homogeneous vanishing ideal is defined by quadrics which satisfy the condition K2. We extend results on simple outer linear projections of rational normal scrolls. [ABSTRACT FROM AUTHOR]

The growing need for analyzing multivariate aspects of joint data distributions is reinforced by a diversity of experiments based on dependent outcomes. In this sense, different contexts of joint symmetry of data distributions have been dealt with extensively in both theory and practice. Univariate characterizations of properties of multivariate distributions can allow the reduction of the original problem to a substantially simpler one. We focus on research scenarios when vectors x and Ax are identically distributed, where A is a diagonal matrix and absolute values of A 's elements equal to one. It is shown that these scenarios are attractive in new characterizations of joint or mutual independence between random variables. We establish projections of the joint symmetry and independence via the one-dimensional symmetry of linear combinations of x 's components and their interactions. These projections are the most revealing of the multivariate data distribution. The usefulness of the linear projections is exemplified by constructing an efficient nonparametric exact test for joint treatment effects. In this framework, an algorithm for implementing linear projection-based tests is proven. Numerical studies based on generated vectors and a real dataset show that the proposed test can exhibit high and stable power characteristics. The present method can be also used for testing independence between symmetric random vectors. [ABSTRACT FROM AUTHOR]

Let X ⊆ ℙN be a smooth nondegenerate projective variety of dimension n ≥ 2, codimension e and degree d with the canonical line bundle ωX defined over an algebraically closed field of characteristic zero. The purpose here is to prove that the base locus of |OX(d - n - e - 1) ⊗ ω⋁X | is at most a finite set, except in a few cases. To describe the exceptional cases, we classify (not necessarily smooth) projective varieties whose generic inner projections have exceptional divisors. As applications, we prove the (d - e)-regularity of OX, Property (Nk-d+e) for OX(k), and inequalities for the delta and sectional genera. [ABSTRACT FROM AUTHOR]