The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Traditional algorithm of global dimensionality reduction such as PCA, MDS and Isomap, measure the relation of data by distance, this paper gives an angle measurement approach for the relation of data. Based on the theoretic analysis, a novel angle optimized global embedding (AOGE) algorithm is proposed, which measured the relation of data by the angles between the centralized samples and their orthogonal...
We develop a new SAR processor based on several orthogonal projections.We take into account the scattering properties of the target and the interferences by using subspace models. To detect the target without detecting the interferences, we process images from the orthogonal projection of the received signal into the target subspace and from the orthogonal projection of the received signal into a...
Support vector machine (SVM) classifiers often contain many SVs, which lead to high computational cost at runtime and potential overfitting. In this paper, a practical and effective method of pruning SVM classifiers is systematically developed. The kernel row vectors, with one-to-one correspondence to the SVs, are first organized into clusters. The pruning work is divided into two phases. In the first...
A convex polyhedron P is k-equiprojective if for all of its orthogonal projections, except those parallel to the faces of P, the number of vertices in the shadow boundary is k. Finding an algorithm to construct all equiprojective polyhedra is an open problem first posed in 1968. In this paper we give lower bounds on the value of k and the size of an equiprojective polyhedron. We prove that there is...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.