During the last decades, learning a low-dimensional space with discriminative information for dimension reduction (DR) has gained a surge of interest. However, it is not accessible for these DR methods to achieve sati...
详细信息
During the last decades, learning a low-dimensional space with discriminative information for dimension reduction (DR) has gained a surge of interest. However, it is not accessible for these DR methods to achieve satisfactory performance when dealing with the features from multiple views. For multi-view learning problems, one instance can be represented by multiple heterogeneous features, which are highly relevant but sometimes look different from each other. In addition, correlations between features from multiple views always vary greatly, which challenges the capability of multi-view learning methods. Consequently, constructing a multi-view learning framework with generalization and scalability, which could take advantage of multi-view information as much as possible, is extremely necessary but challenging. To implement the above target, this paper proposes a novel multi-view learning framework based on similarity consensus, which makes full use of correlations among multi-view features while considering the scalability and robustness of the framework. It aims to straightforwardly extend those existing DR methods into multi-view learning domain by preserving the similarity consensus between different views to capture the low-dimensional embedding. Two schemes based on pairwise-consensus and centroid-consensus are separately proposed to force multiple views to learn from each other, then an iterative alternating strategy is developed to obtain the optimal solution. The proposed method is evaluated on 5 benchmark datasets and comprehensive experiments show that our proposed multi-view framework can yield comparable and promising performance with some famous methods. (C) 2020 Elsevier B.V. All rights reserved.
The volume of a solid enclosed by a recursive subdivision surface can be approximated based on the closed-form representation of regular parts of the subdivision. surface and a tight estimate of the local convex hull ...
详细信息
The volume of a solid enclosed by a recursive subdivision surface can be approximated based on the closed-form representation of regular parts of the subdivision. surface and a tight estimate of the local convex hull near extraordinary points. The approach presented is efficient, i.e. non-exponential, and robust in that it yields rapidly contracting error bounding boxes. An extension to measuring higher-order moments is sketched.
The widespread use of the Internet of Things makes it relevant to use public IP networks for simultaneous access by both users and wireless sensors. To achieve this, a significant reduction in the subscriber devices&#...
详细信息
The widespread use of the Internet of Things makes it relevant to use public IP networks for simultaneous access by both users and wireless sensors. To achieve this, a significant reduction in the subscriber devices' energy consumption is required. This paper analyzes the application features of the collective dynamic routing method both with and without the use of a robust method for estimating the channel data rate for sensors' communication in wireless public networks. Based on the analysis, a novel modification of the collective dynamic routing method has been developed that reduces the sensors' energy consumption while keeping a high data rate and short delivery time for users. An analysis of the network load, the total data transfer rate over the network, and the parameters affecting the sensors' energy consumption was carried out for a segment of a seamless IEEE 802.11ax network. The simulation demonstrated a high efficiency of using a novel modification of the collective dynamic routing method for access to users and wireless sensors.
This paper extends the method for the construction of the intersection graph, which was proposed by the authors for polyhedral solids, to curved solids. In order to be robust against numerical errors, the method explo...
详细信息
This paper extends the method for the construction of the intersection graph, which was proposed by the authors for polyhedral solids, to curved solids. In order to be robust against numerical errors, the method exploits the topological connectivity properties of the edge-face intersection points. Furthermore, as a part of the algorithm for the construction of the intersection graph, this paper presents a new method for the computation of the tangent points between an intersection curve and a boundary curve of a surface.
In news streams,there are often several important events and many minor *** by this phenomenon,recent burst feature detection algorithms capture many trivial *** capture the important bursts only,this paper proposed a...
详细信息
In news streams,there are often several important events and many minor *** by this phenomenon,recent burst feature detection algorithms capture many trivial *** capture the important bursts only,this paper proposed a novel algorithm based on the idea of entropy *** the entropy maximization method does not work well when dealing with unbalanced data,we propose our robust entropy maximization ***,we reconstruct the problem into the division of the burst set into important and trivial bursts that are distributed as uniformly as *** with public data set proved that our algorithm can effectively capture the important bursts when the data is either balanced or unbalanced.
In this paper a new watermarking algorithm in the complex wavelet domain is *** shows why complex wavelets are better than real *** improved the embedding scheme by selecting the embedding channels and using the visua...
详细信息
In this paper a new watermarking algorithm in the complex wavelet domain is *** shows why complex wavelets are better than real *** improved the embedding scheme by selecting the embedding channels and using the visual masking of *** the method adapted the watermark to the local image *** compare the proposed algorithm in CWT domain with equivalent one derived in the DWT domain,the same embedding procedure is applied in DWT *** of both algorithms on selected attacks like JPEG,JPEG2000 compressions,different filtering *** tested and compared by using the benchmark software *** experiment results showed the algorithm improved the redundancy of the algorithm,it also strengthen the method robustness feature.
暂无评论