Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,878 papers · 148 categories

Trend · papers per month

1.6%3.2%4.8%6.5% · Dec 199719922001200920172026
48 results for Virtual Staining

A deep model learns to infer fluorescence labels from unlabeled microscopy images.

problem Challenges in obtaining high quality images of cellular structures due to complex environments and label staining limitations.
method Developed a novel deep model using global pixel transformer layers and dense blocks, incorporating multi-scale input strategy.
result Significantly outperforms state-of-the-art methods in fluorescence image prediction tasks.

An important part of Digital Pathology is the analysis of multiple digitised whole slide images from differently stained tissue sections. It is common practice to mount consecutive sections containing corresponding microscopic structures on glass slides, and to stain them differently to highlight specific tissue compon…

2018-10-17abs ↗pdf ↗

Stem uses diffusion models to infer gene expression from H&E images.

problem Inference of gene expression from H&E stained images is time-consuming and expensive.
method Conditional diffusion generative model to infer gene expression.
result Stem achieves state-of-the-art performance in spatial gene expression prediction.

Study proposes deep learning techniques to diagnose and differentiate Celiac Disease and Environmental Enteropathy from biopsy images.

problem Challenging histopathologic overlap between Celiac Disease and Environmental Enteropathy in biopsy images.
method Color balancing and Random Multimodel Deep Learning (RMDL) architecture to address staining variability.
result Proposed deep learning techniques improve diagnosis accuracy of Celiac Disease and Environmental Enteropathy.

Determining the localization of specific protein in human cells is important for understanding cellular functions and biological processes of underlying diseases. Among imaging techniques, high-throughput fluorescence microscopy imaging is an efficient biotechnology to stain the protein of interest in a cell. In this w…

2019-01-27abs ↗pdf ↗

A novel approach for augmenting histopathological images by blending Gaussian-Laplacian pyramids.

problem Data imbalance and inter-patient variability in histopathological images.
method Image blending using Gaussian-Laplacian pyramids to distribute inter-patient variability.
result Promising gains in performance compared to existing data augmentation techniques.

Refines virtual link equality criterion for diagrams with one virtual crossing.

problem Determining when a virtual link diagram represents a properly virtual link.
method Refines the Kauffman-Murasugi-Thislethwaite type inequality for virtual links.
result Criterion for virtual link diagrams with exactly one virtual crossing to represent a properly virtual link.

The virtual unknotting number of a virtual knot is the minimal number of crossing changes that makes the virtual knot to be the unknot, which is defined only for virtual knots virtually homotopic to the unknot. We focus on the virtual knot obtained from the standard (p,q)-torus knot diagram by replacing all crossings o…

2017-01-15abs ↗pdf ↗

This paper connects virtual biquandles to biquandles for virtual link colorings.

problem Extending invariants from biquandles to virtual biquandles.
method Establishing equivalence between two representations of virtual braid groups and introducing new labeling rules.
result The number of colorings of a virtual link by virtual biquandles can be recovered from colorings by biquandles.

A virtual string can be defined as an equivalence class of planar diagrams under certain kinds of diagrammatic moves. Virtual strings are related to virtual knots in that a simple operation on a virtual knot diagram produces a diagram for a virtual string. In this paper we consider three operations on a virtual string …

2008-08-04abs ↗pdf ↗

A virtual nn-string is a chord diagram with nn core circles and a collection of arrows between core circles. We consider virtual nn-strings up to virtual homotopy, compositions of flat virtual Reidemeister moves on chord diagrams. Given a virtual 1-string αα, Turaev associated a based matrix that encodes invariants…

2017-09-02abs ↗pdf ↗

Given a virtual knot KK, we construct a group VGKVG_K called the virtual knot group, and we use the elementary ideals of VGKVG_K to define invariants of KK called the virtual Alexander invariants. For instance, associated to the k=0k=0 ideal is a polynomial HK(s,t,q)H_K(s,t,q) in three variables which we call the virtual Alexa…

2014-09-04abs ↗pdf ↗

A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative. Normal virtual links have some properties similar to classical links.In this paper, we introduce a method of converting a virtual link d…

2017-12-25abs ↗pdf ↗

Virtual singular braids are generalizations of singular braids and virtual braids. We define the virtual singular braid monoid via generators and relations, and prove Alexander- and Markov-type theorems for virtual singular links. We also show that the virtual singular braid monoid has another presentation with fewer g…

2015-04-05abs ↗pdf ↗

Virtual knot theory, introduced by Kauffman, is a generalization of classical knot theory of interest because its finite-type invariant theory is potentially a topological interpretation of Etingof and Kazhdan's theory of quantization of Lie bi-algebras. Classical knots inject into virtual knots, and flat virtual knots…

2012-09-20abs ↗pdf ↗

The aim of the present paper is to prove that the minimal number of virtual crossings for some families of virtual knots grows quadratically with respect to the minimal number of classical crossings. All previously known estimates for virtual crossing number were principally no more than linear in the number of classic…

2011-07-25abs ↗pdf ↗

A virtual link can be understood as a link in a trivial I-bundle over an orientable compact surface with genus. A twisted virtual link is a link in a trivial I-bundle over a not-necessarily orientable compact surface. A twisted virtual birack is an algebraic structure with axioms derived from the twisted virtual Reidem…

2011-05-27abs ↗pdf ↗

We introduce a theory of virtual Legendrian knots. A virtual Legendrian knot is a cooriented wavefront on an oriented surface up to Legendrian isotopy of its lift to the unit cotangent bundle and stabilization and destablization of the surface away from the wavefront. We show that the groups of Vassiliev invariants of …

2013-05-23abs ↗pdf ↗

The paper characterizes crystallographic groups derived from virtual braid and twin groups.

problem Characterizing crystallographic groups from virtual braid and twin groups.
method Analyzing quotients of virtual braid and twin groups by their commutator subgroups.
result The quotients of virtual braid and twin groups by their commutator subgroups are crystallographic groups.

We generalize unoriented handlebody-links to the twisted virtual case, obtaining Reidemeister moves for handlebody-links in ambient spaces of the form Σ×[0,1]Σ\times [0,1] for ΣΣ a compact closed 2-manifold up to stable equivalence. We introduce a related algebraic structure known as twisted virtual bikeigebras whose axiom…

2017-11-12abs ↗pdf ↗

A virtual string is a scheme of self-intersections of a closed curve on a surface. We introduce virtual strings and study their geometric properties and homotopy invariants. We also discuss connections between virtual strings, Gauss words, and virtual knots.

2003-10-15abs ↗pdf ↗

In a typical online learning scenario, a learner is required to process a large data stream using a small memory buffer. Such a requirement is usually in conflict with a learner's primary pursuit of prediction accuracy. To address this dilemma, we introduce a novel Bayesian online classi cation algorithm, called the Vi…

2012-05-09abs ↗pdf ↗

A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative.In this paper, we introduce a method of converting a virtual link diagram to a normal virtual link diagram by use of the double covering …

2016-06-02abs ↗pdf ↗

In 2002, D. Hrencecin and L.H. Kauffman defined a filamentation invariant on oriented chord diagrams that may determine whether the corresponding flat virtual knot diagrams are non-trivial. A virtual knot diagram is non-classical if its related flat virtual knot diagram is non-trivial. Hence filamentations can be used …

2004-02-10abs ↗pdf ↗

Virtual knot theory is a generalization (discovered by the author in 1996) of knot theory to the study of all oriented Gauss codes. (Classical knot theory is a study of planar Gauss codes.) Graph theory studies non-planar graphs via graphical diagrams with virtual crossings. Virtual knot theory studies non-planar Gauss…

1998-11-05abs ↗pdf ↗
Graphoidsmath.CO

Graphoids are topological invariants of virtual graph diagrams.

problem Understanding knotted graphs with open ends in proteins and simplifying virtual spatial graphs.
method Topological interpretations of graphoids using graph Reidemeister moves.
result Virtual graphoids are useful for studying knotted graphs and simplifying spatial graphs.