49,727 research outputs found
Robust Adaptive Median Binary Pattern for noisy texture classification and retrieval
Texture is an important cue for different computer vision tasks and
applications. Local Binary Pattern (LBP) is considered one of the best yet
efficient texture descriptors. However, LBP has some notable limitations,
mostly the sensitivity to noise. In this paper, we address these criteria by
introducing a novel texture descriptor, Robust Adaptive Median Binary Pattern
(RAMBP). RAMBP based on classification process of noisy pixels, adaptive
analysis window, scale analysis and image regions median comparison. The
proposed method handles images with high noisy textures, and increases the
discriminative properties by capturing microstructure and macrostructure
texture information. The proposed method has been evaluated on popular texture
datasets for classification and retrieval tasks, and under different high noise
conditions. Without any train or prior knowledge of noise type, RAMBP achieved
the best classification compared to state-of-the-art techniques. It scored more
than under impulse noise densities, more than under
Gaussian noised textures with standard deviation , and more than
under Gaussian blurred textures with standard deviation .
The proposed method yielded competitive results and high performance as one of
the best descriptors in noise-free texture classification. Furthermore, RAMBP
showed also high performance for the problem of noisy texture retrieval
providing high scores of recall and precision measures for textures with high
levels of noise
High-precision Finishing Hard Steel Surfaces Using Cutting, Abrasive and Burnishing Operations
AbstractThis paper presents the technological and functional capabilities of surface textures produced by high-precision cutting, abrasive and ball burnishing operations on hardened steel parts of about 60 HRC hardness. Special focus was placed on surface textures generated by hard turning, belt grinding and ball burnishing operations which are characterized by the Sz roughness parameter of about 1.3μm and distinctly different values of the Sa parameter. Apart from the standard 2D and 3D roughness parameters, the fractal and motif parameters were analyzed
Exact asymmetric Skyrmion in anisotropic ferromagnet and its helimagnetic application
Topological Skyrmions as intricate spin textures were observed experimentally
in helimagnets on 2d plane. Theoretical foundation of such solitonic states to
appear in pure ferromagnetic model, as exact solutions expressed through any
analytic function, was made long ago by Belavin and Polyakov (BP). We propose
an innovative generalization of the BP solution for an anisotropic ferromagnet,
based on a physically motivated geometric (in-)equality, which takes the exact
Skyrmion to a new class of functions beyond analyticity. The possibility of
stabilizing such metastable states in helimagnets is discussed with the
construction of individual Skyrmion and Skyrmion crystal with asymmetry, likely
to be detected in precision experiments.Comment: 12 pages, latex, 3 figures, published in Nucl Phys B (As Frontiers
article
Neutrino Oscillation Observables from Mass Matrix Structure
We present a systematic procedure to establish a connection between complex
neutrino mass matrix textures and experimental observables, including the Dirac
CP phase. In addition, we illustrate how future experimental measurements
affect the selection of textures in the (theta_13,delta_CP)-plane. For the
mixing angles, we use generic assumptions motivated by quark-lepton
complementarity. We allow for any combination between U_l and U_nu, as well as
we average over all present complex phases. We find that individual textures
lead to very different distributions of the observables, such as to large or
small leptonic CP violation. In addition, we find that the extended
quark-lepton complementarity approach motivates future precision measurements
of delta_CP at the level of theta_C \simeq 11 degrees.Comment: Version to appear in Phys. Lett. B. A complete list of textures can
be found at
http://theorie.physik.uni-wuerzburg.de/~winter/Resources/CTex/index.html . 7
pages, 1 figure, 1 tabl
Systematic Model Building Based on Quark-Lepton Complementarity Assumptions
In this talk, we present a procedure to systematically generate a large
number of valid mass matrix textures from very generic assumptions. Compared to
plain anarchy arguments, we postulate some structure for the theory, such as a
possible connection between quarks and leptons, and a mechanism to generate
flavor structure. We illustrate how this parameter space can be used to test
the exclusion power of future experiments, and we point out that one can
systematically generate embeddings in Z_N product flavor symmetry groups.Comment: 3 pages, 1 figure. Talk given at the NuFact 07 conference, Aug 6-11,
2007, Okayama, Japa
SU(2) Lattice Gauge Theory Simulations on Fermi GPUs
In this work we explore the performance of CUDA in quenched lattice SU(2)
simulations. CUDA, NVIDIA Compute Unified Device Architecture, is a hardware
and software architecture developed by NVIDIA for computing on the GPU. We
present an analysis and performance comparison between the GPU and CPU in
single and double precision. Analyses with multiple GPUs and two different
architectures (G200 and Fermi architectures) are also presented. In order to
obtain a high performance, the code must be optimized for the GPU architecture,
i.e., an implementation that exploits the memory hierarchy of the CUDA
programming model.
We produce codes for the Monte Carlo generation of SU(2) lattice gauge
configurations, for the mean plaquette, for the Polyakov Loop at finite T and
for the Wilson loop. We also present results for the potential using many
configurations () without smearing and almost configurations
with APE smearing. With two Fermi GPUs we have achieved an excellent
performance of the speed over one CPU, in single precision, around
110 Gflops/s. We also find that, using the Fermi architecture, double precision
computations for the static quark-antiquark potential are not much slower (less
than slower) than single precision computations.Comment: 20 pages, 11 figures, 3 tables, accepted in Journal of Computational
Physic
- …