Related papers: Distant Cluster Search: Welcoming some Newcomers f…

A novel nonparametric clustering algorithm is proposed using the interpoint distances between the members of the data to reveal the inherent clustering structure existing in the given set of data, where we apply the classical nonparametric…

This paper presents 19 additional candidate clusters detected using the galaxy catalog extracted from the I-band images taken for the ESO Imaging Survey (EIS). The candidates are found over a region of 1.1 square degrees, located near the…

The imaging data assembled by the recently completed ESO Imaging Survey (EIS) are reviewed and their scientific value briefly assessed. Among the various applications, the imaging data has been used to build a large sample of candidate…

We present here the results of a statistical search for cluster alignments using the Edinburgh/Milano cluster redshift survey. This survey is a unique cluster database which has been objectively constructed to help minimise the systematic…

Automated search for star clusters in J,H,K_s data from 2MASS catalog has been performed using the method developed by Koposov et. al (2008). We have found and verified 153 new clusters in the interval of the galactic latitude -24 < b < 24…

Image clustering is a very useful technique that is widely applied to various areas, including remote sensing. Recently, visual representations by self-supervised learning have greatly improved the performance of image clustering. To…

We present an optically selected galaxy cluster catalog from ~ 2,700 square degrees of the Digitized Second Palomar Observatory Sky Survey (DPOSS), spanning the redshift range 0.1 < z < 0.5, providing an intermediate redshift supplement to…

This paper aims at a newly raising task in visual surveillance: re-identifying people at a distance by matching body information, given several reference examples. Most of existing works solve this task by matching a reference template with…

Evaluating the performance of clustering models is a challenging task where the outcome depends on the definition of what constitutes a cluster. Due to this design, current existing metrics rarely handle multiple clustering models with…

We present preliminary results of a simple peak finding algorithm applied to catalogues of galaxies, extracted from the Second Palomar Sky Survey in the framework of the CRoNaRio project. All previously known Abell and Zwicky clusters in a…

A novel and intuitive nearest neighbours based clustering algorithm is introduced, in which a cluster is defined in terms of an equilibrium condition which balances its size and cohesiveness. The formulation of the equilibrium condition…

This paper reports the results obtained on the photometric redshifts measurement and accuracy, and cluster tomography in the ESO Distant Cluster Survey (EDisCS) fields. Photometric redshifts were computed using two independent codes (Hyperz…

We investigate, using simulated galaxy catalogues, the completeness of searches for massive clusters of galaxies in redshift surveys or imaging surveys with photometric redshift estimates, i.e. what fraction of clusters (M>10^14/h Msun) are…

Determining optimal number of clusters in a dataset is a challenging task. Though some methods are available, there is no algorithm that produces unique clustering solution. The paper proposes an Automatic Merging for Single Optimal…

We propose a simple and efficient clustering method for high-dimensional data with a large number of clusters. Our algorithm achieves high-performance by evaluating distances of datapoints with a subset of the cluster centres. Our…

We propose a new clustering technique that can be regarded as a numerical method to compute the proximity gestalt. The method analyzes edge length statistics in the MST of the dataset and provides an a contrario cluster detection criterion.…

We describe an objective and automated method for detecting clusters of galaxies from optical imaging data. This method is a variant of the so-called `matched-filter' technique pioneered by Postman et al. (1996). With simultaneous use of…

We present a new galaxy cluster search in the COSMOS field through the use of the Adaptive Matched Identifier of Clustered Objects (AMICO). We produced a new cluster and group catalogue up to $z=2$, by performing an innovative application…

We present a selection of candidates of clusters and protoclusters of galaxies identified in the photometric data of the HSC-SSP Wide Public Data Release 3 (PDR3), spanning the redshift range $\rm 0.1 \leq z \leq 2$. The selection method,…

Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model we assume that we have access to one versus all queries that…