An Optimization Based Empirical Mode Decomposition Scheme for Images

Bidimensional empirical mode decompositions (BEMD) have been developed to decompose any bivariate function or image additively into multiscale components, so-called intrinsic mode functions (IMFs), which are approximately orthogonal to each other with respect to the $\ell_2$ inner product. In this paper, a novel optimization problem is designed to achieve this decomposition which takes into account important features desired of the BEMD. Specifically, we propose a data-adapted iterative method which we call Opt-BEMD which minimizes in each iteration a smoothness functional subject to inequality constraints involving the strictly local extrema of the image. In this way, the method constructs a sparse data-adapted basis for the input function as well as an envelope in a mathematically stringent sense. Moreover, we propose an ensemble version of Opt-BEMD to strengthen its performance when applied to noise-contaminated images or images with only few extrema

2-D Prony-Huang Transform: A New Tool for 2-D Spectral Analysis

This work proposes an extension of the 1-D Hilbert Huang transform for the analysis of images. The proposed method consists in (i) adaptively decomposing an image into oscillating parts called intrinsic mode functions (IMFs) using a mode decomposition procedure, and (ii) providing a local spectral analysis of the obtained IMFs in order to get the local amplitudes, frequencies, and orientations. For the decomposition step, we propose two robust 2-D mode decompositions based on non-smooth convex optimization: a "Genuine 2-D" approach, that constrains the local extrema of the IMFs, and a "Pseudo 2-D" approach, which constrains separately the extrema of lines, columns, and diagonals. The spectral analysis step is based on Prony annihilation property that is applied on small square patches of the IMFs. The resulting 2-D Prony-Huang transform is validated on simulated and real data.Comment: 24 pages, 7 figure

Empirical mode decomposition-based facial pose estimation inside video sequences

We describe a new pose-estimation algorithm via integration of the strength in both empirical mode decomposition (EMD) and mutual information. While mutual information is exploited to measure the similarity between facial images to estimate poses, EMD is exploited to decompose input facial images into a number of intrinsic mode function (IMF) components, which redistribute the effect of noise, expression changes, and illumination variations as such that, when the input facial image is described by the selected IMF components, all the negative effects can be minimized. Extensive experiments were carried out in comparisons to existing representative techniques, and the results show that the proposed algorithm achieves better pose-estimation performances with robustness to noise corruption, illumination variation, and facial expressions

Single-shot fringe pattern phase retrieval using improved period-guided bidimensional empirical mode decomposition and Hilbert transform

Fringe pattern analysis is the central aspect of numerous optical measurement methods, e.g., interferometry, fringe projection, digital holography, quantitative phase microscopy. Experimental fringe patterns always contain significant features originating from fluctuating environment, optical system and illumination quality, and the sample itself that severely affect analysis outcome. Before the stage of phase retrieval (information decoding) interferogram needs proper filtering, which minimizes the impact of mentioned issues. In this paper we propose fully automatic and adaptive fringe pattern pre-processing technique - improved period guided bidimensional empirical mode decomposition algorithm (iPGBEMD). It is based on our previous work about PGBEMD which eliminated the mode-mixing phenomenon and made the empirical mode decomposition fully adaptive. In present work we overcame key problems of original PGBEMD – we have considerably increased algorithm’s application range and shortened computation time several-fold. We proposed three solutions to the problem of erroneous decomposition for very low fringe amplitude images, which limited original PGBEMD significantly and we have chosen the best one among them after comprehensive analysis. Several acceleration methods were also proposed and merged to ensure the best results. We combined our improved pre-processing algorithm with the Hilbert Spiral Transform to receive complete, consistent, and versatile fringe pattern analysis path. Quality and effectiveness evaluation, in comparison with selected reference methods, is provided using numerical simulations and experimental fringe data

BEMDEC: An Adaptive and Robust Methodology for Digital Image Feature Extraction

The intriguing study of feature extraction, and edge detection in particular, has, as a result of the increased use of imagery, drawn even more attention not just from the field of computer science but also from a variety of scientific fields. However, various challenges surrounding the formulation of feature extraction operator, particularly of edges, which is capable of satisfying the necessary properties of low probability of error (i.e., failure of marking true edges), accuracy, and consistent response to a single edge, continue to persist. Moreover, it should be pointed out that most of the work in the area of feature extraction has been focused on improving many of the existing approaches rather than devising or adopting new ones. In the image processing subfield, where the needs constantly change, we must equally change the way we think. In this digital world where the use of images, for variety of purposes, continues to increase, researchers, if they are serious about addressing the aforementioned limitations, must be able to think outside the box and step away from the usual in order to overcome these challenges. In this dissertation, we propose an adaptive and robust, yet simple, digital image features detection methodology using bidimensional empirical mode decomposition (BEMD), a sifting process that decomposes a signal into its two-dimensional (2D) bidimensional intrinsic mode functions (BIMFs). The method is further extended to detect corners and curves, and as such, dubbed as BEMDEC, indicating its ability to detect edges, corners and curves. In addition to the application of BEMD, a unique combination of a flexible envelope estimation algorithm, stopping criteria and boundary adjustment made the realization of this multi-feature detector possible. Further application of two morphological operators of binarization and thinning adds to the quality of the operator

Content based Medical Image Retrieval: use of Generalized Gaussian Density to model BEMD's IMF.

In this paper, we address the problem of medical ddiagnosis aid through content based image retrieval methods. We propose to characterize images without extracting local features, by using global information extracted from the image Bidimensional Empirical Mode Decomposition (BEMD). This method decompose image into a set of functions named Intrinsic Mode Functions (IMF) and a residu. The generalized Gaussian density function (GGD) is used to represent the coefficients derived from each IMF, and the Kullback–Leibler Distance (KLD) compute the similarity between GGDs. Retrieval efficiency is given for different databases including a diabetic retinopathy, and a face database. Results are promising: the retrieval efficiency is higher than 85% for some cases