|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM150568746 |
| 003 |
DE-627 |
| 005 |
20231223054130.0 |
| 007 |
tu |
| 008 |
231223s2004 xx ||||| 00| ||eng c |
| 028 |
5 |
2 |
|a pubmed24n0502.xml
|
| 035 |
|
|
|a (DE-627)NLM150568746
|
| 035 |
|
|
|a (NLM)15382652
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Smith, Paul
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Layered motion segmentation and depth ordering by tracking edges
|
| 264 |
|
1 |
|c 2004
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ohne Hilfsmittel zu benutzen
|b n
|2 rdamedia
|
| 338 |
|
|
|a Band
|b nc
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 19.10.2004
|
| 500 |
|
|
|a Date Revised 10.12.2019
|
| 500 |
|
|
|a published: Print
|
| 500 |
|
|
|a Citation Status MEDLINE
|
| 520 |
|
|
|a This paper presents a new Bayesian framework for motion segmentation--dividing a frame from an image sequence into layers representing different moving objects--by tracking edges between frames. Edges are found using the Canny edge detector, and the Expectation-Maximization algorithm is then used to fit motion models to these edges and also to calculate the probabilities of the edges obeying each motion model. The edges are also used to segment the image into regions of similar color. The most likely labeling for these regions is then calculated by using the edge probabilities, in association with a Markov Random Field-style prior. The identification of the relative depth ordering of the different motion layers is also determined, as an integral part of the process. An efficient implementation of this framework is presented for segmenting two motions (foreground and background) using two frames. It is then demonstrated how, by tracking the edges into further frames, the probabilities may be accumulated to provide an even more accurate and robust estimate, and segment an entire sequence. Further extensions are then presented to address the segmentation of more than two motions. Here, a hierarchical method of initializing the Expectation-Maximization algorithm is described, and it is demonstrated that the Minimum Description Length principle may be used to automatically select the best number of motion layers. The results from over 30 sequences (demonstrating both two and three motions) are presented and discussed
|
| 650 |
|
4 |
|a Comparative Study
|
| 650 |
|
4 |
|a Evaluation Study
|
| 650 |
|
4 |
|a Journal Article
|
| 650 |
|
4 |
|a Research Support, Non-U.S. Gov't
|
| 650 |
|
4 |
|a Validation Study
|
| 700 |
1 |
|
|a Drummond, Tom
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Cipolla, Roberto
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on pattern analysis and machine intelligence
|d 1979
|g 26(2004), 4 vom: 25. Apr., Seite 479-94
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnns
|
| 773 |
1 |
8 |
|g volume:26
|g year:2004
|g number:4
|g day:25
|g month:04
|g pages:479-94
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 26
|j 2004
|e 4
|b 25
|c 04
|h 479-94
|