A multi-level thresholding approach using a hybrid optimal estimation algorithm
- Author
- FAN, Shu-Kai S1 ; LIN, Yen1
[1] Department of Industrial Engineering and Management, Yuan Ze University, No. 135. Yuandong Road, Jhongli City, Taoyuan County 320, Taiwan, Province of China - Source
Pattern recognition letters. 2007, Vol 28, Num 5, pp 662-669, 8 p ; ref : 1/4 p
- CODEN
- PRLEDG
- ISSN
- 0167-8655
- Scientific domain
- Computer science; Telecommunications
- Publisher
- Elsevier, Amsterdam
- Publication country
- Netherlands
- Document type
- Article
- Language
- English
- Author keyword
- Expectation maximization (EM) Mixture Gaussian curve fitting Multi-level thresholding Particle swarm optimization (PSO)
- Keyword (fr)
- Ajustement courbe Algorithme EM Algorithme optimal Biomimétique Calcul évolutionniste Détection seuil Estimation optimale Estimation paramètre Mise à jour Modèle hybride Méthode itérative Optimisation essaim particule Paramètre s Processus Gauss Solution optimale Système n niveaux Théorie mélange Traitement image Variable aléatoire
- Keyword (en)
- Curve fitting EM algorithm Optimal algorithm Biomimetics Evolutionary computation Threshold detection Optimal estimation Parameter estimation Updating Hybrid model Iterative method Swarm intelligence s parameter Gaussian process Optimal solution Multilevel system Mixture theory Image processing Random variable
- Keyword (es)
- Ajustamiento curva Algoritmo EM Algoritmo óptimo Detección umbral Estimación óptima Estimación parámetro Actualización Modelo híbrido Método iterativo Optimización enjambre partícula Parámetro s Proceso Gauss Solución óptima Sistema n niveles Teoría mezcla Procesamiento imagen Variable aléatoria
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D04 Telecommunications and information theory / 001D04A Information, signal and communications theory / 001D04A04 Signal and communications theory / 001D04A04A Signal, noise / 001D04A04A2 Detection, estimation, filtering, equalization, prediction
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D04 Telecommunications and information theory / 001D04A Information, signal and communications theory / 001D04A05 Signal processing / 001D04A05C Image processing
- Discipline
- Telecommunications and information theory
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 18441661
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1016/j.patrec.2006.11.005 
https://dx.doi.org/10.1016/j.patrec.2006.11.005
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/j.patrec.2006.11.005\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:79:\"A multi-level thresholding approach using a hybrid optimal estimation algorithm\";s:9:\"\u0000*\u0000jtitle\";s:27:\"Pattern recognition letters\";s:9:\"\u0000*\u0000stitle\";s:20:\"Pattern recogn. lett\";s:7:\"\u0000*\u0000date\";s:4:\"2007\";s:9:\"\u0000*\u0000volume\";s:2:\"28\";s:8:\"\u0000*\u0000issue\";s:1:\"5\";s:8:\"\u0000*\u0000spage\";s:3:\"662\";s:8:\"\u0000*\u0000epage\";s:3:\"669\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0167-8655\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"FAN\";s:10:\"\u0000*\u0000aufirst\";s:9:\"Shu-Kai S\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:8:\"LIN, Yen\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"PRLEDG\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:79:\"A multi-level thresholding approach using a hybrid optimal estimation algorithm\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:1:\"8\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/j.patrec.2006.11.005\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:79:\"A multi-level thresholding approach using a hybrid optimal estimation algorithm\";s:9:\"\u0000*\u0000jtitle\";s:27:\"Pattern recognition letters\";s:9:\"\u0000*\u0000stitle\";s:20:\"Pattern recogn. lett\";s:7:\"\u0000*\u0000date\";s:4:\"2007\";s:9:\"\u0000*\u0000volume\";s:2:\"28\";s:8:\"\u0000*\u0000issue\";s:1:\"5\";s:8:\"\u0000*\u0000spage\";s:3:\"662\";s:8:\"\u0000*\u0000epage\";s:3:\"669\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0167-8655\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"FAN\";s:10:\"\u0000*\u0000aufirst\";s:9:\"Shu-Kai S\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:8:\"LIN, Yen\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"PRLEDG\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:79:\"A multi-level thresholding approach using a hybrid optimal estimation algorithm\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:1:\"8\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/j.patrec.2006.11.005\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/j.patrec.2006.11.005\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:79:\"A multi-level thresholding approach using a hybrid optimal estimation algorithm\";s:9:\"\u0000*\u0000jtitle\";s:27:\"Pattern recognition letters\";s:9:\"\u0000*\u0000stitle\";s:20:\"Pattern recogn. lett\";s:7:\"\u0000*\u0000date\";s:4:\"2007\";s:9:\"\u0000*\u0000volume\";s:2:\"28\";s:8:\"\u0000*\u0000issue\";s:1:\"5\";s:8:\"\u0000*\u0000spage\";s:3:\"662\";s:8:\"\u0000*\u0000epage\";s:3:\"669\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0167-8655\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"FAN\";s:10:\"\u0000*\u0000aufirst\";s:9:\"Shu-Kai S\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:8:\"LIN, Yen\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"PRLEDG\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:79:\"A multi-level thresholding approach using a hybrid optimal estimation algorithm\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:1:\"8\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/j.patrec.2006.11.005\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:79:\"A multi-level thresholding approach using a hybrid optimal estimation algorithm\";s:9:\"\u0000*\u0000jtitle\";s:27:\"Pattern recognition letters\";s:9:\"\u0000*\u0000stitle\";s:20:\"Pattern recogn. lett\";s:7:\"\u0000*\u0000date\";s:4:\"2007\";s:9:\"\u0000*\u0000volume\";s:2:\"28\";s:8:\"\u0000*\u0000issue\";s:1:\"5\";s:8:\"\u0000*\u0000spage\";s:3:\"662\";s:8:\"\u0000*\u0000epage\";s:3:\"669\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0167-8655\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"FAN\";s:10:\"\u0000*\u0000aufirst\";s:9:\"Shu-Kai S\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:8:\"LIN, Yen\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"PRLEDG\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:79:\"A multi-level thresholding approach using a hybrid optimal estimation algorithm\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:1:\"8\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/j.patrec.2006.11.005\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:79:\"A multi-level thresholding approach using a hybrid optimal estimation algorithm\";s:9:\"\u0000*\u0000jtitle\";s:27:\"Pattern recognition letters\";s:9:\"\u0000*\u0000stitle\";s:20:\"Pattern recogn. lett\";s:7:\"\u0000*\u0000date\";s:4:\"2007\";s:9:\"\u0000*\u0000volume\";s:2:\"28\";s:8:\"\u0000*\u0000issue\";s:1:\"5\";s:8:\"\u0000*\u0000spage\";s:3:\"662\";s:8:\"\u0000*\u0000epage\";s:3:\"669\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0167-8655\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"FAN\";s:10:\"\u0000*\u0000aufirst\";s:9:\"Shu-Kai S\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:8:\"LIN, Yen\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"PRLEDG\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:79:\"A multi-level thresholding approach using a hybrid optimal estimation algorithm\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:1:\"8\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
