|
|
|
|
LEADER |
01000naa a22002652 4500 |
001 |
NLM17871786X |
003 |
DE-627 |
005 |
20231223152555.0 |
007 |
cr uuu---uuuuu |
008 |
231223s2008 xx |||||o 00| ||eng c |
024 |
7 |
|
|a 10.1109/TIP.2008.920737
|2 doi
|
028 |
5 |
2 |
|a pubmed24n0596.xml
|
035 |
|
|
|a (DE-627)NLM17871786X
|
035 |
|
|
|a (NLM)18390371
|
040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
041 |
|
|
|a eng
|
100 |
1 |
|
|a Shi, Yonggang
|e verfasserin
|4 aut
|
245 |
1 |
2 |
|a A real-time algorithm for the approximation of level-set-based curve evolution
|
264 |
|
1 |
|c 2008
|
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 10.06.2008
|
500 |
|
|
|a Date Revised 20.10.2021
|
500 |
|
|
|a published: Print
|
500 |
|
|
|a Citation Status MEDLINE
|
520 |
|
|
|a In this paper, we present a complete and practical algorithm for the approximation of level-set-based curve evolution suitable for real-time implementation. In particular, we propose a two-cycle algorithm to approximate level-set-based curve evolution without the need of solving partial differential equations (PDEs). Our algorithm is applicable to a broad class of evolution speeds that can be viewed as composed of a data-dependent term and a curve smoothness regularization term. We achieve curve evolution corresponding to such evolution speeds by separating the evolution process into two different cycles: one cycle for the data-dependent term and a second cycle for the smoothness regularization. The smoothing term is derived from a Gaussian filtering process. In both cycles, the evolution is realized through a simple element switching mechanism between two linked lists, that implicitly represents the curve using an integer valued level-set function. By careful construction, all the key evolution steps require only integer operations. A consequence is that we obtain significant computation speedups compared to exact PDE-based approaches while obtaining excellent agreement with these methods for problems of practical engineering interest. In particular, the resulting algorithm is fast enough for use in real-time video processing applications, which we demonstrate through several image segmentation and video tracking experiments
|
650 |
|
4 |
|a Journal Article
|
650 |
|
4 |
|a Research Support, N.I.H., Extramural
|
650 |
|
4 |
|a Research Support, U.S. Gov't, Non-P.H.S.
|
700 |
1 |
|
|a Karl, William Clem
|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 17(2008), 5 vom: 01. Mai, Seite 645-56
|w (DE-627)NLM09821456X
|x 1941-0042
|7 nnns
|
773 |
1 |
8 |
|g volume:17
|g year:2008
|g number:5
|g day:01
|g month:05
|g pages:645-56
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TIP.2008.920737
|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 17
|j 2008
|e 5
|b 01
|c 05
|h 645-56
|