|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM188578587 |
| 003 |
DE-627 |
| 005 |
20231223182152.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231223s2009 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TIP.2009.2017823
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n0629.xml
|
| 035 |
|
|
|a (DE-627)NLM188578587
|
| 035 |
|
|
|a (NLM)19447719
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Bardera, Anton
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Image segmentation using information bottleneck method
|
| 264 |
|
1 |
|c 2009
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 22.09.2009
|
| 500 |
|
|
|a Date Revised 25.11.2016
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status MEDLINE
|
| 520 |
|
|
|a In image processing, segmentation algorithms constitute one of the main focuses of research. In this paper, new image segmentation algorithms based on a hard version of the information bottleneck method are presented. The objective of this method is to extract a compact representation of a variable, considered the input, with minimal loss of mutual information with respect to another variable, considered the output. First, we introduce a split-and-merge algorithm based on the definition of an information channel between a set of regions (input) of the image and the intensity histogram bins (output). From this channel, the maximization of the mutual information gain is used to optimize the image partitioning. Then, the merging process of the regions obtained in the previous phase is carried out by minimizing the loss of mutual information. From the inversion of the above channel, we also present a new histogram clustering algorithm based on the minimization of the mutual information loss, where now the input variable represents the histogram bins and the output is given by the set of regions obtained from the above split-and-merge algorithm. Finally, we introduce two new clustering algorithms which show how the information bottleneck method can be applied to the registration channel obtained when two multimodal images are correctly aligned. Different experiments on 2-D and 3-D images show the behavior of the proposed algorithms
|
| 650 |
|
4 |
|a Journal Article
|
| 650 |
|
4 |
|a Research Support, Non-U.S. Gov't
|
| 700 |
1 |
|
|a Rigau, Jaume
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Boada, Imma
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Feixas, Miquel
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Sbert, Mateu
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
|d 1992
|g 18(2009), 7 vom: 15. Juli, Seite 1601-12
|w (DE-627)NLM09821456X
|x 1941-0042
|7 nnns
|
| 773 |
1 |
8 |
|g volume:18
|g year:2009
|g number:7
|g day:15
|g month:07
|g pages:1601-12
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TIP.2009.2017823
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 18
|j 2009
|e 7
|b 15
|c 07
|h 1601-12
|