Tracer-field cross-correlations with <i>k</i>-nearest neighbour distributions
نویسندگان
چکیده
ABSTRACT In astronomy and cosmology significant effort is devoted to characterizing understanding spatial cross-correlations between points – e.g galaxy positions, high energy neutrino arrival directions, X-ray AGN sources, continuous fields e.g. weak lensing meiand Cosmic Microwave Background maps. Recently, we introduced the k-nearest neighbour (kNN) formalism better characterize clustering of discrete (point) data sets. Here, extend it point field analysis. It combines kNN measurements set with smoothed at many scales. The resulting statistics are sensitive all orders in joint field. We demonstrate that this approach, unlike 2-pt cross-correlation, can measure statistical dependence two sets even when there no linear (Gaussian) correlations them. further framework far more effective than function detecting contaminated by levels noise. For a particularly level noise, cross-correlation haloes underlying matter cosmological simulation, 10 h−1 Mpc 30 Mpc, detected &gt;5σ significance using technique presented here, two-point ∼1σ. Finally, show be well modelled on quasi-linear scales Hybrid Effective Field Theory (HEFT) framework, same bias parameters as used for cross-correlations. substantial improvement power method makes promising tool various applications.
منابع مشابه
TERZIĆ: SHAPE DETECTION WITH NEAREST NEIGHBOUR CONTOUR FRAGMENTS 1 Shape Detection with Nearest Neighbour Contour Fragments
We present a novel method for shape detection in natural scenes based on incomplete contour fragments and nearest neighbour search. In contrast to popular methods which employ sliding windows, chamfer matching and SVMs, we characterise each contour fragment by a local descriptor and perform a fast nearest-neighbour search to find similar fragments in the training set. Based on this idea, we sho...
متن کاملk-Nearest Neighbour Classifiers
Perhaps the most straightforward classifier in the arsenal or machine learning techniques is the Nearest Neighbour Classifier – classification is achieved by identifying the nearest neighbours to a query example and using those neighbours to determine the class of the query. This approach to classification is of particular importance today because issues of poor run-time performance is not such...
متن کاملEnhanced Nearest Neighbour
Multimedia databases usually deal with huge amounts of data and it is necessary to have an indexing structure such that eecient retrieval of data can be provided. R-Tree with its variations, is a commonly cited indexing method. In this paper we propose an improved nearest neighbor search algorithm on the R-tree and its variants. The improvement lies in the removal of two hueristics that have be...
متن کاملINSTANCE-BASED LEARNING: Nearest Neighbour with Generalisation
Instance-based learning is a machine learning method that classifies new examples by comparing them to those already seen and in memory. There are two types of instance-based learning; nearest neighbour and case-based reasoning. Of these two methods, nearest neighbour fell into disfavour during the 1980s, but regained popularity recently due to its simplicity and ease of implementation. Nearest...
متن کاملShape Detection with Nearest Neighbour Contour Fragments
Shape is probably the single most important feature for object detection and much research has gone into developing deformable shape models. However, contours extracted by bottom-up edge detectors are notoriously unreliable, especially in natural images. In this paper, we present a very simple, yet powerful method for model creation, hypothesis generation, and hypothesis verification, which is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Monthly Notices of the Royal Astronomical Society
سال: 2022
ISSN: ['0035-8711', '1365-8711', '1365-2966']
DOI: https://doi.org/10.1093/mnras/stac3813