2012
DOI: 10.1016/j.ymssp.2011.10.006
|View full text |Cite
|
Sign up to set email alerts
|

A graph cut strategy for transmission path problems in statistical energy analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0

Year Published

2014
2014
2018
2018

Publication Types

Select...
7

Relationship

2
5

Authors

Journals

citations
Cited by 12 publications
(10 citation statements)
references
References 18 publications
0
10
0
Order By: Relevance
“…A final SmEdA simulation would verify the performance of the solution in terms of noise reduction. A similar automatized procedure in the easier case of SEA was developed in the framework of graph theory in [28]. The development of an analogous process for SmEdA as described is, however, outside the scope of this paper.…”
Section: Pathmentioning
confidence: 99%
See 1 more Smart Citation
“…A final SmEdA simulation would verify the performance of the solution in terms of noise reduction. A similar automatized procedure in the easier case of SEA was developed in the framework of graph theory in [28]. The development of an analogous process for SmEdA as described is, however, outside the scope of this paper.…”
Section: Pathmentioning
confidence: 99%
“…In [24], an adaptation of the MSP algorithm (see [25,26]) for the efficient computation and ranking of energy transmission paths from sources to receivers in SEA systems was presented, the inclusion of variance recently being taken into account in [27]. Graph cut algorithms were also used in [28] in an optimizing process to diminish energy transmission between subsystems in SEA. The prospect of defining SEA graphs for the more general ED models has recently been deemed viable in.…”
Section: Introductionmentioning
confidence: 99%
“…Connecting SEA with graph theory allows to infer very useful results with regards to the vibro-acoustic behavior of a SEA system. These will basically depend on the type of weights selected for E SEA and on the operations to carry on with them [5,6,15,8].…”
Section: Deterministic and Stochastic Sea Graphsmentioning
confidence: 99%
“…Yet, the possibility to rank contributions of individual paths in an efficient way has been made possible recently by establishing a connection between SEA and graph theory [5]. In [6], the deterministic MPS algorithm [7] based on deviation path computations was adapted for this purpose (see also [8] for related applications of graph theory to SEA).…”
Section: Introductionmentioning
confidence: 99%
“…This contributes to the low computational cost of the problem, which is particularly important because the identification of subsystems is a preprocessing step in SEA calculation, and one of the main features of SEA is its low computational cost. Finally, it is worth mentioning that subsystem identification is not only a topic of interest for SEA applications like [18] but also in the analysis of mechanical systems/problems in general, see for example [19].…”
Section: Introductionmentioning
confidence: 99%