| Records |
| Author |
Pau Riba; Alicia Fornes; Josep Llados |
| Title |
Towards the Alignment of Handwritten Music Scores |
Type |
Conference Article |
| Year |
2015 |
Publication |
11th IAPR International Workshop on Graphics Recognition |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
|
| Keywords |
|
| Abstract |
It is very common to find different versions of the same music work in archives of Opera Theaters. These differences correspond to modifications and annotations from the musicians. From the musicologist point of view, these variations are very interesting and deserve study. This paper explores the alignment of music scores as a tool for automatically detecting the passages that contain such differences. Given the difficulties in the recognition of handwritten music scores, our goal is to align the music scores and at the same time, avoid the recognition of music elements as much as possible. After removing the staff lines, braces and ties, the bar lines are detected. Then, the bar units are described as a whole using the Blurred Shape Model. The bar units alignment is performed by using Dynamic Time Warping. The analysis of the alignment path is used to detect the variations in the music scores. The method has been evaluated on a subset of the CVC-MUSCIMA dataset, showing encouraging results. |
| Address |
Nancy; France; August 2015 |
| Corporate Author |
|
Thesis |
|
Publisher  |
Springer International Publishing |
Place of Publication |
|
Editor |
Bart Lamiroy; Rafael Dueire Lins |
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
LNCS |
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
978-3-319-52158-9 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
GREC |
| Notes |
DAG |
Approved |
no |
| Call Number |
Admin @ si @ |
Serial |
2874 |
| Permanent link to this record |
| |
|
| |
| Author |
Jaume Amores |
| Title |
MILDE: multiple instance learning by discriminative embedding |
Type |
Journal Article |
| Year |
2015 |
Publication |
Knowledge and Information Systems |
Abbreviated Journal |
KAIS |
| Volume |
42 |
Issue |
2 |
Pages |
381-407 |
| Keywords |
Multi-instance learning; Codebook; Bag of words |
| Abstract |
While the objective of the standard supervised learning problem is to classify feature vectors, in the multiple instance learning problem, the objective is to classify bags, where each bag contains multiple feature vectors. This represents a generalization of the standard problem, and this generalization becomes necessary in many real applications such as drug activity prediction, content-based image retrieval, and others. While the existing paradigms are based on learning the discriminant information either at the instance level or at the bag level, we propose to incorporate both levels of information. This is done by defining a discriminative embedding of the original space based on the responses of cluster-adapted instance classifiers. Results clearly show the advantage of the proposed method over the state of the art, where we tested the performance through a variety of well-known databases that come from real problems, and we also included an analysis of the performance using synthetically generated data. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
Springer London |
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
0219-1377 |
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
ADAS; 601.042; 600.057; 600.076 |
Approved |
no |
| Call Number |
Admin @ si @ Amo2015 |
Serial |
2383 |
| Permanent link to this record |
| |
|
| |
| Author |
Mohammad Ali Bagheri; Qigang Gao; Sergio Escalera |
| Title |
Combining Local and Global Learners in the Pairwise Multiclass Classification |
Type |
Journal Article |
| Year |
2015 |
Publication |
Pattern Analysis and Applications |
Abbreviated Journal |
PAA |
| Volume |
18 |
Issue |
4 |
Pages |
845-860 |
| Keywords |
Multiclass classification; Pairwise approach; One-versus-one |
| Abstract |
Pairwise classification is a well-known class binarization technique that converts a multiclass problem into a number of two-class problems, one problem for each pair of classes. However, in the pairwise technique, nuisance votes of many irrelevant classifiers may result in a wrong class prediction. To overcome this problem, a simple, but efficient method is proposed and evaluated in this paper. The proposed method is based on excluding some classes and focusing on the most probable classes in the neighborhood space, named Local Crossing Off (LCO). This procedure is performed by employing a modified version of standard K-nearest neighbor and large margin nearest neighbor algorithms. The LCO method takes advantage of nearest neighbor classification algorithm because of its local learning behavior as well as the global behavior of powerful binary classifiers to discriminate between two classes. Combining these two properties in the proposed LCO technique will avoid the weaknesses of each method and will increase the efficiency of the whole classification system. On several benchmark datasets of varying size and difficulty, we found that the LCO approach leads to significant improvements using different base learners. The experimental results show that the proposed technique not only achieves better classification accuracy in comparison to other standard approaches, but also is computationally more efficient for tackling classification problems which have a relatively large number of target classes. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
Springer London |
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
1433-7541 |
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
HuPBA;MILAB |
Approved |
no |
| Call Number |
Admin @ si @ BGE2014 |
Serial |
2441 |
| Permanent link to this record |
| |
|
| |
| Author |
G.Blasco; Simone Balocco; J.Puig; J.Sanchez-Gonzalez; W.Ricart; J.Daunis-I-Estadella; X.Molina; S.Pedraza; J.M.Fernandez-Real |
| Title |
Carotid pulse wave velocity by magnetic resonance imaging is increased in middle-aged subjects with the metabolic syndrome |
Type |
Journal Article |
| Year |
2015 |
Publication |
International Journal of Cardiovascular Imaging |
Abbreviated Journal |
ICJI |
| Volume |
31 |
Issue |
3 |
Pages |
603-612 |
| Keywords |
Metabolic syndrome; Arterial stiffness; Pulse wave velocity; Carotid artery; Magnetic resonance |
| Abstract |
Arterial pulse wave velocity (PWV), an independent predictor of cardiovascular disease, physiologically increases with age; however, growing evidence suggests metabolic syndrome (MetS) accelerates this increase. Magnetic resonance imaging (MRI) enables reliable noninvasive assessment of arterial stiffness by measuring arterial PWV in specific vascular segments. We investigated the association between the presence of MetS and its components with carotid PWV (cPWV) in asymptomatic subjects without diabetes. We assessed cPWV by MRI in 61 individuals (mean age, 55.3 ± 14.1 years; median age, 55 years): 30 with MetS and 31 controls with similar age, sex, body mass index, and LDL-cholesterol levels. The study population was dichotomized by the median age. To remove the physiological association between PWV and age, unpaired t tests and multiple regression analyses were performed using the residuals of the regression between PWV and age. cPWV was higher in middle-aged subjects with MetS than in those without (p = 0.001), but no differences were found in elder subjects (p = 0.313). cPWV was associated with diastolic blood pressure (r = 0.276, p = 0.033) and waist circumference (r = 0.268, p = 0.038). The presence of MetS was associated with increased cPWV regardless of age, sex, blood pressure, and waist (p = 0.007). The MetS components contributing independently to an increased cPWV were hypertension (p = 0.018) and hypertriglyceridemia (p = 0.002). The presence of MetS is associated with an increased cPWV in middle-aged subjects. In particular, hypertension and hypertriglyceridemia may contribute to early progression of carotid stiffness. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
Springer Netherlands |
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
1569-5794 |
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
MILAB |
Approved |
no |
| Call Number |
Admin @ si @ BBP2015 |
Serial |
2670 |
| Permanent link to this record |
| |
|
| |
| Author |
Julie Digne; Mariella Dimiccoli; Neus Sabater; Philippe Salembier |
| Title |
Neighborhood Filters and the Recovery of 3D Information |
Type |
Book Chapter |
| Year |
2015 |
Publication |
Handbook of Mathematical Methods in Imaging |
Abbreviated Journal |
|
| Volume |
|
Issue |
III |
Pages |
1645-1673 |
| Keywords |
|
| Abstract |
Following their success in image processing (see Chapter Local Smoothing Neighborhood Filters), neighborhood filters have been extended to 3D surface processing. This adaptation is not straightforward. It has led to several variants for surfaces depending on whether the surface is defined as a mesh, or as a raw data point set. The image gray level in the bilateral similarity measure is replaced by a geometric information such as the normal or the curvature. The first section of this chapter reviews the variants of 3D mesh bilateral filters and compares them to the simplest possible isotropic filter, the mean curvature motion.In a second part, this chapter reviews applications of the bilateral filter to a data composed of a sparse depth map (or of depth cues) and of the image on which they have been computed. Such sparse depth cues can be obtained by stereovision or by psychophysical techniques. The underlying assumption to these applications is that pixels with similar intensity around a region are likely to have similar depths. Therefore, when diffusing depth information with a bilateral filter based on locality and color similarity, the discontinuities in depth are assured to be consistent with the color discontinuities, which is generally a desirable property. In the reviewed applications, this ends up with the reconstruction of a dense perceptual depth map from the joint data of an image and of depth cues. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
Springer New York |
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
978-1-4939-0789-2 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
MILAB |
Approved |
no |
| Call Number |
Admin @ si @ DDS2015 |
Serial |
2710 |
| Permanent link to this record |
| |
|
| |
| Author |
Naveen Onkarappa; Angel Sappa |
| Title |
Synthetic sequences and ground-truth flow field generation for algorithm validation |
Type |
Journal Article |
| Year |
2015 |
Publication |
Multimedia Tools and Applications |
Abbreviated Journal |
MTAP |
| Volume |
74 |
Issue |
9 |
Pages |
3121-3135 |
| Keywords |
Ground-truth optical flow; Synthetic sequence; Algorithm validation |
| Abstract |
Research in computer vision is advancing by the availability of good datasets that help to improve algorithms, validate results and obtain comparative analysis. The datasets can be real or synthetic. For some of the computer vision problems such as optical flow it is not possible to obtain ground-truth optical flow with high accuracy in natural outdoor real scenarios directly by any sensor, although it is possible to obtain ground-truth data of real scenarios in a laboratory setup with limited motion. In this difficult situation computer graphics offers a viable option for creating realistic virtual scenarios. In the current work we present a framework to design virtual scenes and generate sequences as well as ground-truth flow fields. Particularly, we generate a dataset containing sequences of driving scenarios. The sequences in the dataset vary in different speeds of the on-board vision system, different road textures, complex motion of vehicle and independent moving vehicles in the scene. This dataset enables analyzing and adaptation of existing optical flow methods, and leads to invention of new approaches particularly for driver assistance systems. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
Springer US |
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
1380-7501 |
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
ADAS; 600.055; 601.215; 600.076 |
Approved |
no |
| Call Number |
Admin @ si @ OnS2014b |
Serial |
2472 |
| Permanent link to this record |
| |
|
| |
| Author |
Debora Gil; David Roche; Agnes Borras; Jesus Giraldo |
| Title |
Terminating Evolutionary Algorithms at their Steady State |
Type |
Journal Article |
| Year |
2015 |
Publication |
Computational Optimization and Applications |
Abbreviated Journal |
COA |
| Volume |
61 |
Issue |
2 |
Pages |
489-515 |
| Keywords |
Evolutionary algorithms; Termination condition; Steady state; Differential evolution |
| Abstract |
Assessing the reliability of termination conditions for evolutionary algorithms (EAs) is of prime importance. An erroneous or weak stop criterion can negatively affect both the computational effort and the final result. We introduce a statistical framework for assessing whether a termination condition is able to stop an EA at its steady state, so that its results can not be improved anymore. We use a regression model in order to determine the requirements ensuring that a measure derived from EA evolving population is related to the distance to the optimum in decision variable space. Our framework is analyzed across 24 benchmark test functions and two standard termination criteria based on function fitness value in objective function space and EA population decision variable space distribution for the differential evolution (DE) paradigm. Results validate our framework as a powerful tool for determining the capability of a measure for terminating EA and the results also identify the decision variable space distribution as the best-suited for accurately terminating DE in real-world applications. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
Springer US |
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
0926-6003 |
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
IAM; 600.044; 605.203; 600.060; 600.075 |
Approved |
no |
| Call Number |
Admin @ si @ GRB2015 |
Serial |
2560 |
| Permanent link to this record |
| |
|
| |
| Author |
Eloi Puertas; Sergio Escalera; Oriol Pujol |
| Title |
Generalized Multi-scale Stacked Sequential Learning for Multi-class Classification |
Type |
Journal Article |
| Year |
2015 |
Publication |
Pattern Analysis and Applications |
Abbreviated Journal |
PAA |
| Volume |
18 |
Issue |
2 |
Pages |
247-261 |
| Keywords |
Stacked sequential learning; Multi-scale; Error-correct output codes (ECOC); Contextual classification |
| Abstract |
In many classification problems, neighbor data labels have inherent sequential relationships. Sequential learning algorithms take benefit of these relationships in order to improve generalization. In this paper, we revise the multi-scale sequential learning approach (MSSL) for applying it in the multi-class case (MMSSL). We introduce the error-correcting output codesframework in the MSSL classifiers and propose a formulation for calculating confidence maps from the margins of the base classifiers. In addition, we propose a MMSSL compression approach which reduces the number of features in the extended data set without a loss in performance. The proposed methods are tested on several databases, showing significant performance improvement compared to classical approaches. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
Springer-Verlag |
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
1433-7541 |
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
HuPBA;MILAB |
Approved |
no |
| Call Number |
Admin @ si @ PEP2013 |
Serial |
2251 |
| Permanent link to this record |
