Results 281 to 290 of about 144,513 (307)

Image tampering detection using dynamic histogram equalization based LIOP features and novel scaled K-means +  + clustering. [PDF]

Sci Rep
Mehmood Z, Bilal M, Munshi A, Cheema AM, Rashid J, Kim J.   +5 more
europepmc   +1 more source

A Study on Detection of Prohibited Items Based on X-Ray Images with Lightweight Model. [PDF]

Sensors (Basel)
Liang T, Wen H, Huang B, Zhang N, Zhang Y.   +4 more
europepmc   +1 more source

HBSP: a hybrid bilinear and semidefinite programming approach for aligning partially overlapping point clouds. [PDF]

Sci Rep
Lian W, Ma F, Cui Z, Pan H.
europepmc   +1 more source

A Group Affine-Based Inverse Alignment Method for High-Precision Rotational Inertial Navigation Systems. [PDF]

Sensors (Basel)
Liu C, Li D, Li H, Lan T, Lou Q, Wei G, Gao C, Tian M, Tan Z, Yu X.   +9 more
europepmc   +1 more source

Unveiling hidden particle-level defects in glasses. [PDF]

Nat Commun
Hu YC, Tanaka H.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Learning affine transformations

Pattern Recognition, 1999
Under the assumption of weak perspective, two views of the same planar object are related through an affine transformation. In this paper, we consider the problem of training a simple neural network to learn to predict the parameters of the affine transformation.
Michael Georgiopoulos, Niels da Vitoria Lobo, Mubarak Shah, George Bebis   +3 more
openaire   +3 more sources

Affine Transformations in Bundles

Journal of Mathematical Sciences, 2020
This paper is a review of results of studies of affine transformations in generalized spaces over real linear algebras over the past 15-20 years.
A. Ya. Sultanov, O. A. Monakhova
openaire   +2 more sources

Affine transformation in cryptography

Journal of Discrete Mathematical Sciences and Cryptography, 2008
Abstract The affine transformation is the generalized shift cipher. The shift cipher is one of the important techniques in cryptography. In this paper, we show that the total number of possible affine transformations is N k ϕ(N k), that is, , for k-letter block and prime factor p of N k . It has key length two and is computationally easy.
Hari Om, Rahul Patwa
openaire   +2 more sources