检索结果-内蒙古大学图书馆

Brain-Like Contour Detector Following Retinex theory and Gestalt Perception Grouping Principles

学校读者我要写书评

暂无评论

SSRN

SSRN 2024年

作者： Cai, Rongtai Que, Helin College of Photonic and Electronic Engineering Fujian Normal University Fujian Fuzhou350117 China Fujian Provincial Engineering Technology Research Center of Photoelectric Sensing Application Fujian Normal University Fujian Fuzhou350117 China Hangzhou Hikvision Digital Technology No.555 Qianmo Road Binjiang District Hangzhou310051 China

Numerous contour detection algorithms draw inspiration from biological vision systems. These algorithms imitate the way simple cells extract edges using Gabor filters. They also suppress edges generated by image textures simulating the non-classical receptive fields (NCRFs), thereby popping up the object contours within the image edges. However, these algorithms are not flawless and may yield imperfect results due to noise pollution, unsatisfactory lighting, limitations in image processing algorithms, and likewise. Weak strengths and pixel loss in contour segments are two common issues. In this paper, we provide two strategies to address these challenges. First, we separate the illumination component from the image following Retinex theory, extract the illumination contour, and boost contour strengths by superimposing the illumination contour. Second, we complete object contours by filling small gaps in contours following Gestalt perceptual grouping principles. Although not performance-oriented, the experimental results show that our endeavors improve the performance of bio-inspired contour detectors. More importantly, we demonstrate the importance of visual computation theories such as the Retinex theory and the Gestalt perception grouping principle for contour detection. © 2024, The Authors. All rights reserved.

关键词： computation theory

Invariants of Finite Orthogonal Groups of Plus Type in Odd Characteristic

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Campbell, H.E.A. Shank, R. James Wehlau, David L. Department of Mathematics and Statistics Queen’s University KingstonON Canada School of Mathematics Statistics and Actuarial Science University of Kent Canterbury United Kingdom Department of Mathematics and Computer Science Royal Military College of Canada KingstonON Canada

We describe the ring of invariants for the finite orthogonal group of plus type in odd characteristic acting on its defining representation. We also describe the invariants of its Sylow subgroup in the defining characteristic. In both cases we construct minimal algebra generating sets and describe the relations among the generators. Both rings of invariants are shown to be Complete Intersections and thus are Cohen-Macaulay. We expect the techniques we use will generalise to give a systematic computation for rings of invariants for all of the finite classical *** Codes 13A50 © 2024, CC BY.

关键词： computation theory

Classical and Quantum Computing of Shear Viscosity for 2 + 1D SU(2) Gauge theory

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Turro, Francesco Ciavarella, Anthony Yao, Xiaojun InQubator for Quantum Simulation University of Washington SeattleWA98195 United States Lawrence Berkeley National Laboratory BerkeleyCA94720 United States

We perform a nonperturbative calculation of the shear viscosity for (2 + 1)-dimensional SU(2) gauge theory by using the lattice Hamiltonian formulation. The retarded Green’s function of the stress-energy tensor is calculated from real time evolution via exact diagonalization of the lattice Hamiltonian with a local Hilbert space truncation, and the shear viscosity is obtained via the Kubo formula. When taking the continuum limit, we account for the renormalization group flow of the coupling but no additional operator renormalization. We find the ratio of the shear viscosity and the entropy density η/s is consistent with a well-known holographic result 1/4π at several temperatures on a 4 × 4 honeycomb lattice with the local electric representation truncated at jmax = 1/2. We also find the ratio of the spectral function and frequency ρxy (ω)/ω exhibits a peak structure when the frequency is small. Both the exact diagonalization method and simple matrix product state classical simulation method beyond jmax = 1/2 on bigger lattices require exponentially growing resources. So we develop a quantum computing method to calculate the retarded Green’s function and analyze various systematics of the calculation including jmax truncation and finite size effects, Trotter errors and the thermal state preparation efficiency. Our thermal state preparation method still requires resources that grow exponentially with the lattice size, but with a very small prefactor at high temperature. We test our quantum circuit on both the Quantinuum emulator and the IBM simulator for a small lattice and obtain results consistent with the classical computing ones. Copyright © 2024, The Authors. All rights reserved.

关键词： computation theory

NEUROMORPHIC CORRELATES OF ARTIFICIAL CONSCIOUSNESS

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Ulhaq, Anwaar Central Queensland University School of Engineering and Technology Sydney campus Australia

The concept of neural correlates of consciousness (NCC), which suggests that specific neural activities are linked to conscious experiences, has gained widespread acceptance. This acceptance is based on a wealth of evidence from experimental studies, brain imaging techniques such as fMRI and EEG, and theoretical frameworks like integrated information theory (IIT) within neuroscience and the philosophy of mind. This paper explores the potential for artificial consciousness by merging neuromorphic design and architecture with brain simulations. It proposes the Neuromorphic Correlates of Artificial Consciousness (NCAC) as a theoretical framework. While the debate on artificial consciousness remains contentious due to our incomplete grasp of consciousness, this work may raise eyebrows and invite criticism. Nevertheless, this optimistic and forward-thinking approach is fueled by insights from the Human Brain Project, advancements in brain imaging like EEG and fMRI, and recent strides in AI and computing, including quantum and neuromorphic designs. Additionally, this paper outlines how machine learning can play a role in crafting artificial consciousness, aiming to realise machine consciousness and awareness in the future. © 2024, CC BY.

关键词： computation theory

ON THE EXISTENCE OF MONGE SOLUTIONS TO MULTI-MARGINAL OPTIMAL TRANSPORT WITH QUADRATIC COST AND UNIFORM DISCRETE MARGINALS

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Emami, Pedram Pass, Brendan University of Alberta EdmontonAB Canada

A natural and important question in multi-marginal optimal transport is whether the Monge ansatz is justified;does there exist a solution of Monge, or deterministic, form? We address this question for the quadratic cost when each marginal measure is m-empirical (that is, uniformly supported on m points). By direct computation, we provide an example showing that the ansatz can fail when the underlying dimension d is 2, number of marginals N to be matched is 3 and the size m of their supports is 3. As a consequence, the set of m-empirical measures is not barycentrically convex when N ≥ 3, d ≥ 2 and m ≥ 3. It is a well known consequence of the Birkhoff-von Neumann Theorem that the Monge ansatz holds for N = 2, standard techniques show it holds when d = 1, and we provide a simple proof here that it holds whenever m = 2. Therefore, the N, d and m in our counterexample are as small as possible. © 2024, CC BY.

关键词： computation theory

BOTTOMONIUM SUPPRESSION IN THE QUARK–GLUON PLASMA — FROM EFFECTIVE FIELD THEORIES TO NON-UNITARY QUANTUM EVOLUTION

学校读者我要写书评

暂无评论

Acta Physica Polonica B, Proceedings Supplement

Acta Physica Polonica B, Proceedings Supplement 2023年第8期16卷

作者： Strickland, Michael Department of Physics Kent State University KentOH44242 United States

In this proceedings contribution I review recent work which computes the suppression of bottomonium production in heavy-ion collisions using open quantum systems methods applied within the potential non-relativistic quantum chromodynamics (pNRQCD) effective field theory. I discuss how the computation of bottomonium suppression can be reduced to solving a Gorini–Kossakowski–Sudarshan–Lindblad (GKSL) quantum master equation for the evolution of the bb¯ reduced density matrix. The used open quantum systems approach allows one to take into account the non-equilibrium dynamics and decoherence of bottomonium in the quark–gluon plasma. Finally, I present comparisons of phenomenological predictions obtained using a recently obtained next-to-leading-order GKSL equation with ALICE, ATLAS, and CMS experimental data for bottomonium suppression and elliptic flow. © 2023 Jagellonian University. All rights reserved.

关键词： computation theory

Symmetrically Fair Allocations of Indivisible Goods

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Johnston, Connor Kazachkov, Aleksandr M.

We consider allocating indivisible goods with provable fairness guarantees that are satisfied regardless of which bundle of items each agent receives. Symmetrical allocations of this type are known to exist for divisible resources, such as consensus splitting of a cake into parts, each having equal value for all agents, ensuring that in any allocation of the cake slices, no agent would envy another. For indivisible goods, one analogous concept relaxes envy freeness to guarantee the existence of an allocation in which any bundle is worth as much as any other, up to the value of a bounded number of items from the other bundle. Previous work has studied the number of items that need to be removed. In this paper, we improve upon these bounds for the specific setting in which the number of bundles equals the number of agents. Concretely, we develop the theory of symmetrically envy free up to one good, or symEF1, allocations. We prove that a symEF1 allocation exists if the vertices of a related graph can be partitioned (colored) into as many independent sets as there are agents. This sufficient condition always holds for two agents, and for agents that have identical, disjoint, or binary valuations. We further prove conditions under which exponentially-many distinct symEF1 allocations exist. Finally, we perform computational experiments to study the incidence of symEF1 allocations as a function of the number of agents and items when valuations are drawn uniformly at random. Copyright © 2024, The Authors. All rights reserved.

关键词： computation theory

CCA-Secure Hybrid Encryption in Correlated Randomness Model and KEM Combiners

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Panja, Somnath Sharifian, Setareh Jiang, Shaoquan Safavi-Naini, Reihaneh University of Calgary Canada Intel Corporation University of Windsor Canada

A hybrid encryption (HE) system is an efficient public key encryption system for arbitrarily long messages. An HE system consists of a public key component called key encapsulation mechanism (KEM), and a symmetric key component called data encapsulation mechanism (DEM). The HE encryption algorithm uses a KEM generated key k to encapsulate the message using DEM, and send the ciphertext together with the encapsulaton of k, to the decryptor who decapsulates k and uses it to decapsulate the message using the corresponding KEM and DEM components. The KEM/DEM composition theorem proves that if KEM and DEM satisfy well-defined security notions, then HE will be secure with well defined security. We introduce HE in correlated randomness model where the encryption and decryption algorithms have samples of correlated random variables that are partially leaked to the adversary. Security of the new KEM/DEM paradigm is defined against computationally unbounded or polynomially bounded adversaries. We define iKEM and cKEM with respective information theoretic computational security, and prove a composition theorem for them and a computationally secure DEM, resulting in secure HEs with proved computational security (CPA and CCA) and without any computational assumption. We construct two iKEMs that provably satisfy the required security notions of the composition theorem. The iKEMs are used to construct two efficient quantum-resistant HEs when used with an AES based DEM. We also define and construct combiners with proved security that combine the new KEM/DEM paradigm of HE with the traditional public key based paradigm of HE. Copyright © 2024, The Authors. All rights reserved.

关键词： computation theory

Quantum Codes and Irreducible Products of Characters

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Kubischta, Eric Teixeira, Ian Joint Center for Quantum Information and Computer Science NIST University of Maryland College ParkMD20742 United States

In a recent paper, we defined twisted unitary 1-groups and showed that they automatically induced error-detecting quantum codes. We also showed that twisted unitary 1-groups correspond to irreducible products of characters thereby reducing the problem of code-finding to a computation in the character theory of finite groups. Using a combination of GAP computations and results from the mathematics literature on irreducible products of characters, we identify many new non-trivial quantum codes with unusual transversal gates. Copyright © 2024, The Authors. All rights reserved.

关键词： computation theory