Related papers: General Theory of Image Normalization
We apply the renormalization group theory to the dynamical systems with the simplest example of basic biological motifs. This includes the interpretation of complex networks as the perturbation to simple network. This is the first step to…
All techniques for denoising involve a notion of a true (noise-free) image, and a hypothesis space. The hypothesis space may reconstruct the image directly as a grayscale valued function, or indirectly by its Fourier or wavelet spectrum.…
Principle objective of Image enhancement is to process an image so that result is more suitable than original image for specific application. Digital image enhancement techniques provide a multitude of choices for improving the visual…
Normalization is a pre-processing step that converts the data into a more usable representation. As part of the deep neural networks (DNNs), the batch normalization (BN) technique uses normalization to address the problem of internal…
In this article we present a generalization of a Leibniz's geometrical theorem and an application of it.
Building generalized models that can solve many computer vision tasks simultaneously is an intriguing direction. Recent works have shown image itself can be used as a natural interface for general-purpose visual perception and demonstrated…
This review presents various image segmentation methods using complex networks. Image segmentation is one of the important steps in image analysis as it helps analyze and understand complex images. At first, it has been tried to classify…
In this article we revisit the concept of abstraction as it is used in visualization and put it on a solid formal footing. While the term \emph{abstraction} is utilized in many scientific disciplines, arts, as well as everyday life,…
In this paper, we consider linear ill-posed problems in Hilbert spaces and their regularization via frame decompositions, which are generalizations of the singular-value decomposition. In particular, we prove convergence for a general class…
We consider renormalization groups of transformations composed of a Gaussian convolution and a field dilatation. As an example, we consider perturbations of a single component real Euclidean free field $\phi$ with covariance…
Piecewise constant image approximations of sequential number of segments or clusters of disconnected pixels are treated. The method of majorizing of optimal approximation sequence by hierarchical sequence of image approximations is…
The review presents general methods for treating complicated problems that cannot be solved exactly and whose solution encounters two major difficulties. First, there are no small parameters allowing for the safe use of perturbation theory…
I am showing how the ideas behind the renormalisation group can be generalised in order to produce the desired reduction in the degrees of freedom other that the ones considered up to now. Instead of looking only at the renormalisation…
Recently, we have witnessed the great success of the generalist model in natural language processing. The generalist model is a general framework trained with massive data and is able to process various downstream tasks simultaneously.…
An image is here defined to be a set which is either open or closed and an image transformation is structure preserving in the following sense: It corresponds to an algebra homomorphism for each singly generated algebra. The results extend…
We present a generalization of multiview varieties as closures of images obtained by projecting subspaces of a given dimension onto several views, from the photographic and geometric points of view. Motivated by applications in Computer…
Non-uniqueness and instability are characteristic features of image reconstruction processes. As a result, it is necessary to develop regularization methods that can be used to compute reliable approximate solutions. A regularization method…
Under ray-optical light transport, the classical ray serves as a linear and local "point query" of light's behaviour. Linearity and locality are crucial to the formulation of sophisticated path tracing and sampling techniques, that enable…
In a previous paper, we provided some update in the treatment of the finiteness theorem for rational maps of finite degree from a fixed variety to varieties of general type. In the present paper we present another improvement, introducing…
Abstract separation systems provide a simple general framework in which both tree-shape and high cohesion of many combinatorial structures can be expressed, and their duality proved. Applications range from tangle-type duality and tree…