相关论文: Methods for Rapidly Processing Angular Masks of Ne…

Superpixel segmentation can be used as an intermediary step in many applications, often to improve object delineation and reduce computer workload. However, classical methods do not incorporate information about the desired object.…

We present a new algorithm for efficiently computing the $N$-point correlation functions (NPCFs) of a 3D density field for arbitrary $N$. This can be applied both to a discrete spectroscopic galaxy survey and a continuous field. By…

We introduce space-efficient plane-sweep algorithms for basic planar geometric problems. It is assumed that the input is in a read-only array of $n$ items and that the available workspace is $\Theta(s)$ bits, where $\lg n \leq s \leq n…

We measure the angular clustering of galaxies from the Sloan Digital Sky Survey Data Release 7 in order to probe the spatial distribution of satellite galaxies within their dark matter halos. Specifically, we measure the angular correlation…

In this paper, we develop a new method for the fast and memory-efficient computation of Slepian functions on the sphere. Slepian functions, which arise as the solution of the Slepian concentration problem on the sphere, have desirable…

Galaxy morphology is a fundamental quantity, that is essential not only for the full spectrum of galaxy-evolution studies, but also for a plethora of science in observational cosmology. While a rich literature exists on…

A fundamental problem in computational geometry is to compute an obstacle-avoiding Euclidean shortest path between two points in the plane. The case of this problem on polygonal obstacles is well studied. In this paper, we consider the…

The panoptic segmentation task requires a unified result from semantic and instance segmentation outputs that may contain overlaps. However, current studies widely ignore modeling overlaps. In this study, we aim to model overlap relations…

We propose a technique called Rotate-and-Kill for solving the polygon inclusion and circumscribing problems. By applying this technique, we obtain $O(n)$ time algorithms for computing (1) the maximum area triangle in a given $n$-sided…

We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used between any two successive levels of resolution satisfies some…

Context. A key property of massive stars is their high degree of multiplicity, which can impact their evolution and end-of-life products. The Southern Massive Stars at High Angular Resolution survey (smash+) use interferometric and…

With the growing amount of astronomical data, there is an increasing need for automated data processing pipelines, which can extract scientific information from observation data without human interventions. A critical aspect of these…

Face segmentation is the task of densely labeling pixels on the face according to their semantics. While current methods place an emphasis on developing sophisticated architectures, use conditional random fields for smoothness, or rather…

We consider the problem of cutting a set of edges on a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total number of cut edges or their total length. We show that this…

High-throughput computational screening of polymers offers a powerful way to address the imbalance between the vast number of polymers synthesised for diverse applications and the relatively small subset that can be studied using atomistic…

Modern cosmological observations clearly reveal that the universe contains a hierarchy of clustering. However, recent surveys show a transition to homogeneity on large scales. The exact scale at which this transition occurs is still a topic…

We perform two-dimensional, Point-Spread-Function-convolved, bulge+disk decompositions in the $g$ and $r$ bandpasses on a sample of 1,123,718 galaxies from the Legacy area of the Sloan Digital Sky Survey Data Release Seven. Four different…

The derivation of cosmological parameters from astrophysical data sets routinely involves operations counts which scale as O(N^3) where N is the number of data points. Currently planned missions, including MAP and Planck, will generate sky…

The scale of ongoing and future electromagnetic surveys pose formidable challenges to classify astronomical objects. Pioneering efforts on this front include citizen science campaigns adopted by the Sloan Digital Sky Survey (SDSS). SDSS…

Medical image segmentation is a fundamental task in medical image analysis. Despite that deep convolutional neural networks have gained stellar performance in this challenging task, they typically rely on large labeled datasets, which have…