Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Data Projection
References
All Topics
Computer Science
Computer Vision

Morphological component analysis

Profile image of J.-l. StarckJ.-l. Starck

2005, Wavelets XI

https://doi.org/10.1117/12.615237
visibility

…

description

16 pages

link

1 file

Abstract

The Morphological Component Analysis (MCA) is a a new method which allows us to separate features contained in an image when these features present different morphological aspects. We show that MCA can be very useful for decomposing images into texture and piecewise smooth (cartoon) parts or for inpainting applications. We extend MCA to a multichannel MCA (MMCA) for analyzing multispectral data and present a range of examples which illustrates the results.

Related papers

Component analysis of spatial and spectral patterns in multispectral images I Basis
Shigeo Minami

Journal of the Optical Society of America A, 1987

A new (to our knowledge) theory of component pattern analysis in multispectral images is developed by using the methods of principal component analysis and nonlinear optimization with a nonnegativity constraint. Given images of a scene in different color bands, we estimate both the spectral curves of components included in the image and the spatial pattern corresponding to each spectral curve. In this method, neither spatial nor spectral features of the components are necessary, but the physical rule of nonnegative absorptivity and density nonnegativity is used for any material of any optical frequency at any position in the image. Experimental results of component analysis with real microscopic image data are shown to demonstrate the effectiveness of the proposed method.

View PDFchevron_right
Kernel principal component analysis for the construction of the extended morphological profile
Jocelyn Chanussot

2009

Kernel Principal Component Analysis (KPCA) is investigated for feature extraction from hyperspectral remotesensing data. Features extracted using KPCA are used to construct the Extended Morphological Profile (EMP). Classification results, in terms of accuracy, are improved in comparison to original approach which used conventional principal component analysis for constructing the EMP. Experimental results presented in this paper confirm the usefulness of the KPCA for the analysis of hyperspectral data. The overall classification accuracy increases from 79% to 96% with the proposed approach.

View PDFchevron_right
Classification of hyperspectral data from urban areas using morphological preprocessing and independent component analysis
Jocelyn Chanussot, Jón Atli Benediktsson

2005

Classification of high-resolution hyperspectral data is investigated. Previously, in classification of high-resolution panchromatic data, simple morphological profiles have been constructed with a repeated use of morphological opening and closing operators with a structuring element of increasing size, starting with the original panchromatic image. This approach has recently been extended for hyperspectral data. In the extension, principal components of the hyperspectral imagery have been computed in order to produce an extended morphological profile. In this paper, we investigate the use of independent components instead of principal components in extended morphological profiles, i.e., selected independent components are used as base images for an extended morphological profile. In the proposed approach, the extended morphological profiles based on the independent components are used as inputs to a neural network classifier. In experiments, a hyperspectral data sets from an urban area in Pavia, Italy is classified.

View PDFchevron_right
Computing Multivalued Mathematical Morphology on Multiband Images Using Algorithms for Multicriteria Analysis
Taibi aude Nuscia

Image analysis & stereology, 2024

View PDFchevron_right
Image fusion with morphological component analysis
rishu garg

Image fusion can produce a single image that describes the scene better than the individual source image. One of the keys to image fusion algorithm is how to effectively and completely represent the source images. Morphological component analysis (MCA) believes that an image contains structures with different spatial morphologies and can be accordingly modeled as a superposition of cartoon and texture components, and that the sparse representations of these components can be obtained by some specific decomposition algorithms which exploit the structured dictionary. Compared with the traditional multiscale decomposition, which has been successfully applied to pixel-level image fusion, MCA employs the morphological diversity of an image and provides more complete representation for an image. Taking advantage of this property, we propose a multi-component fusion method for multi-source images in this paper. In our method, source images are separated into cartoon and texture components, and essential fusion takes place on the representation coefficients of these two components. Our fusion scheme is verified on three kinds of images and compared with six single-component fusion methods. According to the visual perceptions and objective evaluations on the fused results, our method can produce better fused images in our experiments, compared with other single-component fusion methods.

View PDFchevron_right
Morphological Image Processing
Muhammad Kusban

2011

The purpose of this paper is to provide readers with an in-depth presentation of the principles and applications of morphological image analysis. This is achieved through a step by step process starting from the basic morphological operators and extending to the most recent advances which have proven their practical usefulness. This self-contained volume will be valuable to all engineers, scientists, and practitioners interested in the analysis and processing of digital images.

View PDFchevron_right
Image Anal Stereol 2007;26:101-109 Original Research Paper MORPHOLOGICAL SEGMENTATION OF HYPERSPECTRAL IMAGES
Guillaume Noyel

2007

The present paper develops a general methodology for the morphological segmentation of hyperspectral images, i.e., with an important number of channels. This approach, based on watershed, is composed of a spectral classification to obtain the markers and a vectorial gradient which gives the spatial information. Several alternative gradients are adapted to the different hyperspectral functions. Data reduction is performed either by Factor Analysis or by model fitting. Image segmentation is done on different spaces: factor space, parameters space, etc. On all these spaces the spatial/spectral segmentation approach is applied, leading to relevant results on the image.

View PDFchevron_right
MORPHOLOGICAL SEGMENTATION OF HYPERSPECTRAL IMAGES
Guillaume Noyel

Image Analysis & Stereology, 2007

The present paper develops a general methodology for the morphological segmentation of hyperspectral images, i.e., with an important number of channels. This approach, based on watershed, is composed of a spectral classification to obtain the markers and a vectorial gradient which gives the spatial information. Several alternative gradients are adapted to the different hyperspectral functions. Data reduction is performed either by Factor Analysis or by model fitting. Image segmentation is done on different spaces: factor space, parameters space, etc. On all these spaces the spatial/spectral segmentation approach is applied, leading to relevant results on the image.

View PDFchevron_right
Orthogonalise Digital Morphological Features Using Principal Component Analysis
Ramesh Manza

2016

Plants play an important role in preserving earth ecology and maintaining healthy atmosphere. Most of the food sources are from plants. So it is necessary to establish a system to extract the features of plant. As there are large variety of plant species available in the universe . There are various parts of plant which can be chosen for feature extraction. In this research we choose shape of leaf to extract the features. Every plant leaf has variety of features to extract. This research reduces large number of digital morphological features to five principal components. This research describes procedure to transform raw image to a preprocess image for feature extraction. Further five geometrical features are extracted from preprocessed image and from geometrical features twelve digital morphological features are extracted. Due to large number of digital morphological features it is difficult to proceed for further for plant identification. These twelve digital morphological feature...

View PDFchevron_right
Classification of hyperspectral images by using morphological attribute filters and Independent Component Analysis
Mauro Dalla Mura

2010 2nd Workshop on Hyperspectral Image and Signal Processing: Evolution in Remote Sensing, 2010

In this letter, a technique based on independent component analysis (ICA) and extended morphological attribute profiles (EAPs) is presented for the classification of hyperspectral images. The ICA maps the data into a subspace in which the components are as independent as possible. APs, which are extracted by using several attributes, are applied to each image associated with an extracted independent component, leading to a set of extended EAPs. Two approaches are presented for including the computed profiles in the analysis. The features extracted by the morphological processing are then classified with an SVM. The experiments carried out on two hyperspectral images proved the effectiveness of the proposed technique. Index Terms-Attribute filters, decision fusion, extended attribute profile (EAP), independent component analysis (ICA), mathematical morphology, remote sensing.

View PDFchevron_right

References (30)

  1. S. Mallat and Z. Zhang, "Atomic decomposition by basis pursuit," IEEE Transactions on Signal Process- ing 41, pp. 3397-3415, 1993.
  2. S. Mallat, A Wavelet Tour of Signal Processing, Academic Press, 1998.
  3. S. Chen, D. Donoho, and M. Saunder, "Atomic decomposition by basis pursuit," SIAM Journal on Scientific Computing 20, pp. 33-61, 1998.
  4. I. Daubechies, "Time-frequency localization operators: A geometric phase space approach," IEEE Transac- tions on Information Theory 34, pp. 605-612, 1988.
  5. D. Donoho and X. Huo, "Uncertainty Principles and Ideal Atomic Decomposition," IEEE Transactions on Information Theory 47(7), pp. 2845-2862, 2001.
  6. D. L. Donoho and M. Elad, "Maximal sparsity representation via l 1 minimization," the Proc. Nat. Aca. Sci. 100, pp. 2197-2202, 2003.
  7. M. Elad and A. Bruckstein, "A generalized uncertainty principle and sparse representation in pairs of bases," IEEE Transactions on Information Theory 48, pp. 2558-2567, 2002.
  8. R. Gribonval and M. Nielsen, "Some remarks on nonlinear approximation with schauder bases," East J. on Approx. 7(2), pp. 267-285, 2001.
  9. D. Donoho and I. Johnstone, "Ideal spatial adaptation via wavelet shrinkage," Biometrika 81, pp. 425-455, 1994.
  10. A. Bruce, S. Sardy, and P. Tseng, "Block coordinate relaxation methods for nonparametric signal de- noising," Proceedings of the SPIE -The International Society for Optical Engineering 3391, pp. 75-86, 1998.
  11. J.-L. Starck, F. Murtagh, and A. Bijaoui, Image Processing and Data Analysis: The Multiscale Approach, Cambridge University Press, 1998.
  12. E. Candès and D. Donoho, "Ridgelets: the key to high dimensional intermittency?," Philosophical Trans- actions of the Royal Society of London A 357, pp. 2495-2509, 1999.
  13. M. Bertalmio, L. Vese, G. Sapiro, and S. Osher, "Simultaneous structure and texture image inpainting," IEEE Trans. on Image Processing 12, pp. 882-889, 2003.
  14. Y. Meyer, "Oscillating patterns in image processing and non linear evolution equations," University Lecture Series Volume 22, AMS , 2002.
  15. L. Vese and S. Osher, "Modeling textures with total variation minimization and oscillating patterns in image processing," Journal of Scientific Computing 19(1-3), pp. 553-572, 2003. in press.
  16. J. Aujol, G. Aubert, L. Blanc-Feraud, and A. Chambolle, "Image decomposition: Application to textured images and sar images," Tech. Rep. ISRN I3S/RR-2003-01-FR, INRIA -Project ARIANA, Sophia Antipolis, 2003.
  17. L. Rudin, S. Osher, and E. Fatemi, "Nonlinear total variation noise removal algorithm," Physica D 60, pp. 259-268, 1992.
  18. J.-L. Starck, M. Elad, and D. Donoho, "Redundant multiscale transforms and their application for morpho- logical component analysis," Advances in Imaging and Electron Physics 132, 2004.
  19. J.-L. Starck, M. Elad, and D. Donoho, "Image decomposition via the combination of sparse representations and a variational approach," IEEE Transactions on Image Processing , 2004. in press.
  20. M. Elad, J.-L. Starck, D. Donoho, and P. Querre, "Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)," ACHA , 2005. to appear.
  21. C. Ballester, M. Bertalmio, V. Caselles, G. Sapiro, and J. Verdera, "Filling-in by joint interpolation of vector fields and grey levels," IEEE Trans. Image Processing 10, pp. 1200-1211, August 2001.
  22. M. Bertalmio, A. Bertozzi, and G. Sapiro, "Navier-stokes,fluid dynamics, and image and video inpainting," in in Proc.IEEE Computer Vision and Pattern Recognition (CVPR), 2001.
  23. M. Bertalmio, G. Sapiro, V. Caselles, and C. Ballester, "Image inpainting," Comput. Graph.(SIGGRAPH 2000) , p. 417424, July 2000.
  24. T. Chan and J. Shen, "Local inpainting models and tv inpainting," SIAM J. Appl. Math. 62, pp. 1019-1043, July 2001.
  25. J.-F. Cardoso, "The three easy routes to independent component analysis; contrasts and geometry," in Proc. ICA 2001, San Diego, 2001.
  26. J.-F. Cardoso, "High-order contrasts for independent component analysis," Neural Computation 11, pp. 157- 192, Jan. 1999.
  27. A. Hyvärinen, J. Karhunen, and E. Oja, Independent Component Analysis, John Wiley, New York, 2001. 481+xxii pages.
  28. J. Delabrouille, J.-F. Cardoso, and G. Patanchon, "Multi-detector multi-component spectral matching and applications for CMB data analysis," Monthly Notices of the Royal Astronomical Society 346, pp. 1089-1102, Dec. 2003. to appear, also available as http://arXiv.org/abs/astro-ph/0211504.
  29. M. Zibulevsky and B. Pearlmutter, "Blind source separation by sparse decomposition in a signal dictionary," Neural-Computation 13, pp. 863-882, April 2001.
  30. R. Gribonval and M. Nielsen, "Sparse representations in unions of bases," IEEE Transactions on Information Theory 49(12), pp. 3320-3325, 2003.

Related papers

Decomposition of Dynamic Textures Using Morphological Component Analysis: A New Adaptative Strategy
MICHEL MENARD

2010

The research context of this work is dynamic texture analysis and characterization. Many dynamic textures can be modeled as a large scale propagating wave and local oscillating phenomena. The Morphological Component Analysis algorithm (MCA) is used to retrieve these components using a well chosen dictionary. We define a new strategy for adaptive thresholding in the MCA framework, which greatly reduces the computation time when applied on videos. Tests on synthetic and real image sequences illustrate the efficiency of the proposed method and future prospects are finally exposed.

View PDFchevron_right
Application of Morphological Component Analysis to Optical Image Fusion
Georges Loum

American Journal of Applied Sciences, 2017

The image fusion technique is widely used in remote sensing. Its purpose is to provide comprehensive information without arte facts by combining the partial information from different source images. In this study, we propose a new model of images fusion with very high spatial resolution. We use the separation capacities of the Morphological Component Analysis (MCA) to extract the smooth and texture components of our images. These morphological components are then fused separately using the decomposition in the Laplacian pyramids for the smooth part and bivariate Hahn polynomials for texture part. Finally the image fusion is obtained through linear combination of merged smooth and texture components. The experiments carried out on IKONOS, LANDSAT and Quick Bird remote sensing images show the good performances of our method which has been compared to conventional methods. The performances obtained in our experiments are characterized by a small global metric such as ERGAS equals to 3.88 for IKONOS image and 3.65 for QuickBird image compared to 8.70 for IKONOS image and 6.97 for QuickBird for conventional HIS algorithms. We also have a mean loss of 15% for spectral information com pare to those of the conventional methods which revolve around 25%. The degradation of spatial information in order of 17% in contrast to conventional HIS algorithms which oscillate around 21%.

View PDFchevron_right
The Morphological Pyramid and Its Applications to Remote Sensing: Multiresolution Data Analysis and Features Extraction
Olivier Amram

Image Analysis & Stereology, 2011

In remote sensing, sensors are more and more numerous, and their spatial resolution is higher and higher. Thus, the availability of a quick and accurate characterisation of the increasing amount of data is now a quite important issue. This paper deals with an approach combining a pyramidal algorithm and mathematical morphology to study the physiographic characteristics of terrestrial ecosystems. Our pyramidal strategy involves first morphological filters, then extraction at each level of resolution of well-known landscapes features. The approach is applied to a digitised aerial photograph representing an heterogeneous landscape of orchards and forests along the Garonne river (France). This example, simulating very high spatial resolution imagery, highlights the influence of the parameters of the pyramid according to the spatial properties of the studied patterns. It is shown that, the morphological pyramid approach is a promising attempt for multi-level features extraction by modell...

View PDFchevron_right
Decomposition of Dynamic Textures Using Morphological Component Analysis
MICHEL MENARD

IEEE Transactions on Circuits and Systems for Video Technology, 2012

The research context of this work is dynamic texture analysis and characterization. Many dynamic textures can be modeled as large scale propagating wavefronts and local oscillating phenomena. After introducing a formal model for dynamic textures, the Morphological Component Analysis (MCA) approach with a well chosen dictionary is used to retrieve the components of dynamic textures. We define two new strategies for adaptive thresholding in the MCA framework, which greatly reduce the computation time when applied on videos. Tests on real image sequences illustrate the efficiency of the proposed method. An application to global motion estimation is proposed and future prospects are finally exposed.

View PDFchevron_right
Morphological diversity and source separation
M. Elad

IEEE Signal Processing Letters, 2000

This paper describes a new method for blind source separation, adapted to the case of sources having different morphologies. We show that such morphological diversity leads to a new and very efficient separation method, even in the presence of noise. The algorithm, coined MMCA (Multichannel Morphological Component Analysis), is an extension of the Morphological Component Analysis method (MCA). The latter takes advantage of the sparse representation of structured data in large overcomplete dictionaries to separate features in the data based on their morphology. MCA has been shown to be an efficient technique in such problems as separating an image into texture and piecewise smooth parts or for inpainting applications. The proposed extension, MMCA, extends the above for multichannel data, achieving a better source separation in those circumstances. Furthermore, the new algorithm can efficiently achieve good separation in a noisy context where standard ICA methods fail. The efficiency of the proposed scheme is confirmed in numerical experiments.

View PDFchevron_right

Related topics

  • Engineering
  • Computer Science
  • Artificial Intelligence
  • Computer Vision
  • Blind Source Separation
  • Sparse representation
  • Basis Pursuit
  • Multispectral image
  • Morphological Component Analysis

    • Cited by

    LSALSA: accelerated source separation via learned sparse coding
    Apoorva Nandini Saridena

    Machine Learning

    We propose an efficient algorithm for the generalized sparse coding (SC) inference problem. The proposed framework applies to both the single dictionary setting, where each data point is represented as a sparse combination of the columns of one dictionary matrix, as well as the multiple dictionary setting as given in morphological component analysis (MCA), where the goal is to separate a signal into additive parts such that each part has distinct sparse representation within an appropriately chosen corresponding dictionary. Both the SC task and its generalization via MCA have been cast as 1-regularized optimization problems of minimizing quadratic reconstruction error. In an effort to accelerate traditional acquisition of sparse codes, we propose a deep learning architecture that constitutes a trainable timeunfolded version of the split augmented lagrangian shrinkage algorithm (SALSA), a special case of the alternating direction method of multipliers (ADMM). We empirically validate both variants of the algorithm, that we refer to as learned-SALSA (LSALSA), on image vision tasks and demonstrate that at inference our networks achieve vast improvements in terms of the running time and the quality of estimated sparse codes on both classic SC and MCA problems over more common baselines. We also demonstrate the visual advantage of our technique on the task of source separation. Finally, we present a theoretical framework for analyzing LSALSA network: we show that the proposed approach exactly implements a truncated ADMM applied to a new, learned cost function with curvature modified by one of the learned parameterized matrices. We extend a very recent stochastic alternating optimization analysis framework to show that a gradient descent step along this learned loss landscape is equivalent to a modified gradient descent step along the original loss landscape. In this framework, the acceleration achieved by LSALSA could potentially be explained by the network's ability to learn a correction to the gradient direction of steeper descent.

    View PDFchevron_right
    Low and High Resonance Components Restoration in Multichannel Data
    Daniela De Canditiis

    2020

    A technique for the restoration of low resonance component and high resonance component of K independently measured signals is presented. The definition of low and high resonance component is given by the Rational Dilatation Wavelet Transform (RADWT), a particular kind of finite frame that provides sparse representation of functions with different oscillations persistence. It is assumed that the signals are measured simultaneously on several independent channels and in each channel the underlying signal is the sum of two components: the low resonance component and the high resonance component, both sharing some common characteristic between the channels. Components restoration is performed by means of the lasso-type penalty and back-fitting algorithm. Numerical experiments show the performance of the proposed method in different synthetic scenarios highlighting the advantage of estimating the two components separately rather than together.

    View PDFchevron_right
    A Lightweight Network for Real-Time Rain Streaks and Rain Accumulation Removal from Single Images Captured by AVs
    Esraa Khatab

    Applied Sciences

    In autonomous driving, object detection is considered a base step to many subsequent processes. However, object detection is challenged by loss in visibility caused by rain. Rainfall occurs in two main forms, which are streaks and streaks accumulations. Each degradation type imposes different effect on the captured videos; therefore, they cannot be mitigated in the same way. We propose a lightweight network which mitigates both types of rain degradation in real-time, without negatively affecting the object-detection task. The proposed network consists of two different modules which are used progressively. The first one is a progressive ResNet for rain streaks removal, while the second one is a transmission-guided lightweight network for rain streak accumulation removal. The network has been tested on synthetic and real rainy datasets and has been compared with state-of-the-art (SOTA) networks. Additionally, time performance evaluation has been performed to ensure real-time performan...

    View PDFchevron_right
    580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved