1,119 research outputs found

    Difference of Normals as a Multi-Scale Operator in Unorganized Point Clouds

    Full text link
    A novel multi-scale operator for unorganized 3D point clouds is introduced. The Difference of Normals (DoN) provides a computationally efficient, multi-scale approach to processing large unorganized 3D point clouds. The application of DoN in the multi-scale filtering of two different real-world outdoor urban LIDAR scene datasets is quantitatively and qualitatively demonstrated. In both datasets the DoN operator is shown to segment large 3D point clouds into scale-salient clusters, such as cars, people, and lamp posts towards applications in semi-automatic annotation, and as a pre-processing step in automatic object recognition. The application of the operator to segmentation is evaluated on a large public dataset of outdoor LIDAR scenes with ground truth annotations.Comment: To be published in proceedings of 3DIMPVT 201

    κ·Έλž˜ν”„ μ‹ κ²½λ§μ˜ μŠ€νŽ™νŠΈλŸ΄ 해석과 κ·Έ μ‘μš©

    Get PDF
    ν•™μœ„λ…Όλ¬Έ(박사) -- μ„œμšΈλŒ€ν•™κ΅λŒ€ν•™μ› : μžμ—°κ³Όν•™λŒ€ν•™ μˆ˜λ¦¬κ³Όν•™λΆ€, 2023. 8. κ°•λͺ…μ£Ό.In this dissertation, we present a theoretical analysis of spectral-based graph neural networks and their practical performance. We analyze how the spectra of a graph Laplacian relates to the convolution operation of a graph neural network, and we discuss how expressive a graph convolutional model can be and how competent expressiveness can be achieved by implementing various convolutions on a graph based on this spectra. The results show that spectral-based graph neural networks can perform well on graph-based tasks, and we discuss what improvements can be made in the future to improve their performance in practice. As an extension, we apply it to traditional computer vision tasks in addition to graph-based tasks and show that it is comparably expressive. In addition, we present several results of its applications utilizing graphs. Specifically, we conducted experiments on the task of salient object detection using directed acyclic graphs. We also show experimental results of applying the simple model based on the theory of Fourier analysis to practical applications such as the rain removal task. These experiments empirically demonstrate that incorporating the knowledge of graph theory and Fourier analysis into the model helps improve performance.λ³Έ λˆˆλ¬Έμ—μ„œλŠ” μŠ€νŽ™νŠΈλŸΌ 기반 κ·Έλž˜ν”„ μΈκ³΅μ‹ κ²½λ§μ˜ 이둠적 뢄석과 κ·Έ μ‹€μš©μ  μ„±λŠ₯에 λŒ€ν•΄ 닀룬닀. κ·Έλž˜ν”„ μ‹ κ²½λ§μ—μ„œμ˜ μ»¨λ³Όλ£¨μ…˜ μ—°μ‚°κ³Ό λΌν”ŒλΌμ‹œμ•ˆ κ·Έλž˜ν”„μ˜ μŠ€νŽ™νŠΈλŸΌ κ°„μ˜ 관계λ₯Ό μ‘°μ‚¬ν•˜κ³ , μ–΄λ–€ κ°€μ •λ“€ ν•˜μ—μ„œ κ·Έλž˜ν”„ μ»¨λ³Όλ£¨μ…˜μ΄ μ •μ˜λ  수 있으며, κ·ΈλŸ¬ν•œ κ°€μ • μ•„λž˜μ—μ„œ μ–΄λ–€ λ°©μ‹μœΌλ‘œ κ·Έλž˜ν”„ μ»¨λ³Όλ£¨μ…˜μ„ μ •ν™•νžˆ ν‘œν˜„ν•  수 μžˆλŠ” 지에 λŒ€ν•΄ λΆ„μ„ν•˜μ˜€λ‹€. μ΄λŸ¬ν•œ 뢄석을 기반으둜 λ‹€μ–‘ν•œ κ·Έλž˜ν”„ μ»¨λ³Όλ£¨μ…˜μ„ μ‹€ν—˜ν•˜μ—¬ λͺ¨λΈμ˜ ν‘œν˜„λ ₯κ³Ό μ„±λŠ₯을 λ…Όμ˜ν•˜μ˜€λ‹€. 결과적으둜, μŠ€νŽ™νŠΈλŸΌ 기반 κ·Έλž˜ν”„ 신경망이 κ·Έλž˜ν”„ 기반 μž‘μ—…μ—μ„œ μš°μˆ˜ν•œ μ„±λŠ₯을 λ³΄μ—¬μ€Œμ„ ν™•μΈν•˜λ©°, μ‹€μ œ μ„±λŠ₯을 ν–₯μƒμ‹œν‚€κΈ° μœ„ν•œ κ°œμ„  κ°€λŠ₯ν•œ 뢀뢄에 λŒ€ν•΄ λ…Όμ˜ν•œλ‹€. λ”λΆˆμ–΄, 이둠과 적용 μ˜μ—­μ„ ν™•μž₯ν•˜μ—¬ κ·Έλž˜ν”„ 기반 μž‘μ—…λΏλ§Œ μ•„λ‹ˆλΌ 전톡적인 컴퓨터 λΉ„μ „ μž‘μ—… 등에도 μ μš©ν•  수 μžˆμŒμ„ 보여주어 μ΄λŸ¬ν•œ λ°©μ‹μ˜ ν™•μž₯성을 λ³΄μ—¬μ£Όμ—ˆλ‹€. λ§ˆμ§€λ§‰μœΌλ‘œ 이 λ…Όλ¬Έμ—μ„œλŠ” κ·Έλž˜ν”„λ₯Ό ν™œμš©ν•œ λͺ‡ 가지 μ‘μš© 사둀와 κ²°κ³Όλ₯Ό μ œμ‹œν•˜μ˜€λ‹€. ꡬ체적인 μ‹€ν—˜μœΌλ‘œ λ°©ν–₯μ„± λΉ„μˆœν™˜ κ·Έλž˜ν”„(DAG)λ₯Ό μ΄μš©ν•œ λ‘λ“œλŸ¬μ§„ 물체 κ²€μΆœ μž‘μ—…μ— λŒ€ν•œ μ‹€ν—˜μ„ μˆ˜ν–‰ν•˜μ˜€λ‹€. 이외에도 푸리에 λ³€ν™˜μ„ ν™œμš©ν•œ λͺ¨λ“ˆμ„ ν™œμš©ν•˜μ—¬ λΉ„λ₯Ό μ œκ±°ν•˜λŠ” νƒœμŠ€ν¬ 같은 μ‹€μš©μ  뢄야에 μ μš©ν•œ λͺ¨λΈκ³Ό μ‹€ν—˜ 결과듀을 μ‚΄νŽ΄λ³Έλ‹€. μ΄λŸ¬ν•œ μ‹€ν—˜λ“€μ„ 톡해, κ·Έλž˜ν”„ 이둠과 푸리에 뢄석 지식과 같은 μˆ˜ν•™μ  지식을 λͺ¨λΈμ— ν†΅ν•©ν•˜κ³  이λ₯Ό λΆ„μ„ν•˜λŠ” 것이 μ„±λŠ₯ ν–₯상에 μœ μš©ν•¨μ„ μ‹€μ¦μ μœΌλ‘œ λ³΄μ—¬μ£Όμ—ˆλ‹€.Abstract 1 Introduction 1 2 Preliminaries 4 2.1 Graph Neural Networks 4 2.1.1 Mathematical Terminologies 4 2.1.2 Graph Message Passing 5 2.1.3 Spatial-based Graph Neural Networks 6 2.1.4 Spectral-based Graph Neural Networks 8 2.2 Collaborative Filtering 8 2.3 Directed Acyclic Graphs Learning 10 3 Related Works 12 3.1 Spectral-based Graph Neural Networks 12 3.1.1 Spectral Network 12 3.1.2 ChebNet 12 3.1.3 Graph Convolutional Networks 13 3.2 Collaborative Filtering 13 3.3 Salient Object Detection 15 3.4 Rain Removal Tasks 17 4 Spectral Analysis of Graph Neural Networks 20 4.1 Schwartz space S (Rd) and Ring graph Rn 20 4.2 Convolution on General Graphs 25 5 Proposed Method 30 5.1 Proposal Background 30 5.2 Spectral GNNs to Computational Fluid Dynamics 31 5.3 Collaborative Filtering 33 5.4 Salient Object Detection 34 5.5 Rain Removal Task 36 6 Experiments 39 6.1 Spectral GNNs to Computational Fluid Dynamics 39 6.1.1 Datasets 39 6.1.2 Experimental Results 40 6.2 Collaborative Filtering 45 6.2.1 Datasets 45 6.2.2 Evaluation Metric 46 6.2.3 Bayesian Personalized Ranking 47 6.2.4 Experimental Results 49 6.3 Salient Object Detection 50 6.3.1 Datasets 50 6.3.2 Evaluation metrics 51 6.3.3 Experimental Results 52 6.4 Rain Removal Task 57 6.4.1 Datasets 57 6.4.2 Experimental Results 57 7 Conclusion 63 References 65 Abstract (in Korean) 73λ°•
    • …
    corecore