Graph Signal Denoising Method Using the K-Nearest Neighbors Found by Dijkstra's Algorithm

Author(s):  
Chien-Cheng Tseng ◽  
Su-Ling Lee
2021 ◽  
pp. 1-10
Author(s):  
Jin Xu ◽  
Tong Li

In order to improve the teaching effect of American science fiction literature, based on artificial intelligence virtual reality technology, this paper constructs an auxiliary teaching system of intelligent American science fiction literature. Moreover, this paper analyzes the time complexity and space complexity of constructing point cloud spatial topological relations and finding the nearest k neighboring points. Simultaneously, this paper uses CUDA to find k nearest neighbors on the GPU, analyzes the point cloud denoising technology, uses the KD-tree to construct the point cloud topology in the DBSCAN-based denoising method, searches for the k nearest neighbors to complete the mark of the core point and the boundary point. In addition, this paper combines artificial intelligence virtual technology and intelligent algorithms to construct the framework of the auxiliary teaching system of American science fiction literature, and analyze its functional modules. Finally, this paper designs experiments to verify the performance of the model. The research results show that the system constructed in this paper can meet the needs of auxiliary teaching of American science fiction literature.


Mathematics ◽  
2021 ◽  
Vol 9 (7) ◽  
pp. 779
Author(s):  
Ruriko Yoshida

A tropical ball is a ball defined by the tropical metric over the tropical projective torus. In this paper we show several properties of tropical balls over the tropical projective torus and also over the space of phylogenetic trees with a given set of leaf labels. Then we discuss its application to the K nearest neighbors (KNN) algorithm, a supervised learning method used to classify a high-dimensional vector into given categories by looking at a ball centered at the vector, which contains K vectors in the space.


Sensors ◽  
2021 ◽  
Vol 21 (12) ◽  
pp. 3994
Author(s):  
Yuxi Li ◽  
Fucai Zhou ◽  
Yue Ge ◽  
Zifeng Xu

Focusing on the diversified demands of location privacy in mobile social networks (MSNs), we propose a privacy-enhancing k-nearest neighbors search scheme over MSNs. First, we construct a dual-server architecture that incorporates location privacy and fine-grained access control. Under the above architecture, we design a lightweight location encryption algorithm to achieve a minimal cost to the user. We also propose a location re-encryption protocol and an encrypted location search protocol based on secure multi-party computation and homomorphic encryption mechanism, which achieve accurate and secure k-nearest friends retrieval. Moreover, to satisfy fine-grained access control requirements, we propose a dynamic friends management mechanism based on public-key broadcast encryption. It enables users to grant/revoke others’ search right without updating their friends’ keys, realizing constant-time authentication. Security analysis shows that the proposed scheme satisfies adaptive L-semantic security and revocation security under a random oracle model. In terms of performance, compared with the related works with single server architecture, the proposed scheme reduces the leakage of the location information, search pattern and the user–server communication cost. Our results show that a decentralized and end-to-end encrypted k-nearest neighbors search over MSNs is not only possible in theory, but also feasible in real-world MSNs collaboration deployment with resource-constrained mobile devices and highly iterative location update demands.


Sign in / Sign up

Export Citation Format

Share Document