SearcharxivSearch

arXiv subjects

Nir Sochen

Publications and source records attributed to Nir Sochen.

At least 19 recordsLinked to original sources

A Geometric Unification of Generative AI with Manifold-Probabilistic Projection Models

Most models of generative AI for images assume that images are inherently low-dimensional objects embedded within a high-dimensional space. Additionally, it is often implicitly assumed that thematic image datasets form smooth or piecewise smooth manifolds. Common approaches overlook the geometric structure and focus solely on probabilistic methods, approximating the probability distribution through universal approximation techniques such as the kernel method. In some generative models the low dimensional nature of the data manifest itself by the introduction of a lower dimensional latent space. Yet, the probability distribution in the latent or the manifold's coordinate space is considered uninteresting and is predefined or considered uniform. In this study, we address the problem of Blind Image Denoising (BID), and to some extent, the problem of generating images from noise by unifying geometric and probabilistic perspectives. We introduce a novel framework that improves upon existing probabilistic approaches by incorporating geometric assumptions that enable the effective use of kernel-based probabilistic methods. Furthermore, the proposed framework extends prior geometric approaches by combining explicit and implicit manifold descriptions through the introduction of a distance function. The resulting framework demystifies diffusion models by interpreting them as a projection mechanism onto the manifold of ``good images''. This interpretation leads to the construction of a new deterministic model, the Manifold-Probabilistic Projection Model (MPPM), which operates in both the representation (pixel) space and the latent space. We demonstrate that the Latent MPPM (LMPPM) outperforms the Latent Diffusion Model (LDM) across various datasets, achieving superior results in terms of image restoration and generation.

cs.CV

Scene-based nonuniformity correction with homography transformation

Due to their affordable, low mass, and small dimensions, uncooled microbolometer-based thermal focal plane arrays (UC-FPAs) are useful for long-wave infrared (LWIR)imaging applications. However, in outdoor conditions typical in agricultural remote sensing, cameras based on UC-FPAs may suffer from drift in offset and gain. To tackle the persistent drift, the system requires continuous calibration. Our goal in this study was to eliminate this requirement via a computational schema. In a former study, we estimated unknown gain and offset values and thermographic images of an object from a sequence of pairs of successive images taken at two different blur levels.In the current work, we took on a similar problem using a sequence of shifted images, with relative shifts caused by realistic drone hovering modeled by homography transformation. This places our work in the realm of scene-based nonuniformity correction problems. We show that an object's thermographic values, as well as gain and offset, can be jointly estimated by relying on a few sets of shifted images. We use a minimum likelihood estimator, which is found using alternating minimization. Registration is done using a generalized Lucas-Kanade method. Simulations show promising accuracy with mean Pearson correlation of more than 0.9999998 between ground truth and restoration. Under ideal assumptions, this is equivalent to a mean restoration error of less than 0.01 Celsius degree.

eess.IV

End-to-end pipeline for simultaneous temperature estimation and super resolution of low-cost uncooled infrared camera frames for precision agriculture applications

Radiometric infrared (IR) imaging is a valuable technique for remote-sensing applications in precision agriculture, such as irrigation monitoring, crop health assessment, and yield estimation. Low-cost uncooled non-radiometric IR cameras offer new implementations in agricultural monitoring. However, these cameras have inherent drawbacks that limit their usability, such as low spatial resolution, spatially variant nonuniformity, and lack of radiometric calibration. In this article, we present an end-to-end pipeline for temperature estimation and super resolution of frames captured by a low-cost uncooled IR camera. The pipeline consists of two main components: a deep-learning-based temperature-estimation module, and a deep-learning-based super-resolution module. The temperature-estimation module learns to map the raw gray level IR images to the corresponding temperature maps while also correcting for nonuniformity. The super-resolution module uses a deep-learning network to enhance the spatial resolution of the IR images by scale factors of x2 and x4. We evaluated the performance of the pipeline on both simulated and real-world agricultural datasets composing of roughly 20,000 frames of various crops. For the simulated data, the results were on par with the real-world data with sub-degree accuracy. For the real data, the proposed pipeline was compared to a high-end radiometric thermal camera, and achieved sub-degree accuracy. The results of the real data are on par with the simulated data. The proposed pipeline can enable various applications in precision agriculture that require high quality thermal information from low-cost IR cameras.

eess.IV

Level Set KSVD

We present a new algorithm for image segmentation - Level-set KSVD. Level-set KSVD merges the methods of sparse dictionary learning for feature extraction and variational level-set method for image segmentation. Specifically, we use a generalization of the Chan-Vese functional with features learned by KSVD. The motivation for this model is agriculture based. Aerial images are taken in order to detect the spread of fungi in various crops. Our model is tested on such images of cotton fields. The results are compared to other methods.

cs.CV

Simultaneous temperature estimation and nonuniformity correction from multiple frames

IR cameras are widely used for temperature measurements in various applications, including agriculture, medicine, and security. Low-cost IR cameras have the immense potential to replace expensive radiometric cameras in these applications; however, low-cost microbolometer-based IR cameras are prone to spatially variant nonuniformity and to drift in temperature measurements, which limit their usability in practical scenarios. To address these limitations, we propose a novel approach for simultaneous temperature estimation and nonuniformity correction (NUC) from multiple frames captured by low-cost microbolometer-based IR cameras. We leverage the camera's physical image-acquisition model and incorporate it into a deep-learning architecture termed kernel prediction network (KPN), which enables us to combine multiple frames despite imperfect registration between them. We also propose a novel offset block that incorporates the ambient temperature into the model and enables us to estimate the offset of the camera, which is a key factor in temperature estimation. Our findings demonstrate that the number of frames has a significant impact on the accuracy of the temperature estimation and NUC. Moreover, introduction of the offset block results in significantly improved performance compared to vanilla KPN. The method was tested on real data collected by a low-cost IR camera mounted on an unmanned aerial vehicle, showing only a small average error of $0.27-0.54^\circ C$ relative to costly scientific-grade radiometric cameras. Our method provides an accurate and efficient solution for simultaneous temperature estimation and NUC, which has important implications for a wide range of practical applications.

cs.CV

Estimating temperatures with low-cost infrared cameras using deep neural networks

Low-cost thermal cameras are inaccurate (usually $\pm 3^\circ C$) and have space-variant nonuniformity across their detector. Both inaccuracy and nonuniformity are dependent on the ambient temperature of the camera. The goal of this work was to estimate temperatures with low-cost infrared cameras, and rectify the nonuniformity. A nonuniformity simulator that accounts for the ambient temperature was developed. An end-to-end neural network that incorporates both the physical model of the camera and the ambient camera temperature was introduced. The neural network was trained with the simulated nonuniformity data to estimate the object's temperature and correct the nonuniformity, using only a single image and the ambient temperature measured by the camera itself. Results of the proposed method significantly improved the mean temperature error compared to previous works by up to $0.5^\circ C$. In addition, constraining the physical model of the camera with the network lowered the error by an additional $0.1^\circ C$. The mean temperature error over an extensive validation dataset was $0.37^\circ C$. The method was verified on real data in the field and produced equivalent results.

cs.CV

Existence of Uncertainty Minimizers for the Continuous Wavelet Transform

Continuous wavelet design is the endeavor to construct mother wavelets with desirable properties for the continuous wavelet transform (CWT). One class of methods for choosing a mother wavelet involves minimizing a functional, called the wavelet uncertainty functional. Recently, two new wavelet uncertainty functionals were derived from theoretical foundations. In both approaches, the uncertainty of a mother wavelet describes its concentration, or accuracy, as a time-scale probe. While an uncertainty minimizing mother wavelet can be proven to have desirable localization properties, the existence of such a minimizer was never studied. In this paper, we prove the existence of minimizers for the two uncertainty functionals.

math.FA

A note on the variation of geometric functionals

Calculus of Variation combined with Differential Geometry as tools of modelling and solving problems in image processing and computer vision were introduced in the late 80's and the 90s of the 20th century. The beginning of an extensive work in these directions was marked by works such as Geodesic Active Contours (GAC), the Beltrami framework, level set method of Osher and Sethian the works of Charpiat et al. and the works by Chan and Vese to name just a few. In many cases the optimization of these functional are done by the gradient descent method via the calculation of the Euler-Lagrange equations. Straightforward use of the resulted EL equations in the gradient descent scheme leads to non-geometric and in some cases non sensical equations. It is costumary to modify these EL equations or even the functional itself in order to obtain geometric and/or sensical equations. The aim of this note is to point to the correct way to derive the EL and the gradient descent equations such that the resulted gradient descent equation is geometric and makes sense.

cs.CV

$\it COD:$ An Algorithm for Shape Reconstruction of Transiting Celestial Bodies through Topological Optimization

We introduce a novel algorithm, $\textit{COD}$ -- Compact Opacity Distribution, for shape reconstruction of a celestial body that has been observed to occult a star, using the photometric time-series observations of the occultation. $\textit{COD}$ finds a solution to the light-curve inversion problem for an optically thick occulter having an approximately convex shape, together with an estimate of its size, impact parameter and velocity, relative to the occulted star. The algorithm is based on an optimization scheme that uses topological constraints and an objective function for the geometry of the occulter. The constraints of the problem follow linear relations, which enable the use of linear programming optimization as the mathematical framework. Multiple tests of the algorithm were performed, all of which resulted in high correlations between the simulated and obtained shapes of the occulting objects, with errors within $5\%$ in their projected velocities and horizontal sizes, and within $0.1$ in their impact parameters. These tests include a video of a solar eclipse by Phobos, as seen by NASA's Curiosity rover, which was collapsed into its corresponding light curve and reconstructed afterwards. We applied $\textit{COD}$ to the mysterious case of VVV-WIT-08 -- a single deep occultation ($\sim 96 \%$) of a giant star lasting for over 200 days. The analysis, which did not assume any specific shape of the occulter, suggested an object with a projected opacity distribution resembling an ellipse with an eccentricity of $\sim 0.5$, tilted at $\sim 30$ degrees relative to the direction of motion, with a semi-minor axis similar to the stellar radius.

astro-ph.IM

A Wavelet Plancherel Theory with Application to Multipliers and Sparse Approximations

We introduce an extension of continuous wavelet theory that enables an efficient implementation of multiplicative operators in the coefficient space. In the new theory, the signal space is embedded in a larger abstract signal space -- the so called window-signal space. There is a canonical extension of the wavelet transform to an isometric isomorphism between the window-signal space and the coefficient space. Hence, the new framework is called a wavelet-Plancherel theory, and the extended wavelet transform is called the wavelet-Plancherel transform. Since the wavelet-Plancherel transform is an isometric isomorphism, any operation in the coefficient space can be pulled-back to an operation in the window-signal space. It is then possible to improve the computational complexity of methods that involve a multiplicative operator in the coefficient space, by performing all computations directly in the window-signal space. As one example application, we show how continuous wavelet multipliers (also called Calderón-Toeplitz Operators), with polynomial symbols, can be implemented with linear complexity in the resolution of the 1D signal. As another example, we develop a framework for efficiently computing greedy sparse approximations to signals based on elements of continuous wavelet systems.

cs.IT

Wavelet Design with Optimally Localized Ambiguity Function: a Variational Approach

In this paper, we design mother wavelets for the 1D continuous wavelet transform with some optimality properties. An optimal mother wavelet here is one that has an ambiguity function with minimal spread in the continuous coefficient space (also called phase space). Since the ambiguity function is the reproducing kernel of the coefficient space, optimal windows lead to phase space representations which are "optimally sharp." Namely, the wavelet coefficients have minimal correlations with each other. Such a construction also promotes sparsity in phase space. The spread of the ambiguity function is modeled as the sum of variances along the axes in phase space. In order to optimize the mother wavelet directly as a 1D signal, we pull-back the variances, defined on the 2D phase space, to the so called window-signal space. This is done using the recently developed wavelet-Plancharel theory. The approach allows formulating the optimization problem of the 2D ambiguity function as a minimization problem of the 1D mother wavelet. The resulting 1D formulation is more efficient and does not involve complicated constraints on the 2D ambiguity function. We optimize the mother wavelet using gradient descent, which yields a locally optimal mother wavelet.

math.FA

Solving the functional Eigen-Problem using Neural Networks

In this work, we explore the ability of NN (Neural Networks) to serve as a tool for finding eigen-pairs of ordinary differential equations. The question we aime to address is whether, given a self-adjoint operator, we can learn what are the eigenfunctions, and their matching eigenvalues. The topic of solving the eigen-problem is widely discussed in Image Processing, as many image processing algorithms can be thought of as such operators. We suggest an alternative to numeric methods of finding eigenpairs, which may potentially be more robust and have the ability to solve more complex problems. In this work, we focus on simple problems for which the analytical solution is known. This way, we are able to make initial steps in discovering the capabilities and shortcomings of DNN (Deep Neural Networks) in the given setting.

cs.LG

From Logistic Growth to Exponential Growth in a Population Dynamical Model

Dynamics among central sources (hubs) providing a resource and large number of components enjoying and contributing to this resource describes many real life situations. Modeling, controlling, and balancing this dynamics is a general problem that arises in many scientific disciplines. We analyze a stochastic dynamical system exhibiting this dynamics with a multiplicative noise. We show that this model can be solved exactly by passing to variables that describe the mass ratio between the components and the hub. We derive a deterministic equation for the average mass ratio. This equation describes logistic growth. We derive the full phase diagram of the model and identify three regimes by calculating the sample and moment Lyapunov exponent of the system. The first regime describes full balance between the non-hub components and the hub, in the second regime the entire resource is concentrated mainly in the hub, and in the third regime the resource is localized on a few non-hub components and the hub. Surprisingly, in the limit of large number of components the transition values do not depend on the amount of resource given by the hub. This model has interesting application in the context of analysis of porous media using Magnetic Resonance (MR) techniques.

physics.data-an

On the use of multiple compartment epidemiological models to describe the dynamics of influenza in Europe

We develop a multiple compartment Susceptible-Infected-Recovered (SIR) model to analyze the spread of several infectious diseases through different geographic areas. Additionally, we propose a data-quality sensitive optimization framework for fitting this model to observed data. We fit the model to the temporal profile of the number of people infected by one of six influenza strains in Europe over $7$ influenza seasons. In addition to describing the temporal and spatial spread of influenza, the model provides an estimate of the inter-country and intra-country infection and recovery rates of each strain and in each season. We find that disease parameters remain relatively stable, with a correlation greater than $0.5$ over seasons and stains. Clustering of influenza strains by the inferred disease parameters is consistent with genome sub-types. Surprisingly, our analysis suggests that inter-country human mobility plays a negligible role in the spread of influenza in Europe. Finally, we show that the model allows the estimation of disease load in countries with poor or none existent data from the disease load in adjacent countries. Our findings reveal information on the spreading mechanism of influenza and on disease parameters. These can be used to assist in disease surveillance and in control of influenza as well as of other infectious pathogens in a heterogenic environment.

q-bio.PE

Unsupervised Deep Learning Algorithm for PDE-based Forward and Inverse Problems

We propose a neural network-based algorithm for solving forward and inverse problems for partial differential equations in unsupervised fashion. The solution is approximated by a deep neural network which is the minimizer of a cost function, and satisfies the PDE, boundary conditions, and additional regularizations. The method is mesh free and can be easily applied to an arbitrary regular domain. We focus on 2D second order elliptical system with non-constant coefficients, with application to Electrical Impedance Tomography.

cs.LG

Uncertainty principles and optimally sparse wavelet transforms

In this paper we introduce a new localization framework for wavelet transforms, such as the 1D wavelet transform and the Shearlet transform. Our goal is to design nonadaptive window functions that promote sparsity in some sense. For that, we introduce a framework for analyzing localization aspects of window functions. Our localization theory diverges from the conventional theory in two ways. First, we distinguish between the group generators, and the operators that measure localization (called observables). Second, we define the uncertainty of a signal transform based on a window as a whole, instead of defining the uncertainty of an individual window. We show that the uncertainty of a window function, in the signal space, is closely related to the localization of the reproducing kernel of the wavelet transform, in phase space. As a result, we show that using uncertainty minimizing window functions, results in representations which are optimally sparse in some sense.

cs.IT

Affine-invariant diffusion geometry for the analysis of deformable 3D shapes

We introduce an (equi-)affine invariant diffusion geometry by which surfaces that go through squeeze and shear transformations can still be properly analyzed. The definition of an affine invariant metric enables us to construct an invariant Laplacian from which local and global geometric structures are extracted. Applications of the proposed framework demonstrate its power in generalizing and enriching the existing set of tools for shape analysis.

cs.CV

Affine-invariant geodesic geometry of deformable 3D shapes

Natural objects can be subject to various transformations yet still preserve properties that we refer to as invariants. Here, we use definitions of affine invariant arclength for surfaces in R^3 in order to extend the set of existing non-rigid shape analysis tools. In fact, we show that by re-defining the surface metric as its equi-affine version, the surface with its modified metric tensor can be treated as a canonical Euclidean object on which most classical Euclidean processing and analysis tools can be applied. The new definition of a metric is used to extend the fast marching method technique for computing geodesic distances on surfaces, where now, the distances are defined with respect to an affine invariant arclength. Applications of the proposed framework demonstrate its invariance, efficiency, and accuracy in shape analysis.

cs.CV