Results 271 to 280 of about 1,268,311 (320)
Some of the next articles are maybe not open access.

Quantization error in regular grids: triangular pixels

IEEE Transactions on Image Processing, 1998
Quantization of the image plane into pixels results in the loss of the true location of features within pixels and introduces an error in any quantity computed from feature positions in the image. We derive closed-form, analytic expressions for the error distribution function, the mean absolute error (MAE), and the mean square error (MSE) due to ...
B. Kamgar-Parsi, B. Kamgar-Parsi
openaire   +2 more sources

Algebraic multigrid / substructuring preconditioners on triangular grids

Russian Journal of Numerical Analysis and Mathematical Modelling, 1991
Summary: A new approach to constructing algebraic multigrid preconditioners for the mesh diffusion operators suggested and studied before by one of the authors for the case of square grids is extended to include the case of triangular hierarchical grids.
Hakopian, Yu. R., Kuznetsov, Yu. A.
openaire   +2 more sources

Finite-Difference Schemes on Regular Triangular Grids

Journal of Computational Physics, 1993
The authors consider wave propagation errors of linear convection equations in one and two spatial dimensions (1) \(U_ t + c \cdot \text{grad} U = 0\). For the analytical solution an ansatz of harmonic functions is made. This is compared with some numerical semidiscrete approximations of (1). In the 2D-case finite difference schemes are considered on a
Zingg, David W., Lomax, Harvard
openaire   +2 more sources

A Fast Sparse Triangular Solver for Structured-grid Problems on Sunway Many-core Processor SW26010

International Conference on Parallel Processing, 2018
The sparse triangular solver (SpTRSV) is one of the most essential kernels in many scientific and engineering applications. Efficiently parallelizing the SpTRSV on modern many-core architectures is considerably difficult due to inherent dependency of ...
Xinliang Wang   +8 more
semanticscholar   +1 more source

Parallel thinning on the triangular grid

2013 IEEE 4th International Conference on Cognitive Infocommunications (CogInfoCom), 2013
One of the fundamental issues of human and computational cognitive psychology is pattern or shape recognition. Various applications in image processing and computer vision rely on skeleton-like shape features A possible technique for extracting these feautures is thinning. Although the majority of 2D thinning algorithms work on digital pictures sampled
Kardos Péter, Palágyi Kálmán
openaire   +2 more sources

Simple conditions for forming triangular grids

Neurocomputing, 2007
We have used simple learning rules to study how firing maps containing triangular grids-as found in in vivo experiments-can be developed by Hebbian means in realistic robotic simulations. We started from typical non-local postrhinal neuronal responses.
Bálint Takács, András Lőrincz
openaire   +1 more source

Interpolation on Unstructured Triangular Grids

2018
The chapter develops the analytical formulae for high-order interpolation on the unstructured triangular grids, such as the polynomial interpolation, piecewise linear interpolation, and hybrid interpolation. The interpolation might be used during the creation of new unstructured triangular or regular gird instead of previous ones as an element of ...
openaire   +1 more source

The first chiral 2-D molecular triangular grid †

Journal of the Chemical Society, Dalton Transactions, 2000
The two-dimensional coordination polymer, [Cu(PPh3)(N,N-(2-pyridyl)(4-pyridylmethyl)amine)1.5]·0.5CHCl3·ClO41, with a large chiral triangular cavity and blue fluorescent emission, was synthesized by a solvothermal reaction between [Cu(MeCN)2(PPh3)2]ClO4 and N,N-(2-pyridyl)(4-pyridylmethyl)amine.
Che, CM   +6 more
openaire   +3 more sources

Digitized rotations of 12 neighbors on the triangular grid

Annals of Mathematics and Artificial Intelligence, 2020
Aydin Avkan, B. Nagy, Müge Saadetoglu
semanticscholar   +1 more source

Surface representations based on triangular grids

The Visual Computer, 1987
The problem of representing 2 1/2 dimensional surfaces defined at a set of randomly located points by means of triangular grids is considered. Such representations approximate a surface as a network of planar, triangular faces with vertices at the data points.
openaire   +1 more source

Home - About - Disclaimer - Privacy