Hilbert Spaces of Distributions Having an Orthogonal Basis of Exponentials.
How similarity matrices are?
In finite sets with n elements, every similarity relation (or fuzzy equivalence) can be represented by an n x n-matrix S = (sij), sij ∈ [0,1], such that sii = 1 (1 ≤ i ≤ n), sij = sji for any i,j and S o S = S, where o denotes the max-min product of matrices. These matrices represent also dendograms and sets of closed balls of a finite ultrametric space (vid. [1], [2], [3]).
How to handle fuzzy-quantities?
Identifikace lineárních soustav s násobnými póly
Identifying codes of Cartesian product of two cliques of the same size.
Identifying codes with small radius in some infinite regular graphs.
Il teorema di equivalenza per i codici ciclici
Every unit in the ring of the residual classes mod induces canonically an automorphism of the algebra . Let be a cyclic code, i.e. an ideal. If the numbers and are relatively prime then there exists a well-known characterization of the code . We extend this characterization to the general case.
Image Compression with Schauder Bases
As is known, color images are represented as multiple, channels, i.e. integer-valued functions on a discrete rectangle, corresponding to pixels on the screen. Thus, image compression, can be reduced to investigating suitable properties of such, functions. Each channel is compressed independently. We are, representing each such function by means of multi-dimensional, Haar and diamond bases so that the functions can be remembered, by their basis coefficients without loss of information. For, each...
Image dithering based on the wavelet transform.
Image Interpolation
We discuss possible algorithms for interpolating data given in a set of curves and/or points in the plane. We propose a set of basic assumptions to be satisfied by the interpolation algorithms which lead to a set of models in terms of possibly degenerate elliptic partial differential equations. The Absolute Minimal Lipschitz Extension model (AMLE) is singled out and studied in more detail. We show experiments suggesting a possible application, the restoration of images with poor dynamic range. We...
Image location for screw dislocation. A new point of view.
Image processing for old movies by filters with motion detection
Old movies suffer from various types of degradation: severe noise, blurred edges of objects (low contrast), scratches, spots, etc. Finding an efficient denoising method is one of the most important and one of the oldest problems in image sequence processing. The crucial thing in image sequences is motion. If the motion is insignificant, then any motion noncompensated method of filtering can be applied. However, if the noise is significant, then this approach gives most often unsatisfactory results....
Image restoration through subimages and confidence images.
Image retrieval based on hierarchical Gabor filters
Content Based Image Retrieval (CBIR) is now a widely investigated issue that aims at allowing users of multimedia information systems to automatically retrieve images coherent with a sample image. A way to achieve this goal is the computation of image features such as the color, texture, shape, and position of objects within images, and the use of those features as query terms. We propose to use Gabor filtration properties in order to find such appropriate features. The article presents multichannel...
Image segmentation using gray-scale morphology and marker-controlled watershed transformation.
Implementation of adaptive generalized sidelobe cancellers using efficient complex valued arithmetic
Low complexity realizations of Least Mean Squared (LMS) error, Generalized Sidelobe Cancellers (GSCs) applied to adaptive beamforming are considered. The GSC method provides a simple way for implementing adaptive Linear Constraint Minimum Variance (LCMV) beamformers. Low complexity realizations of adaptive GSCs are of great importance for the design of high sampling rate, and/or small size and low power adaptive beamforming systems. The LMS algorithm and its Transform Domain (TD-LMS) counterpart...
Implementation of the MR tractography visualization kit based on the anisotropic Allen-Cahn equation
Magnetic Resonance Diffusion Tensor Imaging (MR–DTI) is a noninvasive in vivo method capable of examining the structure of human brain, providing information about the position and orientation of the neural tracts. After a short introduction to the principles of MR–DTI, this paper describes the steps of the proposed neural tract visualization technique based on the DTI data. The cornerstone of the algorithm is a texture diffusion procedure modeled mathematically by the problem for the Allen–Cahn...
Improved generalized belief propagation for vision processing.
Improvements in geometry-based secret image sharing approach with steganography.
Improvements on the Juxtaposing Theorem
A new class of binary constant weight codes is presented. We establish new lower bound and exact values on A(n1 +n2; 2(a1 +a2); n2) ≥ min {M1;M2}+1, if A(n1; 2a1; a1 +b1) = M1 and A(n2; 2b2; a2 +b2) = M2, in particular, A(30; 16; 15) = 16 and A(33; 18; 15) = 11.