Related papers: A fast point-pattern matching algorithm based on s…
Superpixels have become very popular in many computer vision applications. Nevertheless, they remain underexploited since the superpixel decomposition may produce irregular and non stable segmentation results due to the dependency to the…
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…
Identification of linear features (streaks) in astronomical images is important for several reasons, including: detecting fast-moving near-Earth asteroids; detecting or flagging faint satellites streaks; and flagging or removing diffraction…
A novel minutia-based fingerprint matching algorithm is proposed that employs iterative global alignment on two minutia sets. The matcher considers all possible minutia pairings and iteratively aligns the two sets until the number of…
In this paper we describe a new method for detecting and counting a repeating object in an image. While the method relies on a fairly sophisticated deformable part model, unlike existing techniques it estimates the model parameters in an…
A robust 3D object tracker which continuously tracks surrounding objects and estimates their trajectories is key for self-driving vehicles. Most existing tracking methods employ a tracking-by-detection strategy, which usually requires…
Cardinality matching is a computational method for finding the largest possible number of matched pairs of exposed and unexposed individuals from an observational dataset, with specified patterns of baseline characteristics that represent a…
We present an algorithm implemented in the astroalign Python module for image registration in astronomy. Our module does not rely on WCS information and instead matches 3-point asterisms (triangles) on the images to find the most accurate…
The paper focuses on Image Compression, explaining efficient approaches based on Frequent Pattern Mining(FPM). The proposed compression mechanism is based on clustering similar pixels in the image and thus using cluster identifiers in image…
Large, multi-frequency imaging surveys, such as the Large Synaptic Survey Telescope (LSST), need to do near-real time analysis of very large datasets. This raises a host of statistical and computational problems where standard methods do…
Matching astronomical catalogs in crowded regions of the sky is challenging both statistically and computationally due to the many possible alternative associations. Budav\'ari and Basu (2016) modeled the two-catalog situation as an…
We present a method for detecting cosmic rays in single images. The algorithm is based on simple analysis of the histogram of the image data and does not use any modeling of the picture of the object. It does not require a good signal to…
The identification of physically associated kiloparsec-scale quasar pairs is important for understanding galaxy evolution, the growth of supermassive black holes, and their co-evolution with host galaxies. However, their rarity and the high…
The goal of the proposed method is to directly obtain a pose matrix of a known rectangular target, without estimation, using geometric techniques. This method is specifically tailored for real-time, extreme imaging setups exceeding…
Young, intermediate-mass stars are experiencing renewed interest as targets for direct-imaging planet searches. However, these types of stars are part of multiple systems more often than not. Close stellar companions affect the formation…
This paper offers a new authentication algorithm based on image matching of nano-resolution visual identifiers with tree-shaped patterns. The algorithm includes image-to-tree conversion by greedy extraction of the fractal pattern skeleton…
The matching of sources between photometric catalogues can lead to cases where objects of differing brightness are incorrectly assumed to be detections of the same source. The rejection of unphysical matches can be achieved through the…
This paper introduces an astronomical image alignment algorithm. This algorithm uses the means of the rows and columns of the original image for alignment, and finds the optimal offset corresponding to the maximum similarity by comparing…
Image matching is a key component of many tasks in computer vision and its main objective is to find correspondences between features extracted from different natural images. When images are represented as graphs, image matching boils down…
In this paper, we consider the problem of finding the feature correspondences among a collection of feature sets, by using their point-wise unary features. This is a fundamental problem in computer vision and pattern recognition, which also…