Search results for "Presentation"
showing 10 items of 2405 documents
Low-Rate Reduced Complexity Image Compression using Directionlets
2006
The standard separable two-dimensional (2-D) wavelet transform (WT) has recently achieved a great success in image processing because it provides a sparse representation of smooth images. However, it fails to capture efficiently one-dimensional (1-D) discontinuities, like edges and contours, that are anisotropic and characterized by geometrical regularity along different directions. In our previous work, we proposed a construction of critically sampled perfect reconstruction anisotropic transform with directional vanishing moments (DVM) imposed in the corresponding basis functions, called directionlets. Here, we show that the computational complexity of our transform is comparable to the co…
Efficient analysis of cubic junction of rectangular waveguides using admittance-matrix representation
2000
In the paper an efficient and accurate method, based on the multimode-admittance-matrix representation and the theory of cavities, is proposed for the analysis of a six-port ‘cubic’ junction composed of the orthogonal intersection of three rectangular waveguides. Very simple closed-form analytical expressions are explicitly detailed for all matrix elements of this basic key building block. More general waveguide multiport junctions, composed of a central cubic junction with arbitrarily shaped waveguide access ports, are also studied using a segmentation procedure. To validate the theory, numerical results are first discussed for a standard rectangular waveguide six-port cross junction. Fina…
Complex group algebras of finite groups: Brauer’s Problem 1
2005
Brauer’s Problem 1 asks the following: what are the possible complex group algebras of finite groups? It seems that with the present knowledge of representation theory it is not possible to settle this question. The goal of this paper is to announce a partial solution to this problem. We conjecture that if the complex group algebra of a finite group does not have more than a fixed number m m of isomorphic summands, then its dimension is bounded in terms of m m . We prove that this is true for every finite group if it is true for the symmetric groups.
Categories, Quantum Computing, and Swarm Robotics: A Case Study
2022
The swarms of robots are examples of artificial collective intelligence, with simple individual autonomous behavior and emerging swarm effect to accomplish even complex tasks. Modeling approaches for robotic swarm development is one of the main challenges in this field of research. Here, we present a robot-instantiated theoretical framework and a quantitative worked-out example. Aiming to build up a general model, we first sketch a diagrammatic classification of swarms relating ideal swarms to existing implementations, inspired by category theory. Then, we propose a matrix representation to relate local and global behaviors in a swarm, with diagonal sub-matrices describing individual featur…
Sorting of Single Biomolecules based on Fourier Polar Representation of Surface Enhanced Raman Spectra
2016
AbstractSurface enhanced Raman scattering (SERS) spectroscopy becomes increasingly used in biosensors for its capacity to detect and identify single molecules. In practice, a large number of SERS spectra are acquired and reliable ranking methods are thus essential for analysing all these data. Supervised classification strategies, which are the most effective methods, are usually applied but they require pre-determined models or classes. In this work, we propose to sort SERS spectra in unknown groups with an alternative strategy called Fourier polar representation. This non-fitting method based on simple Fourier sine and cosine transforms produces a fast and graphical representation for sor…
Revisitation of Nonorthogonal Spin Adaptation in Coupled Cluster Theory.
2015
The benefits of what is alternatively called a nonorthogonally spin-adapted, spin-free, or orbital representation of the coupled cluster equations is discussed relative to orthogonally spin-adapted, spin-orbital, and spin-integrated theories. In particular, specific linear combinations of the orbital cluster amplitudes, denoted spin-summed amplitudes, are shown to reduce the number of contractions that must be explicitly performed and to simplify the expressions and their derivation. The computational efficiency of the spin-summed approach is discussed and compared to orthogonally spin-adapted and spin-integrated approaches. The spin-summed approach is shown to have significant computationa…
A self-adaptable distributed CBR version of the EquiVox system
2016
Three dimensional (3D) voxel phantoms are numerical representations of human bodies, used by physicians in very different contexts. In the controlled context of hospitals, where from 2 to 10 subjects may arrive per day, phantoms are used to verify computations before therapeutic exposure to radiation of cancerous tumors. In addition, 3D phantoms are used to diagnose the gravity of accidental exposure to radiation. In such cases, there may be from 10 to more than 1000 subjects to be diagnosed simultaneously. In all of these cases, computation accuracy depends on a single such representation. In this paper, we present EquiVox which is a tool composed of several distributed functions and enab…
Integer Weighted Regression Tsetlin Machines
2020
The Regression Tsetlin Machine (RTM) addresses the lack of interpretability impeding state-of-the-art nonlinear regression models. It does this by using conjunctive clauses in propositional logic to capture the underlying non-linear frequent patterns in the data. These, in turn, are combined into a continuous output through summation, akin to a linear regression function, however, with non-linear components and binary weights. However, the resolution of the RTM output is proportional to the number of clauses employed. This means that computation cost increases with resolution. To address this problem, we here introduce integer weighted RTM clauses. Our integer weighted clause is a compact r…
Multimodal Images Classification using Dense SURF, Spectral Information and Support Vector Machine
2019
International audience; The multimodal image classification is a challenging area of image processing which can be used to examine the wall painting in the cultural heritage domain. In such classification, a common space of representation is important. In this paper, we present a new method for multimodal representation learning, by using a pixel-wise feature descriptor named dense Speed Up Robust Features (SURF) combined with the spectral information carried by the pixel. For classification of extracted features we have used support vector machine (SVM). Our database was extracted from acquisition on cultural heritage wall paintings that contain four modalities UV, Visible, IRR and fluores…
MetNet: A two-level approach to reconstructing and comparing metabolic networks
2021
Metabolic pathway comparison and interaction between different species can detect important information for drug engineering and medical science. In the literature, proposals for reconstructing and comparing metabolic networks present two main problems: network reconstruction requires usually human intervention to integrate information from different sources and, in metabolic comparison, the size of the networks leads to a challenging computational problem. We propose to automatically reconstruct a metabolic network on the basis of KEGG database information. Our proposal relies on a two-level representation of the huge metabolic network: the first level is graph-based and depicts pathways a…