Related papers: Template banks based on $\mathbb{Z}^n$ and $A_n^*$…
When searching for new gravitational-wave or electromagnetic sources, the $n$ signal parameters (masses, sky location, frequencies,...) are unknown. In practice, one hunts for signals at a discrete set of points in parameter space, called a…
When searching for new gravitational-wave or electromagnetic sources, the $n$ signal parameters (masses, sky location, frequencies,...) are unknown. In practice, one hunts for signals at a discrete set of points in parameter space, with a…
The construction of optimal template banks for matched-filtering searches is an example of the sphere covering problem. For parameter spaces with constant-coefficient metrics a (near-) optimal template bank is achieved by the A_n* lattice,…
Template-based searches for gravitational waves are often limited by the computational cost associated with searching large parameter spaces. The study of efficient template banks, in the sense of using the smallest number of templates, is…
This paper presents an algorithm for constructing matched-filter template banks in an arbitrary parameter space. The method places templates at random, then removes those which are "too close" together. The properties and optimality of…
Gravitational wave searches are crucial for studying compact sources like neutron stars and black holes. Many sensitive modeled searches use matched filtering to compare gravitational strain data to a set of waveform models known as…
Placing signal templates (grid points) as efficiently as possible to cover a multi-dimensional parameter space is crucial in computing-intensive matched-filtering searches for gravitational waves, but also in similar searches in other…
In the companion paper, we proposed a concept of signal matched whitening filter bank and developed a time and order recursive, fast least squares algorithm for the same. Objective of part II of the paper is two fold: first is to define a…
Pattern matching is a fundamental process in almost every scientific domain. The problem involves finding the positions of a given pattern (usually of short length) in a reference stream of data (usually of large length). The matching can…
The efficient placement of signal templates in source-parameter space is a crucial requisite for exhaustive matched-filtering searches of modeled gravitational-wave sources. Unfortunately, the current placement algorithms based on regular…
In signal detection problems, one is usually faced with the task of searching a parameter space for peaks in the likelihood function which indicate the presence of a signal. Random searches have proven to be very efficient as well as easy…
We consider the fundamental problem of matching a template to a signal. We do so by M-estimation, which encompasses procedures that are robust to gross errors (i.e., outliers). Using standard results from empirical process theory, we derive…
A fundamental quantity in signal analysis is the metric $g_{ab}$ on parameter space, which quantifies the fractional "mismatch" $m$ between two (time- or frequency-domain) waveforms. When searching for weak gravitational-wave or…
In most computer vision and image analysis problems, it is necessary to define a similarity measure between two or more different objects or images. Template matching is a classic and fundamental method used to score similarities between…
Template matching is a basic method in image analysis to extract useful information from images. In this paper, we suggest a new method for pattern matching. Our method transform the template image from two dimensional image into one…
Recent gravitational-wave observations have begun to constrain the internal physics of neutron stars. However, current detection searches for neutron star systems assume that potential neutron stars are low-mass black holes, ignoring any…
The problem of frequent pattern mining from non-temporal databases is studied extensively by various researchers working in areas of data mining, temporal databases and information retrieval. However, Conventional frequent pattern…
Accurate signal localization is critical for Internet of Things applications, but precise propagation models are often unavailable due to uncontrollable factors. Simplified models such as planar and spherical wavefront approximations are…
Recognising and locating image patches or sets of image features is an important task underlying much work in computer vision. Traditionally this has been accomplished using template matching. However, template matching is notoriously…
In this paper, we define a concept of signal matched multirate whitening filter bank which provides an optimum coding gain. This is achieved by whitening the outputs, of the analysis filter bank, within as well as across the channels, by…