Random walks: A review of algorithms and applications
A random walk is known as a random process which describes a path including a
succession of random steps in the mathematical space. It has increasingly been popular in …
succession of random steps in the mathematical space. It has increasingly been popular in …
Cellpose: a generalist algorithm for cellular segmentation
Many biological applications require the segmentation of cell bodies, membranes and nuclei
from microscopy images. Deep learning has enabled great progress on this problem, but …
from microscopy images. Deep learning has enabled great progress on this problem, but …
Human pose estimation from monocular images: A comprehensive survey
Human pose estimation refers to the estimation of the location of body parts and how they
are connected in an image. Human pose estimation from monocular images has wide …
are connected in an image. Human pose estimation from monocular images has wide …
Actions as space-time shapes
Human action in video sequences can be seen as silhouettes of a moving torso and
protruding limbs undergoing articulated motion. We regard human actions as three …
protruding limbs undergoing articulated motion. We regard human actions as three …
The wave kernel signature: A quantum mechanical approach to shape analysis
We introduce the Wave Kernel Signature (WKS) for characterizing points on non-rigid three-
dimensional shapes. The WKS represents the average probability of measuring a quantum …
dimensional shapes. The WKS represents the average probability of measuring a quantum …
A survey on skeletonization algorithms and their applications
Skeletonization provides an effective and compact representation of objects, which is useful
for object description, retrieval, manipulation, matching, registration, tracking, recognition …
for object description, retrieval, manipulation, matching, registration, tracking, recognition …
Geometrical structure of Laplacian eigenfunctions
We summarize the properties of eigenvalues and eigenfunctions of the Laplace operator in
bounded Euclidean domains with Dirichlet, Neumann, or Robin boundary condition. We …
bounded Euclidean domains with Dirichlet, Neumann, or Robin boundary condition. We …
Event detection in crowded videos
Real-world actions occur often in crowded, dynamic environments. This poses a difficult
challenge for current approaches to video event detection because it is difficult to segment …
challenge for current approaches to video event detection because it is difficult to segment …
Learning context-sensitive shape similarity by graph transduction
Shape similarity and shape retrieval are very important topics in computer vision. The recent
progress in this domain has been mostly driven by designing smart shape descriptors for …
progress in this domain has been mostly driven by designing smart shape descriptors for …
Lean algebraic multigrid (LAMG): Fast graph Laplacian linear solver
OE Livne, A Brandt - SIAM Journal on Scientific Computing, 2012 - SIAM
Laplacian matrices of graphs arise in large-scale computational applications such as
semisupervised machine learning; spectral clustering of images, genetic data, and web …
semisupervised machine learning; spectral clustering of images, genetic data, and web …