4 resultados para Graph cuts

em Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco


Relevância:

20.00% 20.00%

Publicador:

Resumo:

[EN]Most of the information indicating ageing improves tenderness has been collected on the loin and rib-eye muscles over relatively short ageing times, assuming that all muscles will react similarly. In the present study, the effect of extended ageing times on instrumental texture (56 d) and sensory characteristics (42 d) of six different beef sub-primals [striploin (SL), inside round (IR), outside round (OR), eye of round (ER), blade eye (BE) and chuck tender (CT)] was studied. The effects of two ageing temperatures (1and 58C) were also compared. In general, ageing increased tenderness (P<0.05) of SL, BE, ER and CT sub-primals, although BE shear force increased after 42 d of ageing. On the other hand, ageing had no effect on IR tenderness (P<0.05) and resulted in a decrease in tenderness of OR (P<0.05) until day 35, with a later increase after 42 d of ageing. Increasing ageing temperature (58C) had limited effect on tenderness, but ageing time and temperature increases led to lower flavour and higher off-flavour intensity (P<0.05) of the studied sub-primals. These results suggest that cutspecific maximum ageing times and rigid adherence to temperature maximums would be of benefit to optimize postslaughter processes and meat quality

Relevância:

10.00% 10.00%

Publicador:

Resumo:

This paper proposes a new method for local key and chord estimation from audio signals. This method relies primarily on principles from music theory, and does not require any training on a corpus of labelled audio files. A harmonic content of the musical piece is first extracted by computing a set of chroma vectors. A set of chord/key pairs is selected for every frame by correlation with fixed chord and key templates. An acyclic harmonic graph is constructed with these pairs as vertices, using a musical distance to weigh its edges. Finally, the sequences of chords and keys are obtained by finding the best path in the graph using dynamic programming. The proposed method allows a mutual chord and key estimation. It is evaluated on a corpus composed of Beatles songs for both the local key estimation and chord recognition tasks, as well as a larger corpus composed of songs taken from the Billboard dataset.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

The study of complex networks has attracted the attention of the scientific community for many obvious reasons. A vast number of systems, from the brain to ecosystems, power grid, and the Internet, can be represented as large complex networks, i.e, assemblies of many interacting components with nontrivial topological properties. The link between these components can describe a global behaviour such as the Internet traffic, electricity supply service, market trend, etc. One of the most relevant topological feature of graphs representing these complex systems is community structure which aims to identify the modules and, possibly, their hierarchical organization, by only using the information encoded in the graph topology. Deciphering network community structure is not only important in order to characterize the graph topologically, but gives some information both on the formation of the network and on its functionality.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

[ES] Los repositorios institucionales albergan gran cantidad de información científica generada por las universidades y centros de investigación que está disponible para su descarga y uso de forma libre. Uno de los factores que puede limitar el uso proviene de la dificultad de navegación dentro de las interfaces que proporcionan estos programas de cara a los usuarios; por este motivo, es interesante desarrollar métodos alternativos de búsqueda y navegación por los contenidos que complementen a los existentes, permitiendo así una mayor difusión.