Published Works
These works are published in IPOL.
Algebraic Lens Distortion Model Estimation
by
With an algebraic approach to the estimation of the lens distortion parameters based on the rectification of lines in the image, we obtain the lens distortion parameters by minimizing a 4 total-degree polynomial in several variables.
With an algebraic approach to the estimation of the lens distortion parameters based on the rectification of lines in the image, we obtain the lens distortion parameters by minimizing a 4 total-degree polynomial in several variables.
Workshops
These works are available in IPOL. Some are accepted works being refined and updated for a future publication, and others are real workshops.
Finite Difference Schemes for MCM and AMSS
by
The two algorithms apply finite difference schemes respectively for Mean Curvature Motion and Affine Morphological Scale Space.
The two algorithms apply finite difference schemes respectively for Mean Curvature Motion and Affine Morphological Scale Space.
A Real Time Morphological Snakes Algorithm
by
We use a morphological approach to Partial Differential Equation discretization to design a real time algorithm for snake evolution
We use a morphological approach to Partial Differential Equation discretization to design a real time algorithm for snake evolution
Self-Similarity Driven Demosaicking
by
The SSD demosaicking algorithm interpolates missing color values of a CFA mosaick by using the self similarity of the image.
The SSD demosaicking algorithm interpolates missing color values of a CFA mosaick by using the self similarity of the image.
Image Crop
by
Development prototype for the interactive selection of a sub-image, based on HTML-only tools with JavaScript enhancements.
Development prototype for the interactive selection of a sub-image, based on HTML-only tools with JavaScript enhancements.
Simplest Color Balance
by
This color balance improves an image by stretching each color channel to [0,255] by an affine transformation with the saturation of a user-defined percentage of pixels.
This color balance improves an image by stretching each color channel to [0,255] by an affine transformation with the saturation of a user-defined percentage of pixels.
Cartoon+Texture Image Decomposition
by
The cartoon+texture algorithm decomposes any image into the sum of a cartoon part, where only the image contrasted shapes appear, and a textural part with the oscillating patterns.
The cartoon+texture algorithm decomposes any image into the sum of a cartoon part, where only the image contrasted shapes appear, and a textural part with the oscillating patterns.
Micro-Texture Synthesis by Phase Randomization
by
micro-texture synthesis using Fourier phase randomization
micro-texture synthesis using Fourier phase randomization
Image burst denoising
by
A clear image can be obtained from a sequence of noisy images by registration, video equalization, noise estimation and denoising.
A clear image can be obtained from a sequence of noisy images by registration, video equalization, noise estimation and denoising.
Image Curvature Microscope
by
The sub-pixel algorithm computes the image curvature directly on smoothed level lines, and yields a microscopic visualization of the curvature map.
The sub-pixel algorithm computes the image curvature directly on smoothed level lines, and yields a microscopic visualization of the curvature map.
LSD: a Line Segment Detector
by
LSD is a linear-time Line Segment Detector that gives accurate results, a controlled number of false detections, and requires no parameter tuning. The method is based in Burns, Hanson, and Riseman method, and uses an _a contrario_ validation approach according to Desolneux, Moisan, and Morel theory.
LSD is a linear-time Line Segment Detector that gives accurate results, a controlled number of false detections, and requires no parameter tuning. The method is based in Burns, Hanson, and Riseman method, and uses an _a contrario_ validation approach according to Desolneux, Moisan, and Morel theory.
Retinex Poisson Equation : a Model for Color Perception
by
An exact and fast implementation of the Land-McCann Retinex theory (1964) is achieved by means of a screened Poisson equation using only two DFTs.
An exact and fast implementation of the Land-McCann Retinex theory (1964) is achieved by means of a screened Poisson equation using only two DFTs.