lattice_peps: Computes contiguous candidate groups on a lattice R^d

In amspector100/blipr: A Bayesian Linear Program for resolution-adaptive signal detection

Computes contiguous candidate groups on a lattice R^d

Description

Computes contiguous candidate groups on a lattice R^d

Usage

lattice_peps(
  locs,
  grid_sizes,
  extra_centers = NULL,
  max_pep = 0.25,
  shape = "square",
  log_interval = NULL
)

Arguments

locs	A (N, num_disc, d)-dimensional array. Here, N is the number of samples from the posterior, d is the number of dimensions of the space, and each point corresponds to a signal in a particular posterior sample.
grid_sizes	List of grid sizes to split up the locations. The grid size is inversely proportional to the distance between lattice points.
extra_centers	An (ncenters, d)-dimensional matrix. At each resolution, candidate groups will be computed with centers at this location.
max_pep	The maximum allowable PEP for output candidate groups. Defaults to 0.25.
shape	One of ('circle', 'square').
log_interval	if not NULL, will log progress every log_interval updates.

Value

list of candidate groups

amspector100/blipr documentation built on June 22, 2022, 2:43 a.m.