Slide
Centre Interdisciplinaire
de Recherche et d’Innovation
en Cybersécurité et Société
de Recherche et d’Innovation
en Cybersécurité et Société
1.
Nouboukpo, A.; Allili, M. S.
Semi-supervised flow-augmented Gaussian mixture VAEs with weighted contrastive learning for out-of-distribution detection Journal Article
In: Knowledge-Based Systems, vol. 347, 2026, ISSN: 09507051 (ISSN).
Abstract | Links | BibTeX | Tags: Auto encoders, Benchmarking, Classification (of information), Clusterings, Contrastive Learning, Flow based, Flow-based GMM clustering, Gaussian distribution, Gaussian-mixtures, Learning algorithms, Learning systems, Out-of-distribution detection, Semantics, Semi-supervised, Semi-supervised learning, uncertainty, Variational autoencoder, Variational autoencoders (VAEs)
@article{nouboukpoSemisupervisedFlowaugmentedGaussian2026,
title = {Semi-supervised flow-augmented Gaussian mixture VAEs with weighted contrastive learning for out-of-distribution detection},
author = {A. Nouboukpo and M. S. Allili},
url = {https://www.scopus.com/pages/publications/105040505017?origin=resultslist},
doi = {10.1016/j.knosys.2026.116312},
issn = {09507051 (ISSN)},
year = {2026},
date = {2026-01-01},
journal = {Knowledge-Based Systems},
volume = {347},
publisher = {Elsevier B.V.},
abstract = {Out-of-distribution (OOD) detection is essential for the safe deployment of machine learning systems, particularly in high-stakes domains where identifying inputs that deviate from the in-distribution (ID) is critical. However, in real-world scenarios, true OOD data are typically unavailable at training time, and only auxiliary datasets acting as imperfect proxies can be used. This makes fully supervised approaches impractical and potentially biased toward specific anomaly types. To address this limitation, we propose FLoW-ssGMVAE, a semi-supervised generative–discriminative framework that leverages limited proxy anomaly supervision together with abundant unlabeled data for robust OOD detection. Our model integrates a flow-augmented Gaussian Mixture VAE, enabling flexible latent modeling that captures nonlinear and multimodal intra-class distributions. Unlike standard VAEs with unimodal Gaussian priors, it uses class-conditional normalizing flows to better represent complex ID and OOD variability. To further refine the latent space and strengthen ID/OOD separation, our model integrates a weighted contrastive learning objective guided by sample-wise attention scores derived from likelihood uncertainty. This mechanism emphasizes ambiguous or hard-to-classify instances, reinforcing semantic boundaries and reducing false detections. By combining expressive generative modeling with uncertainty-aware discriminative training, our method constructs a structured and interpretable latent space that reliably identifies OOD samples under limited supervision. Experiments on standard benchmarks validate the effectiveness and scalability of our approach, demonstrating state-of-the-art performance with reasonable computational cost. Our implementation will be available at: FLoW-ssGMVAE. © 2026},
keywords = {Auto encoders, Benchmarking, Classification (of information), Clusterings, Contrastive Learning, Flow based, Flow-based GMM clustering, Gaussian distribution, Gaussian-mixtures, Learning algorithms, Learning systems, Out-of-distribution detection, Semantics, Semi-supervised, Semi-supervised learning, uncertainty, Variational autoencoder, Variational autoencoders (VAEs)},
pubstate = {published},
tppubtype = {article}
}
Out-of-distribution (OOD) detection is essential for the safe deployment of machine learning systems, particularly in high-stakes domains where identifying inputs that deviate from the in-distribution (ID) is critical. However, in real-world scenarios, true OOD data are typically unavailable at training time, and only auxiliary datasets acting as imperfect proxies can be used. This makes fully supervised approaches impractical and potentially biased toward specific anomaly types. To address this limitation, we propose FLoW-ssGMVAE, a semi-supervised generative–discriminative framework that leverages limited proxy anomaly supervision together with abundant unlabeled data for robust OOD detection. Our model integrates a flow-augmented Gaussian Mixture VAE, enabling flexible latent modeling that captures nonlinear and multimodal intra-class distributions. Unlike standard VAEs with unimodal Gaussian priors, it uses class-conditional normalizing flows to better represent complex ID and OOD variability. To further refine the latent space and strengthen ID/OOD separation, our model integrates a weighted contrastive learning objective guided by sample-wise attention scores derived from likelihood uncertainty. This mechanism emphasizes ambiguous or hard-to-classify instances, reinforcing semantic boundaries and reducing false detections. By combining expressive generative modeling with uncertainty-aware discriminative training, our method constructs a structured and interpretable latent space that reliably identifies OOD samples under limited supervision. Experiments on standard benchmarks validate the effectiveness and scalability of our approach, demonstrating state-of-the-art performance with reasonable computational cost. Our implementation will be available at: FLoW-ssGMVAE. © 2026
2.
Yapi, D.; Allili, M. S.
Multi-Band Texture Modeling Using Finite Mixtures of Multivariate Generalized Gaussian Distributions Proceedings Article
In: Proceedings - International Conference on Pattern Recognition, pp. 464–469, Institute of Electrical and Electronics Engineers Inc., 2022, ISSN: 10514651, (ISSN: 10514651).
Abstract | Links | BibTeX | Tags: Color texture retrieval, Finite mixtures, Gaussian distribution, Gaussians, Image retrieval, Image texture, Mixture of multivariate generalized gaussians, Multi band, Multi-scale Decomposition, Multivariate generalized gaussian distributions, Statistic modeling, Subbands, Texture models, Textures
@inproceedings{yapi_multi-band_2022,
title = {Multi-Band Texture Modeling Using Finite Mixtures of Multivariate Generalized Gaussian Distributions},
author = {D. Yapi and M. S. Allili},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85143638804&doi=10.1109%2fICPR56361.2022.9956448&partnerID=40&md5=3fe34da98f314b85014059630e4c8c6c},
doi = {10.1109/ICPR56361.2022.9956448},
issn = {10514651},
year = {2022},
date = {2022-01-01},
booktitle = {Proceedings - International Conference on Pattern Recognition},
volume = {2022-August},
pages = {464–469},
publisher = {Institute of Electrical and Electronics Engineers Inc.},
abstract = {We present a unified statistical model for multivariate and multi-modal texture representation. This model is based on the formalism of finite mixtures of multivariate generalized Gaussians (MoMGG) which enables a compact and accurate representation of joint statistics of different sub-bands of multireslotion texture transform. This representation expresses correlation between sub-bands at different scales and orientations, and also between adjacent locations within the same subbands, providing a precise description of the texture layout. It enables also to combine different multi-scale transforms to build a richer and more representative texture signature. We successfully tested the model on traditional texture transforms such as wavelets and contourlets. Experiments on color-texture image retrieval have demonstrated the performance of our approach comparatively to state-of-art methods. © 2022 IEEE.},
note = {ISSN: 10514651},
keywords = {Color texture retrieval, Finite mixtures, Gaussian distribution, Gaussians, Image retrieval, Image texture, Mixture of multivariate generalized gaussians, Multi band, Multi-scale Decomposition, Multivariate generalized gaussian distributions, Statistic modeling, Subbands, Texture models, Textures},
pubstate = {published},
tppubtype = {inproceedings}
}
We present a unified statistical model for multivariate and multi-modal texture representation. This model is based on the formalism of finite mixtures of multivariate generalized Gaussians (MoMGG) which enables a compact and accurate representation of joint statistics of different sub-bands of multireslotion texture transform. This representation expresses correlation between sub-bands at different scales and orientations, and also between adjacent locations within the same subbands, providing a precise description of the texture layout. It enables also to combine different multi-scale transforms to build a richer and more representative texture signature. We successfully tested the model on traditional texture transforms such as wavelets and contourlets. Experiments on color-texture image retrieval have demonstrated the performance of our approach comparatively to state-of-art methods. © 2022 IEEE.
3.
Nouboukpo, A.; Allili, M. S.
Spatially-coherent segmentation using hierarchical gaussian mixture reduction based on cauchy-schwarz divergence Journal Article
In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11662 LNCS, pp. 388–396, 2019, ISSN: 03029743, (ISBN: 9783030272012).
Abstract | Links | BibTeX | Tags: Cauchy-Schwarz divergence, Foreground segmentation, Gaussian distribution, Gaussian Mixture Model, Gaussian mixture reduction, Image analysis, Image segmentation, Mixture reductions, Reduction algorithms, Reduction techniques, State-of-art methods
@article{nouboukpo_spatially-coherent_2019,
title = {Spatially-coherent segmentation using hierarchical gaussian mixture reduction based on cauchy-schwarz divergence},
author = {A. Nouboukpo and M. S. Allili},
editor = {Campilho A. Yu A. Karray F.},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85071452890&doi=10.1007%2f978-3-030-27202-9_35&partnerID=40&md5=2689080f7b2410040a038f080ef93bfa},
doi = {10.1007/978-3-030-27202-9_35},
issn = {03029743},
year = {2019},
date = {2019-01-01},
journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
volume = {11662 LNCS},
pages = {388–396},
publisher = {Springer Verlag},
abstract = {Gaussian mixture models (GMM) are widely used for image segmentation. The bigger the number in the mixture, the higher will be the data likelihood. Unfortunately, too many GMM components leads to model overfitting and poor segmentation. Thus, there has been a growing interest in GMM reduction algorithms that rely on component fusion while preserving the structure of data. In this work, we present an algorithm based on a closed-form Cauchy-Schwarz divergence for GMM reduction. Contrarily to previous GMM reduction techniques which a single GMM, our approach can lead to multiple small GMMs describing more accurately the structure of the data. Experiments on image foreground segmentation demonstrate the effectiveness of our proposed model compared to state-of-art methods. © Springer Nature Switzerland AG 2019.},
note = {ISBN: 9783030272012},
keywords = {Cauchy-Schwarz divergence, Foreground segmentation, Gaussian distribution, Gaussian Mixture Model, Gaussian mixture reduction, Image analysis, Image segmentation, Mixture reductions, Reduction algorithms, Reduction techniques, State-of-art methods},
pubstate = {published},
tppubtype = {article}
}
Gaussian mixture models (GMM) are widely used for image segmentation. The bigger the number in the mixture, the higher will be the data likelihood. Unfortunately, too many GMM components leads to model overfitting and poor segmentation. Thus, there has been a growing interest in GMM reduction algorithms that rely on component fusion while preserving the structure of data. In this work, we present an algorithm based on a closed-form Cauchy-Schwarz divergence for GMM reduction. Contrarily to previous GMM reduction techniques which a single GMM, our approach can lead to multiple small GMMs describing more accurately the structure of the data. Experiments on image foreground segmentation demonstrate the effectiveness of our proposed model compared to state-of-art methods. © Springer Nature Switzerland AG 2019.
4.
Nouboukpo, A.; Allili, M. S.
Spatially-coherent segmentation using hierarchical gaussian mixture reduction based on cauchy-schwarz divergence Journal Article
In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11662 LNCS, pp. 388–396, 2019, ISSN: 03029743, (ISBN: 9783030272012).
Abstract | Links | BibTeX | Tags: Cauchy-Schwarz divergence, Foreground segmentation, Gaussian distribution, Gaussian Mixture Model, Gaussian mixture reduction, Image analysis, Image segmentation, Mixture reductions, Reduction algorithms, Reduction techniques, State-of-art methods
@article{nouboukpoSpatiallycoherentSegmentationUsing2019,
title = {Spatially-coherent segmentation using hierarchical gaussian mixture reduction based on cauchy-schwarz divergence},
author = {A. Nouboukpo and M. S. Allili},
editor = {Campilho A. Yu A. Karray F.},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85071452890&doi=10.1007%2f978-3-030-27202-9_35&partnerID=40&md5=2689080f7b2410040a038f080ef93bfa},
doi = {10.1007/978-3-030-27202-9_35},
issn = {03029743},
year = {2019},
date = {2019-01-01},
journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
volume = {11662 LNCS},
pages = {388–396},
publisher = {Springer Verlag},
abstract = {Gaussian mixture models (GMM) are widely used for image segmentation. The bigger the number in the mixture, the higher will be the data likelihood. Unfortunately, too many GMM components leads to model overfitting and poor segmentation. Thus, there has been a growing interest in GMM reduction algorithms that rely on component fusion while preserving the structure of data. In this work, we present an algorithm based on a closed-form Cauchy-Schwarz divergence for GMM reduction. Contrarily to previous GMM reduction techniques which a single GMM, our approach can lead to multiple small GMMs describing more accurately the structure of the data. Experiments on image foreground segmentation demonstrate the effectiveness of our proposed model compared to state-of-art methods. © Springer Nature Switzerland AG 2019.},
note = {ISBN: 9783030272012},
keywords = {Cauchy-Schwarz divergence, Foreground segmentation, Gaussian distribution, Gaussian Mixture Model, Gaussian mixture reduction, Image analysis, Image segmentation, Mixture reductions, Reduction algorithms, Reduction techniques, State-of-art methods},
pubstate = {published},
tppubtype = {article}
}
Gaussian mixture models (GMM) are widely used for image segmentation. The bigger the number in the mixture, the higher will be the data likelihood. Unfortunately, too many GMM components leads to model overfitting and poor segmentation. Thus, there has been a growing interest in GMM reduction algorithms that rely on component fusion while preserving the structure of data. In this work, we present an algorithm based on a closed-form Cauchy-Schwarz divergence for GMM reduction. Contrarily to previous GMM reduction techniques which a single GMM, our approach can lead to multiple small GMMs describing more accurately the structure of the data. Experiments on image foreground segmentation demonstrate the effectiveness of our proposed model compared to state-of-art methods. © Springer Nature Switzerland AG 2019.
5.
Boulmerka, A.; Allili, M. Saïd; Ait-Aoudia, S.
A generalized multiclass histogram thresholding approach based on mixture modelling Journal Article
In: Pattern Recognition, vol. 47, no. 3, pp. 1330–1348, 2014, ISSN: 00313203.
Abstract | Links | BibTeX | Tags: Arbitrary number, Conditional distribution, Gaussian distribution, Gaussian noise (electronic), Generalized Gaussian Distributions, Graphic methods, Histogram thresholding, Image segmentation, Minimum error thresholding, Mixture-modelling, Mixtures, State-of-the-art techniques, Statistical methods, Thresholding, Thresholding methods
@article{boulmerka_generalized_2014,
title = {A generalized multiclass histogram thresholding approach based on mixture modelling},
author = {A. Boulmerka and M. Saïd Allili and S. Ait-Aoudia},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84888328869&doi=10.1016%2fj.patcog.2013.09.004&partnerID=40&md5=d8b872bd0abe9e6c4d52439f8ec360bc},
doi = {10.1016/j.patcog.2013.09.004},
issn = {00313203},
year = {2014},
date = {2014-01-01},
journal = {Pattern Recognition},
volume = {47},
number = {3},
pages = {1330–1348},
abstract = {This paper presents a new approach to multi-class thresholding-based segmentation. It considerably improves existing thresholding methods by efficiently modeling non-Gaussian and multi-modal class-conditional distributions using mixtures of generalized Gaussian distributions (MoGG). The proposed approach seamlessly: (1) extends the standard Otsu's method to arbitrary numbers of thresholds and (2) extends the Kittler and Illingworth minimum error thresholding to non-Gaussian and multi-modal class-conditional data. MoGGs enable efficient representation of heavy-tailed data and multi-modal histograms with flat or sharply shaped peaks. Experiments on synthetic data and real-world image segmentation show the performance of the proposed approach with comparison to recent state-of-the-art techniques. © 2013 Elsevier Ltd. All rights reserved.},
keywords = {Arbitrary number, Conditional distribution, Gaussian distribution, Gaussian noise (electronic), Generalized Gaussian Distributions, Graphic methods, Histogram thresholding, Image segmentation, Minimum error thresholding, Mixture-modelling, Mixtures, State-of-the-art techniques, Statistical methods, Thresholding, Thresholding methods},
pubstate = {published},
tppubtype = {article}
}
This paper presents a new approach to multi-class thresholding-based segmentation. It considerably improves existing thresholding methods by efficiently modeling non-Gaussian and multi-modal class-conditional distributions using mixtures of generalized Gaussian distributions (MoGG). The proposed approach seamlessly: (1) extends the standard Otsu's method to arbitrary numbers of thresholds and (2) extends the Kittler and Illingworth minimum error thresholding to non-Gaussian and multi-modal class-conditional data. MoGGs enable efficient representation of heavy-tailed data and multi-modal histograms with flat or sharply shaped peaks. Experiments on synthetic data and real-world image segmentation show the performance of the proposed approach with comparison to recent state-of-the-art techniques. © 2013 Elsevier Ltd. All rights reserved.
6.
Boulmerka, A.; Allili, M. Saïd; Ait-Aoudia, S.
A generalized multiclass histogram thresholding approach based on mixture modelling Journal Article
In: Pattern Recognition, vol. 47, no. 3, pp. 1330–1348, 2014, ISSN: 00313203.
Abstract | Links | BibTeX | Tags: Arbitrary number, Conditional distribution, Gaussian distribution, Gaussian noise (electronic), Generalized Gaussian Distributions, Graphic methods, Histogram thresholding, Image segmentation, Minimum error thresholding, Mixture-modelling, Mixtures, State-of-the-art techniques, Statistical methods, Thresholding, Thresholding methods
@article{boulmerkaGeneralizedMulticlassHistogram2014,
title = {A generalized multiclass histogram thresholding approach based on mixture modelling},
author = {A. Boulmerka and M. Saïd Allili and S. Ait-Aoudia},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84888328869&doi=10.1016%2fj.patcog.2013.09.004&partnerID=40&md5=d8b872bd0abe9e6c4d52439f8ec360bc},
doi = {10.1016/j.patcog.2013.09.004},
issn = {00313203},
year = {2014},
date = {2014-01-01},
journal = {Pattern Recognition},
volume = {47},
number = {3},
pages = {1330–1348},
abstract = {This paper presents a new approach to multi-class thresholding-based segmentation. It considerably improves existing thresholding methods by efficiently modeling non-Gaussian and multi-modal class-conditional distributions using mixtures of generalized Gaussian distributions (MoGG). The proposed approach seamlessly: (1) extends the standard Otsu's method to arbitrary numbers of thresholds and (2) extends the Kittler and Illingworth minimum error thresholding to non-Gaussian and multi-modal class-conditional data. MoGGs enable efficient representation of heavy-tailed data and multi-modal histograms with flat or sharply shaped peaks. Experiments on synthetic data and real-world image segmentation show the performance of the proposed approach with comparison to recent state-of-the-art techniques. © 2013 Elsevier Ltd. All rights reserved.},
keywords = {Arbitrary number, Conditional distribution, Gaussian distribution, Gaussian noise (electronic), Generalized Gaussian Distributions, Graphic methods, Histogram thresholding, Image segmentation, Minimum error thresholding, Mixture-modelling, Mixtures, State-of-the-art techniques, Statistical methods, Thresholding, Thresholding methods},
pubstate = {published},
tppubtype = {article}
}
This paper presents a new approach to multi-class thresholding-based segmentation. It considerably improves existing thresholding methods by efficiently modeling non-Gaussian and multi-modal class-conditional distributions using mixtures of generalized Gaussian distributions (MoGG). The proposed approach seamlessly: (1) extends the standard Otsu's method to arbitrary numbers of thresholds and (2) extends the Kittler and Illingworth minimum error thresholding to non-Gaussian and multi-modal class-conditional data. MoGGs enable efficient representation of heavy-tailed data and multi-modal histograms with flat or sharply shaped peaks. Experiments on synthetic data and real-world image segmentation show the performance of the proposed approach with comparison to recent state-of-the-art techniques. © 2013 Elsevier Ltd. All rights reserved.
7.
Allili, M. S.; Baaziz, N.
Contourlet-based texture retrieval using a mixture of generalized Gaussian distributions Journal Article
In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6855 LNCS, no. PART 2, pp. 446–454, 2011, ISSN: 03029743, (ISBN: 9783642236778 Place: Seville).
Abstract | Links | BibTeX | Tags: Contourlet transform, Contourlets, Distribution modelling, Finite mixtures, Gaussian distribution, Generalized Gaussian Distributions, Image analysis, Kullback-Leibler divergence, Mixtures, Monte-Carlo sampling, Probability density function, Similarity measure, Statistical representations, Texture discrimination, Texture retrieval, Textures
@article{allili_contourlet-based_2011,
title = {Contourlet-based texture retrieval using a mixture of generalized Gaussian distributions},
author = {M. S. Allili and N. Baaziz},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-80052796353&doi=10.1007%2f978-3-642-23678-5_53&partnerID=40&md5=fde8aaeea1609c81747b0ab27a8c78ce},
doi = {10.1007/978-3-642-23678-5_53},
issn = {03029743},
year = {2011},
date = {2011-01-01},
journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
volume = {6855 LNCS},
number = {PART 2},
pages = {446–454},
abstract = {We address the texture retrieval problem using contourlet-based statistical representation. We propose a new contourlet distribution modelling using finite mixtures of generalized Gaussian distributions (MoGG). The MoGG allows to capture a wide range of contourlet histogram shapes, which provides better description and discrimination of texture than using single probability density functions (pdfs). We propose a model similarity measure based on Kullback-Leibler divergence (KLD) approximation using Monte-Carlo sampling methods. We show that our approach using a redundant contourlet transform yields better texture discrimination and retrieval results than using other methods of statistical-based wavelet/contourlet modelling. © 2011 Springer-Verlag.},
note = {ISBN: 9783642236778
Place: Seville},
keywords = {Contourlet transform, Contourlets, Distribution modelling, Finite mixtures, Gaussian distribution, Generalized Gaussian Distributions, Image analysis, Kullback-Leibler divergence, Mixtures, Monte-Carlo sampling, Probability density function, Similarity measure, Statistical representations, Texture discrimination, Texture retrieval, Textures},
pubstate = {published},
tppubtype = {article}
}
We address the texture retrieval problem using contourlet-based statistical representation. We propose a new contourlet distribution modelling using finite mixtures of generalized Gaussian distributions (MoGG). The MoGG allows to capture a wide range of contourlet histogram shapes, which provides better description and discrimination of texture than using single probability density functions (pdfs). We propose a model similarity measure based on Kullback-Leibler divergence (KLD) approximation using Monte-Carlo sampling methods. We show that our approach using a redundant contourlet transform yields better texture discrimination and retrieval results than using other methods of statistical-based wavelet/contourlet modelling. © 2011 Springer-Verlag.
8.
Allili, M. S.; Baaziz, N.
Contourlet-based texture retrieval using a mixture of generalized Gaussian distributions Journal Article
In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6855 LNCS, no. PART 2, pp. 446–454, 2011, ISSN: 03029743, (ISBN: 9783642236778 Place: Seville).
Abstract | Links | BibTeX | Tags: Contourlet transform, Contourlets, Distribution modelling, Finite mixtures, Gaussian distribution, Generalized Gaussian Distributions, Image analysis, Kullback-Leibler divergence, Mixtures, Monte-Carlo sampling, Probability density function, Similarity measure, Statistical representations, Texture discrimination, Texture retrieval, Textures
@article{alliliContourletbasedTextureRetrieval2011,
title = {Contourlet-based texture retrieval using a mixture of generalized Gaussian distributions},
author = {M. S. Allili and N. Baaziz},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-80052796353&doi=10.1007%2f978-3-642-23678-5_53&partnerID=40&md5=fde8aaeea1609c81747b0ab27a8c78ce},
doi = {10.1007/978-3-642-23678-5_53},
issn = {03029743},
year = {2011},
date = {2011-01-01},
journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
volume = {6855 LNCS},
number = {PART 2},
pages = {446–454},
abstract = {We address the texture retrieval problem using contourlet-based statistical representation. We propose a new contourlet distribution modelling using finite mixtures of generalized Gaussian distributions (MoGG). The MoGG allows to capture a wide range of contourlet histogram shapes, which provides better description and discrimination of texture than using single probability density functions (pdfs). We propose a model similarity measure based on Kullback-Leibler divergence (KLD) approximation using Monte-Carlo sampling methods. We show that our approach using a redundant contourlet transform yields better texture discrimination and retrieval results than using other methods of statistical-based wavelet/contourlet modelling. © 2011 Springer-Verlag.},
note = {ISBN: 9783642236778
Place: Seville},
keywords = {Contourlet transform, Contourlets, Distribution modelling, Finite mixtures, Gaussian distribution, Generalized Gaussian Distributions, Image analysis, Kullback-Leibler divergence, Mixtures, Monte-Carlo sampling, Probability density function, Similarity measure, Statistical representations, Texture discrimination, Texture retrieval, Textures},
pubstate = {published},
tppubtype = {article}
}
We address the texture retrieval problem using contourlet-based statistical representation. We propose a new contourlet distribution modelling using finite mixtures of generalized Gaussian distributions (MoGG). The MoGG allows to capture a wide range of contourlet histogram shapes, which provides better description and discrimination of texture than using single probability density functions (pdfs). We propose a model similarity measure based on Kullback-Leibler divergence (KLD) approximation using Monte-Carlo sampling methods. We show that our approach using a redundant contourlet transform yields better texture discrimination and retrieval results than using other methods of statistical-based wavelet/contourlet modelling. © 2011 Springer-Verlag.
9.
Allili, M. S.; Ziou, D.; Bouguila, N.; Boutemedjet, S.
Image and video segmentation by combining unsupervised generalized Gaussian mixture modeling and feature selection Journal Article
In: IEEE Transactions on Circuits and Systems for Video Technology, vol. 20, no. 10, pp. 1373–1377, 2010, ISSN: 10518215.
Abstract | Links | BibTeX | Tags: Clustering model, Feature extraction, Feature selection, Gaussian distribution, Generalized Gaussian, Heavy-tailed, High dimensional spaces, Image and video segmentation, Image segmentation, image/video segmentation, Minimum message lengths, Real-world image, Video cameras
@article{allili_image_2010,
title = {Image and video segmentation by combining unsupervised generalized Gaussian mixture modeling and feature selection},
author = {M. S. Allili and D. Ziou and N. Bouguila and S. Boutemedjet},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-77957964550&doi=10.1109%2fTCSVT.2010.2077483&partnerID=40&md5=d888c7fe52eff37a5744bccd6a4d3d9e},
doi = {10.1109/TCSVT.2010.2077483},
issn = {10518215},
year = {2010},
date = {2010-01-01},
journal = {IEEE Transactions on Circuits and Systems for Video Technology},
volume = {20},
number = {10},
pages = {1373–1377},
abstract = {In this letter, we propose a clustering model that efficiently mitigates image and video under/over-segmentation by combining generalized Gaussian mixture modeling and feature selection. The model has flexibility to accurately represent heavy-tailed image/video histograms, while automatically discarding uninformative features, leading to better discrimination and localization of regions in high-dimensional spaces. Experimental results on a database of real-world images and videos showed us the effectiveness of the proposed approach. © 2010 IEEE.},
keywords = {Clustering model, Feature extraction, Feature selection, Gaussian distribution, Generalized Gaussian, Heavy-tailed, High dimensional spaces, Image and video segmentation, Image segmentation, image/video segmentation, Minimum message lengths, Real-world image, Video cameras},
pubstate = {published},
tppubtype = {article}
}
In this letter, we propose a clustering model that efficiently mitigates image and video under/over-segmentation by combining generalized Gaussian mixture modeling and feature selection. The model has flexibility to accurately represent heavy-tailed image/video histograms, while automatically discarding uninformative features, leading to better discrimination and localization of regions in high-dimensional spaces. Experimental results on a database of real-world images and videos showed us the effectiveness of the proposed approach. © 2010 IEEE.
10.
Allili, M. S.; Ziou, D.; Bouguila, N.; Boutemedjet, S.
Unsupervised feature selection and learning for image segmentation Proceedings Article
In: CRV 2010 - 7th Canadian Conference on Computer and Robot Vision, pp. 285–292, Ottawa, ON, 2010, ISBN: 978-0-7695-4040-5.
Abstract | Links | BibTeX | Tags: Clustering algorithms, Computer vision, Evolutionary algorithms, Feature extraction, Feature selection, Gaussian distribution, Generalized Gaussian, Generalized Gaussian Distributions, Heavy-tailed, High dimensional spaces, Image distributions, Image segmentation, Large database, Over-estimation, Real-world image, Unsupervised feature selection
@inproceedings{allili_unsupervised_2010,
title = {Unsupervised feature selection and learning for image segmentation},
author = {M. S. Allili and D. Ziou and N. Bouguila and S. Boutemedjet},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-77954407977&doi=10.1109%2fCRV.2010.44&partnerID=40&md5=a7d8e3147216429f18ef7af3167acb42},
doi = {10.1109/CRV.2010.44},
isbn = {978-0-7695-4040-5},
year = {2010},
date = {2010-01-01},
booktitle = {CRV 2010 - 7th Canadian Conference on Computer and Robot Vision},
pages = {285–292},
address = {Ottawa, ON},
abstract = {In this paper we investigate the integration of feature selection in segmentation through an unsupervised learning approach. We propose a clustering algorithm that efficiently mitigates image under/over-segmentation, by combining generalized Gaussian mixture modeling and feature selection. The algorithm is based on generalized Gaussian mixture modeling which is less prone to region number over-estimation in case of noisy and heavy-tailed image distributions. On the other hand, our feature selection mechanism allows to automatically discard uninformative features, which leads to better discrimination and localization of regions in high-dimensional spaces. Experimental results on a large database of real-world images showed us the effectiveness of the proposed approach. © 2010 IEEE.},
keywords = {Clustering algorithms, Computer vision, Evolutionary algorithms, Feature extraction, Feature selection, Gaussian distribution, Generalized Gaussian, Generalized Gaussian Distributions, Heavy-tailed, High dimensional spaces, Image distributions, Image segmentation, Large database, Over-estimation, Real-world image, Unsupervised feature selection},
pubstate = {published},
tppubtype = {inproceedings}
}
In this paper we investigate the integration of feature selection in segmentation through an unsupervised learning approach. We propose a clustering algorithm that efficiently mitigates image under/over-segmentation, by combining generalized Gaussian mixture modeling and feature selection. The algorithm is based on generalized Gaussian mixture modeling which is less prone to region number over-estimation in case of noisy and heavy-tailed image distributions. On the other hand, our feature selection mechanism allows to automatically discard uninformative features, which leads to better discrimination and localization of regions in high-dimensional spaces. Experimental results on a large database of real-world images showed us the effectiveness of the proposed approach. © 2010 IEEE.