IEEE Workshop on Statistical Signal Processing, 2003
DOI: 10.1109/ssp.2003.1289372
|View full text |Cite
|
Sign up to set email alerts
|

Image and signal restoration using pairwise markov trees

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
10
0
2

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(12 citation statements)
references
References 7 publications
0
10
0
2
Order By: Relevance
“…Multi modality tumor segmentation was performed by exploiting the hierarchical property of the HMT, allowing associating the high resolution CT image at the leafs of the tree, and the lower resolution PET image at the next higher scale in the tree. Future work will focus on exploiting this HMT model for PET/MR and PET multi tracer information, in addition to the use of Pairwise Markov Tree (PMT) [1] combined with evidence theory [7]. Validation of the PET/CT segmentation on datasets with histopathological reference will be also presented.…”
Section: B Multi Modal (Pet/ct) Image Segmentationmentioning
confidence: 99%
See 1 more Smart Citation
“…Multi modality tumor segmentation was performed by exploiting the hierarchical property of the HMT, allowing associating the high resolution CT image at the leafs of the tree, and the lower resolution PET image at the next higher scale in the tree. Future work will focus on exploiting this HMT model for PET/MR and PET multi tracer information, in addition to the use of Pairwise Markov Tree (PMT) [1] combined with evidence theory [7]. Validation of the PET/CT segmentation on datasets with histopathological reference will be also presented.…”
Section: B Multi Modal (Pet/ct) Image Segmentationmentioning
confidence: 99%
“…Thanks to its remarkable properties (multi observation and multi resolution joint statistics, as illustrated in Fig. 1) such a model (Hidden Markov Tree, HMT) [1] can provide fast computation, improved robustness and an effective interpretational process when handling the whole observed data simultaneously. The HMT model is defined as follows: let S be a finite set of points and X=(X s ) s S , Y=(Y s ) s S two stochastic processes indexed on S. Each X s takes its values finite set of classes Ω={ω 1,.., ω k } and Y s takes its values in the set of observations (real values).…”
mentioning
confidence: 99%
“…2 2) Entropy and Fisher Information in Chordal GMRFs: Based on (7), it follows that the entropy of a chordal MRF likewise decomposes in terms of marginal entropy on the cliques and separators of . In the moment parameters of the GMRF, we have (9) where and denote marginal entropy of cliques and separators, computed using performing the conversion (8). Thus, both and can be computed with complexity.…”
Section: ) Chordal Gmrfsmentioning
confidence: 99%
“…3 Starting from , we compute a sequence using Newton's method. For each , this requires solving the linear system (14) where is the principle submatrix of corresponding to and is the corresponding subvector of computed using (8). We then set , where is determined by back-tracking line search to stay within and to insure that entropy is increased.…”
Section: ) Chordal Gmrfsmentioning
confidence: 99%
See 1 more Smart Citation