English
Related papers

Related papers: Binary Matrices under the Microscope: A Tomographi…

200 papers

This work describes a full Bayesian analysis of the Nearby Universe as traced by galaxies of the 2M++ survey. The analysis is run in two sequential steps. The first step self-consistently derives the luminosity dependent galaxy biases, the…

Cosmology and Nongalactic Astrophysics · Physics 2015-12-09 Guilhem Lavaux , Jens Jasche

Two-Photon Laser-Scanning Microscopy is a powerful tool for exploring biological structure and function because of its ability to optically section through a sample with a tight focus. While it is possible to obtain 3D image stacks by…

Biological Physics · Physics 2020-01-08 Courtney Johnson , Jack Exell , Jonathon Kuo , Kevin Welsher

Imaging is of great importance in everyday life and various fields of science and technology. Conventional imaging is achieved by bending light rays originating from an object with a lens. Such ray bending requires space-variant structures,…

Optics · Physics 2023-10-02 Wenzhe Liu , Jingguang Chen , Tongyu Li , Zhe Zhang , Fang Guan , Lei Shi , Jian Zi , C. T. Chan

There is growing body of learning problems for which it is natural to organize the parameters into matrix, so as to appropriately regularize the parameters under some matrix norm (in order to impose some more sophisticated prior knowledge).…

Machine Learning · Computer Science 2010-10-19 Sham M. Kakade , Shai Shalev-Shwartz , Ambuj Tewari

Two dimensional matrices with binary (0/1) entries are a common data structure in many research fields. Examples include ecology, economics, mathematics, physics, psychometrics and others. Because the columns and rows of these matrices…

The problem of estimating the total mass of a visual binary when its orbit is incomplete is treated with Bayesian methods. The posterior mean of a mass estimator is approximated by a triple integral over orbital period, time of periastron…

Solar and Stellar Astrophysics · Physics 2015-06-17 L. B. Lucy

This paper studies the unitary diagonalization of matrices over formal power series rings. Our main result shows that a normal matrix is unitarily diagonalizable if and only if its minimal polynomial completely splits over the ring and the…

Commutative Algebra · Mathematics 2026-02-10 Zihao Dai , Hao Liang , Jingyu Lu , Lihong Zhi

Convexity prior is one of the main cue for human vision and shape completion with important applications in image processing, computer vision. This paper focuses on characterization methods for convex objects and applications in image…

Computer Vision and Pattern Recognition · Computer Science 2022-10-05 Shousheng Luo , Jinfeng Chen , Yunhai Xiao , Xue-Cheng Tai

Eclipsing binaries provide one of the most direct mechanisms for measuring stellar properties such as mass and radius, but historically, determining these properties has been non-trivial and computationally prohibitive. As such, only a…

We consider the problem of reconstructing binary images from their horizontal and vertical projections. For any reconstruction we define the length of the boundary of the image. In this paper we assume that the projections are monotone, and…

Combinatorics · Mathematics 2010-11-25 Birgit van Dalen

Astrometric observations of microlensing events were originally proposed to determine the lens proper motion with which the physical parameters of lenses can be better constrained. In this proceeding, we demonstrate that besides this…

Astrophysics · Physics 2007-05-23 Cheongho Han

Boolean matrix factorization (BMF) has many applications in data mining, bioinformatics, and network analysis. The goal of BMF is to decompose a given binary matrix as the Boolean product of two smaller binary matrices, revealing underlying…

Commutative Algebra · Mathematics 2025-09-12 Juliann Geraci , Alexander B. Kunin , Alexandra Seceleanu

In subset selection we search for the best linear predictor that involves a small subset of variables. From a computational complexity viewpoint, subset selection is NP-hard and few classes are known to be solvable in polynomial time. Using…

Optimization and Control · Mathematics 2020-02-07 Alberto Del Pia , Santanu S. Dey , Robert Weismantel

A new principle of subwavelength imaging based on frequency scanning is considered. It is shown that it is possible to reconstruct the spatial profile of an external field exciting an array (or coupled arrays) of subwavelength-sized…

Optics · Physics 2008-06-27 Stanislav Maslovski , Pekka Alitalo , Sergei Tretyakov

We investigate the existence of heavy columns in binary matrices with distinct rows. A column of an m x n binary matrix is called heavy if the number of ones in it is at least m/2. We introduce two recursive algorithms, A1 and A2, that…

Discrete Mathematics · Computer Science 2026-01-27 Jamolidin K. Abdurakhmanov

The use of high-dimensional features has become a normal practice in many computer vision applications. The large dimension of these features is a limiting factor upon the number of data points which may be effectively stored and processed,…

Computer Vision and Pattern Recognition · Computer Science 2015-06-18 Sakrapee Paisitkriangkrai , Chunhua Shen , Anton van den Hengel

The alternate row and column scaling algorithm applied to a positive $n\times n$ matrix $A$ converges to a doubly stochastic matrix $S(A)$, sometimes called the \emph{Sinkhorn limit} of $A$. For every positive integer $n$, a two parameter…

Number Theory · Mathematics 2020-04-17 Melvyn B. Nathanson

We discuss whether one should expect that multiply imaged QSOs can be understood with `simple' lens models which contain a handful of parameters. Whereas for many lens systems such simple mass models yield a remarkably good description of…

Astrophysics · Physics 2009-10-30 Shude Mao , Peter Schneider

Random matrix theory is a well-developed area of probability theory that has numerous connections with other areas of mathematics and its applications. Much of the literature in this area is concerned with matrices that possess many exact…

Probability · Mathematics 2018-06-22 Ramon van Handel

We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…

Numerical Analysis · Mathematics 2025-08-14 Elias Jarlebring , Gustaf Lorentzon