1999
DOI: 10.1016/s0165-1684(99)00093-6
|View full text |Cite
|
Sign up to set email alerts
|

Active contour algorithm: An attractive tool for snow avalanche analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2007
2007
2010
2010

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 10 publications
0
3
0
Order By: Relevance
“…For such cases, active contours, also called snakes, have been developed in 1988 (Kass et al, 1988). They have a broad use (Wong et al, 1998;Ji and Yan, 2002;Ladret et al, 1999), including application in biological imaging (Kang, 1999;Valverde et al, 2004). The snake algorithm reconstructs the lost (invisible) part of object boundaries, so that the reconstructed images can be used as an input for the 3-D modeling software.…”
Section: Introductionmentioning
confidence: 99%
“…For such cases, active contours, also called snakes, have been developed in 1988 (Kass et al, 1988). They have a broad use (Wong et al, 1998;Ji and Yan, 2002;Ladret et al, 1999), including application in biological imaging (Kang, 1999;Valverde et al, 2004). The snake algorithm reconstructs the lost (invisible) part of object boundaries, so that the reconstructed images can be used as an input for the 3-D modeling software.…”
Section: Introductionmentioning
confidence: 99%
“…Nevertheless the short-circuit period seems too short when compared with the experiments. The analysis of the state equations (22)- (26) indicates that the short-circuit duration is mainly influenced by the current dynamic and the metal flow velocity (21). Recalling that, in fact, the current is controlled during the short-circuit time, so (19) can be modified (through L S for example) to adjust the simulated current dynamic to experimental data.…”
Section: Preliminary Resultsmentioning
confidence: 99%
“…In order to minimize E snake , we determine the list of n points constituting C. To achieve this goal we have chosen to implement the greedy algorithm [20][21][22]. In this approach the derivatives in (32) have to be approximated by finite differences.…”
Section: Algorithmmentioning
confidence: 99%