Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

K-means iterative Fisher (KIF) unsupervised clustering algorithm applied to image texture segmentation

From MaRDI portal
Publication:1860144
Jump to:navigation, search

DOI10.1016/S0031-3203(01)00138-8zbMath1006.68867MaRDI QIDQ1860144

David A. Clausi

Publication date: 20 February 2003

Published in: Pattern Recognition (Search for Journal in Brave)


zbMATH Keywords

computer visionimage segmentationGabor filterstexture segmentationK-meansFisher linear discriminantbinary hierarchical clusteringco-occurrence probabilities


Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99) Machine vision and scene understanding (68T45)


Related Items (3)

Texture classification based on EMD and FFT ⋮ Potential functions-based wavelet transforms in pattern recognition problems ⋮ Simultaneous model-based clustering and visualization in the Fisher discriminative subspace



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: K-means iterative Fisher (KIF) unsupervised clustering algorithm applied to image texture segmentation

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1860144&oldid=14246349"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 11:23.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki