Results 191 to 200 of about 391,951 (282)

Establishing Shape Correspondences: A Survey

Computer Graphics Forum, EarlyView.
Abstract Shape correspondence between surfaces in 3D is a central problem in geometry processing, concerned with establishing meaningful relations between surfaces. While all correspondence problems share this goal, specific formulations can differ significantly: Downstream applications require certain properties that correspondences must satisfy ...
A. Heuschling, H. Meinhold, L. Kobbelt
wiley   +1 more source

Blind image quality assessment based on statistical features. [PDF]

Sci Rep
Ji W, Chen X.
europepmc   +1 more source

Embedding Optimization of Layouts via Distortion Minimization

Computer Graphics Forum, EarlyView.
Abstract Given an embedding of a layout in the surface of a target mesh, we consider the problem of optimizing the embedding geometrically. Layout embeddings partition the surface into multiple disk‐like patches, making them particularly useful for parametrization and remeshing tasks, such as quad‐remeshing, since these problems can then be solved on ...
A. Heuschling, I. Lim, L. Kobbelt
wiley   +1 more source

Continuous-Variable Quantum Key Distribution Based on <i>N</i>-APSK Modulation over Seawater Channel. [PDF]

Entropy (Basel)
Mao L, Liang Z, Zuo Z, Zhang H, Wang Y.
europepmc   +1 more source

Phong‐Rodrigues Extrinsic Vector‐Field Processing

Computer Graphics Forum, EarlyView.
Abstract We introduce a new extrinsic discretization of tangent vector fields on triangle meshes that is continuous, with bounded derivatives that are continuous almost everywhere, supporting pointwise evaluation and integration of differential operators.
Hongyi Liu, Oded Stein, Amir Vaxman, Mirela Ben‐Chen, Misha Kazhdan   +4 more
wiley   +1 more source

A minimal recurrent neural network models the robustness of interleaved practice on motor sequence learning. [PDF]

Sci Rep
Song Y, Kim H, Kim T.
europepmc   +1 more source

A practical algorithm for weighted k‐hulls

Computer Graphics Forum, EarlyView.
Abstract The convex hull is a central concept in computational geometry, geometry processing, and generally for summarizing sampled data. Its descriptive power suffers significantly in the presence of noise. The k‐hull, also known as the k‐depth contour in statistics, is the intersection of all half‐spaces that contain all but k data points, i.e. it is
N. Look, H. Meyer, M. Alexa
wiley   +1 more source

An efficient lattice-based identity-based proxy Re-encryption scheme with direct revocation for cloud storage. [PDF]

PLoS One
Li J, Jiang M, Guo Y.
europepmc   +1 more source

Optimized and Aligned Anisotropic Monte Carlo Sampling Patterns

Computer Graphics Forum, EarlyView.
Abstract Path tracing uses Monte Carlo integration to solve the rendering equation by evaluating the integrand at random sampling points. The convergence rate of the error can be significantly improved by using correlated instead of random sampling, especially on smooth integrands.
Mirco Werner, Johannes Hanika, Carsten Dachsbacher   +2 more
wiley   +1 more source

A cortical semantic space integrating fractions and integers

Valério D, Debray S, Karami A, Cauté M, Gravel N, Dehaene S.   +5 more
europepmc   +1 more source