Bartomeu Coll
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Bartomeu Coll has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Antoni Buades
Universitat Illes Balears, Spain
4 shared publications - Joan Duran
DMI and IAC3, University of the Balearic Islands, Palma, Spain
4 shared publications - Catalina Sbert
DMI and IAC3, University of the Balearic Islands, Palma, Spain
3 shared publications - Jean-Michel Morel
Lingnan University
2 shared publications - Rafel Prohens
Departament de Ciències Matemàtiques i Informàtica, Universitat de les Illes Balears, IAC3, 07122 Palma (Illes Balears), Spain
2 shared publications - Antoni Ferragut
Universitat Jaume I, Edifici TI (ESTEC)
1 shared publication
Latest Publications
- Open Access
- 31 May 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (11) , 1265
Variational Fusion of Hyperspectral Data by Non-Local Filtering
The fusion of multisensor data has attracted a lot of attention in computer vision, particularly among the remote sensing community. Hyperspectral image fusion consists in merging the spectral information of a hyperspectral image with the geometry of a multispectral one in order to infer an image with high spatial and spectral resolutions. In this paper, we propose a variational fusion model with a nonlocal regularization term that encodes patch-based filtering conditioned to the geometry of the multispectral data. We further incorporate a radiometric constraint that injects the high frequencies of the scene into the fused product with a band per band modulation according to the energy levels of the multispectral and hyperspectral images. The proposed approach proved robust to noise and aliasing. The experimental results demonstrate the performance of our method with respect to the state-of-the-art techniques on data acquired by commercial hyperspectral cameras and Earth observation satellites.
- 31 May 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (11) , 1265
Open AccessVariational Fusion of Hyperspectral Data by Non-Local Filtering
The fusion of multisensor data has attracted a lot of attention in computer vision, particularly among the remote sensing community. Hyperspectral image fusion consists in merging the spectral information of a hyperspectral image with the geometry of a multispectral one in order to infer an image with high spatial and spectral resolutions. In this paper, we propose a variational fusion model with a nonlocal regularization term that encodes patch-based filtering conditioned to the geometry of the multispectral data. We further incorporate a radiometric constraint that injects the high frequencies of the scene into the fused product with a band per band modulation according to the energy levels of the multispectral and hyperspectral images. The proposed approach proved robust to noise and aliasing. The experimental results demonstrate the performance of our method with respect to the state-of-the-art techniques on data acquired by commercial hyperspectral cameras and Earth observation satellites.
- Open Access
A Survey of Pansharpening Methods with A New Band-Decoupled Variational Model
Most satellites decouple the acquisition of a panchromatic image at high spatial resolution from the acquisition of a multispectral image at lower spatial resolution. Pansharpening is a fusion technique used to increase the spatial resolution of the multispectral data while simultaneously preserving its spectral information. In this paper, we consider pansharpening as an optimization problem minimizing a cost function with a nonlocal regularization term. The energy functional which is to be minimized decouples for each band, thus permitting the application to misregistered spectral components. This requirement is achieved by dropping the, commonly used, assumption that relates the spectral and panchromatic modalities by a linear transformation. Instead, a new constraint that preserves the radiometric ratio between the panchromatic and each spectral component is introduced. An exhaustive performance comparison of the proposed fusion method with several classical and state-of-the-art pansharpening techniques illustrates its superiority in preserving spatial details, reducing color distortions, and avoiding the creation of aliasing artifacts.
Open AccessA Survey of Pansharpening Methods with A New Band-Decoupled Variational Model
Most satellites decouple the acquisition of a panchromatic image at high spatial resolution from the acquisition of a multispectral image at lower spatial resolution. Pansharpening is a fusion technique used to increase the spatial resolution of the multispectral data while simultaneously preserving its spectral information. In this paper, we consider pansharpening as an optimization problem minimizing a cost function with a nonlocal regularization term. The energy functional which is to be minimized decouples for each band, thus permitting the application to misregistered spectral components. This requirement is achieved by dropping the, commonly used, assumption that relates the spectral and panchromatic modalities by a linear transformation. Instead, a new constraint that preserves the radiometric ratio between the panchromatic and each spectral component is introduced. An exhaustive performance comparison of the proposed fusion method with several classical and state-of-the-art pansharpening techniques illustrates its superiority in preserving spatial details, reducing color distortions, and avoiding the creation of aliasing artifacts.
- Open Access
- 1 January 2015
- Published by American Institute of Mathematical Sciences (AIMS) in Inverse Problems and Imaging
- Vol. 9 (2) , 337-370
Half-linear regularization for nonconvex image restoration models
Image restoration is the problem of recovering an original image from an observation of it in order to extract the most meaningful information. In this paper, we study this problem from a variational point of view through the minimization of energies composed of a quadratic data-fidelity term and a nonsmooth nonconvex regularization term. In the discrete setting, existence of minimizer is proved for arbitrary linear operators. For this kind of problems, fully segmented solutions can be found by minimizing objective nonconvex functionals. We propose a dual formulation of the model by introducing an auxiliary variable with a double function. On one hand, it marks the edges and it ensures their preservation from smoothing. On the other hand, it makes the criterion half-linear in the sense that the dual energy depends linearly on the gradient of the image to be recovered. This leads to design an efficient optimization algorithm with wide applicability to several image restoration tasks such as denoising and deconvolution. Finally, we present experimental results and we compare them with TV-based image restoration algorithms.
- 1 January 2015
- Published by American Institute of Mathematical Sciences (AIMS) in Inverse Problems and Imaging
- Vol. 9 (2) , 337-370
Open AccessHalf-linear regularization for nonconvex image restoration models
Image restoration is the problem of recovering an original image from an observation of it in order to extract the most meaningful information. In this paper, we study this problem from a variational point of view through the minimization of energies composed of a quadratic data-fidelity term and a nonsmooth nonconvex regularization term. In the discrete setting, existence of minimizer is proved for arbitrary linear operators. For this kind of problems, fully segmented solutions can be found by minimizing objective nonconvex functionals. We propose a dual formulation of the model by introducing an auxiliary variable with a double function. On one hand, it marks the edges and it ensures their preservation from smoothing. On the other hand, it makes the criterion half-linear in the sense that the dual energy depends linearly on the gradient of the image to be recovered. This leads to design an efficient optimization algorithm with wide applicability to several image restoration tasks such as denoising and deconvolution. Finally, we present experimental results and we compare them with TV-based image restoration algorithms.
- Open Access
- 28 February 2014
- Published by Image Processing On Line in Image Processing On Line
- Vol. 4, 1-15
Implementation of Nonlocal Pansharpening Image Fusion
This paper focuses on the implementation of the pansharpened image fusion technique proposed in the companion paper [A Nonlocal Variational Model for Pansharpening Image Fusion, SIAM Journal on Imaging Sciences, 2014, to appear]. Pansharpening refers to the process of inferring a high resolution multispectral image from a high resolution panchromatic image and low resolution multispectral one. Although quite successful in terms of relative error, state-of-the-art pansharpening methods still introduce relevant color artifacts. The variational pansharpening model proposed by Buades et al. incorporates a nonlocal regularization term that takes ad- vantage of image self-similarity, leading to signicant reduction of the above-mentioned color artifacts.
- 28 February 2014
- Published by Image Processing On Line in Image Processing On Line
- Vol. 4, 1-15
Open AccessImplementation of Nonlocal Pansharpening Image Fusion
This paper focuses on the implementation of the pansharpened image fusion technique proposed in the companion paper [A Nonlocal Variational Model for Pansharpening Image Fusion, SIAM Journal on Imaging Sciences, 2014, to appear]. Pansharpening refers to the process of inferring a high resolution multispectral image from a high resolution panchromatic image and low resolution multispectral one. Although quite successful in terms of relative error, state-of-the-art pansharpening methods still introduce relevant color artifacts. The variational pansharpening model proposed by Buades et al. incorporates a nonlocal regularization term that takes ad- vantage of image self-similarity, leading to signicant reduction of the above-mentioned color artifacts.
- Top Cited PapersOpen Access
- 13 September 2011
- Published by Image Processing On Line in Image Processing On Line
- Vol. 1, 208-212
Non-Local Means Denoising
We present in this paper a new denoising method called non-local means. The method is based on a simple principle: replacing the color of a pixel with an average of the colors of similar pixels. But the most similar pixels to a given pixel have no reason to be close at all. It is therefore licit to scan a vast portion of the image in search of all the pixels that really resemble the pixel one wants to denoise. The paper presents two implementations of the method and displays some results
- 13 September 2011
- Published by Image Processing On Line in Image Processing On Line
- Vol. 1, 208-212
Top Cited PapersOpen AccessNon-Local Means Denoising
We present in this paper a new denoising method called non-local means. The method is based on a simple principle: replacing the color of a pixel with an average of the colors of similar pixels. But the most similar pixels to a given pixel have no reason to be close at all. It is therefore licit to scan a vast portion of the image in search of all the pixels that really resemble the pixel one wants to denoise. The paper presents two implementations of the method and displays some results
- 21 April 2010
- Published by Elsevier in Nonlinear Analysis
- Vol. 73 (4) , 881-914
Polynomial inverse integrating factors for quadratic differential systems
- 21 April 2010
- Published by Elsevier in Nonlinear Analysis
- Vol. 73 (4) , 881-914
Polynomial inverse integrating factors for quadratic differential systems
- Open Access
- 1 January 2009
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems
- Vol. 23 (3) , 699-729
Quadratic perturbations of a class of quadratic reversible systems with two centers
Quadratic perturbations of a one-parameter family of quadratic reversible systems with two centers (without other singularities in finite plane) are studied. The exact upper bound of the number of limit cycles, the configurations of limit cycles, and the bifurcation diagrams for different range of the parameter are given.
- 1 January 2009
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems
- Vol. 23 (3) , 699-729
Open AccessQuadratic perturbations of a class of quadratic reversible systems with two centers
Quadratic perturbations of a one-parameter family of quadratic reversible systems with two centers (without other singularities in finite plane) are studied. The exact upper bound of the number of limit cycles, the configurations of limit cycles, and the bifurcation diagrams for different range of the parameter are given.
- 12 September 2006
- Published by Springer Nature in Numerische Mathematik
- Vol. 105 (1) , 1-34
Neighborhood filters and PDE’s
- 12 September 2006
- Published by Springer Nature in Numerische Mathematik
- Vol. 105 (1) , 1-34
Neighborhood filters and PDE’s
- Open Access
- 1 January 2006
- Published by American Institute of Mathematical Sciences (AIMS) in Communications on Pure and Applied Analysis
- Vol. 5 (3) , 537-550
On a criterium of global attraction for discrete dynamical systems
Consider that the origin is a fix point of a discrete dynamical system $x^{(n+1)}=F(x^{(n)})$, defined in the whole $\mathbb R^m.$ LaSalle, in his book of 1976, [13], proposes to study several conditions which might imply global attraction. One of his suggestions is to write $F(x)=A(x)x$, where $A(x)$ is a real $m\times m$ matrix, and to assume that all the eigenvalues of eigenvalues of $A(x)$, for all $x\in \mathbb R^m$, have modulus smaller than one. In the paper [4], Cima et al. show that, when $m\ge2$, such hypothesis does not guarantee that the origin is a global attractor, even for polynomial maps $F$. From the observation that the decomposition of $F(x)$ as $A(x)x$ is not unique, in this paper we wonder whether LaSalle condition, for a special and canonical choice of $A,$ forces the origin to be a global attractor. This canonical choice is given by $A_c(x)=\int_0^1 DF(sx) ds,$ where the integration of the matrix $DF(x)$ is made term by term. In fact, we prove that LaSalle condition for $A_c(x)$ is a sufficient condition to get the global attraction of the origin when $m=1,$ or when $m=2$ and $F$ is polynomial. We also show that this is no more true for $m=2$ when $F$ is a rational map or when $m\ge3.$ Finally we consider the equivalent question for ordinary differential equations.- 1 January 2006
- Published by American Institute of Mathematical Sciences (AIMS) in Communications on Pure and Applied Analysis
- Vol. 5 (3) , 537-550
Open AccessOn a criterium of global attraction for discrete dynamical systems
Consider that the origin is a fix point of a discrete dynamical system $x^{(n+1)}=F(x^{(n)})$, defined in the whole $\mathbb R^m.$ LaSalle, in his book of 1976, [13], proposes to study several conditions which might imply global attraction. One of his suggestions is to write $F(x)=A(x)x$, where $A(x)$ is a real $m\times m$ matrix, and to assume that all the eigenvalues of eigenvalues of $A(x)$, for all $x\in \mathbb R^m$, have modulus smaller than one. In the paper [4], Cima et al. show that, when $m\ge2$, such hypothesis does not guarantee that the origin is a global attractor, even for polynomial maps $F$. From the observation that the decomposition of $F(x)$ as $A(x)x$ is not unique, in this paper we wonder whether LaSalle condition, for a special and canonical choice of $A,$ forces the origin to be a global attractor. This canonical choice is given by $A_c(x)=\int_0^1 DF(sx) ds,$ where the integration of the matrix $DF(x)$ is made term by term. In fact, we prove that LaSalle condition for $A_c(x)$ is a sufficient condition to get the global attraction of the origin when $m=1,$ or when $m=2$ and $F$ is polynomial. We also show that this is no more true for $m=2$ when $F$ is a rational map or when $m\ge3.$ Finally we consider the equivalent question for ordinary differential equations. - 1 March 2002
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 16 (2) , 89-105
Geometry and Color in Natural Images
- 1 March 2002
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 16 (2) , 89-105
Geometry and Color in Natural Images