45,578 research outputs found
Parametric Local Metric Learning for Nearest Neighbor Classification
We study the problem of learning local metrics for nearest neighbor
classification. Most previous works on local metric learning learn a number of
local unrelated metrics. While this "independence" approach delivers an
increased flexibility its downside is the considerable risk of overfitting. We
present a new parametric local metric learning method in which we learn a
smooth metric matrix function over the data manifold. Using an approximation
error bound of the metric matrix function we learn local metrics as linear
combinations of basis metrics defined on anchor points over different regions
of the instance space. We constrain the metric matrix function by imposing on
the linear combinations manifold regularization which makes the learned metric
matrix function vary smoothly along the geodesics of the data manifold. Our
metric learning method has excellent performance both in terms of predictive
power and scalability. We experimented with several large-scale classification
problems, tens of thousands of instances, and compared it with several state of
the art metric learning methods, both global and local, as well as to SVM with
automatic kernel selection, all of which it outperforms in a significant
manner
New instruments and technologies for Cultural Heritage survey: full integration between point clouds and digital photogrammetry
In the last years the Geomatic Research Group of the Politecnico di Torino faced some new research topics about new instruments for point cloud generation (e.g. Time of Flight cameras) and strong integration between multi-image matching techniques and 3D Point Cloud information in order to solve the ambiguities of the already known matching algorithms. ToF cameras can be a good low cost alternative to LiDAR instruments for the generation of precise and accurate point clouds: up to now the application range is still limited but in a near future they will be able to satisfy the most part of the Cultural Heritage metric survey requirements. On the other hand multi-image matching techniques with a correct and deep integration of the point cloud information can give the correct solution for an "intelligent" survey of the geometric object break-lines, which are the correct starting point for a complete survey. These two research topics are strictly connected to a modern Cultural Heritage 3D survey approach. In this paper after a short analysis of the achieved results, an alternative possible scenario for the development of the metric survey approach inside the wider topic of Cultural Heritage Documentation is reporte
Recommended from our members
Two-fold Semantic Web service matchmaking – applying ontology mapping for service discovery
Semantic Web Services (SWS) aim at the automated discovery and orchestration of Web services on the basis of comprehensive, machine-interpretable semantic descriptions. Since SWS annotations usually are created by distinct SWS providers, semantic-level mediation, i.e. mediation between concurrent semantic representations, is a key requirement for SWS discovery. Since semantic-level mediation aims at enabling interoperability across heterogeneous semantic representations, it can be perceived as a particular instantiation of the ontology mapping problem. While recent SWS matchmakers usually rely on manual alignments or subscription to a common ontology, we propose a two-fold SWS matchmaking approach, consisting of (a) a general-purpose semantic-level mediator and (b) comparison and matchmaking of SWS capabilities. Our semantic-level mediation approach enables the implicit representation of similarities across distinct SWS by grounding service descriptions in so-called Mediation Spaces (MS). Given a set of SWS and their respective grounding, a SWS matchmaker automatically computes instance similarities across distinct SWS ontologies and matches the request to the most suitable SWS. A prototypical application illustrates our approach
An automatic adaptive method to combine summary statistics in approximate Bayesian computation
To infer the parameters of mechanistic models with intractable likelihoods,
techniques such as approximate Bayesian computation (ABC) are increasingly
being adopted. One of the main disadvantages of ABC in practical situations,
however, is that parameter inference must generally rely on summary statistics
of the data. This is particularly the case for problems involving
high-dimensional data, such as biological imaging experiments. However, some
summary statistics contain more information about parameters of interest than
others, and it is not always clear how to weight their contributions within the
ABC framework. We address this problem by developing an automatic, adaptive
algorithm that chooses weights for each summary statistic. Our algorithm aims
to maximize the distance between the prior and the approximate posterior by
automatically adapting the weights within the ABC distance function.
Computationally, we use a nearest neighbour estimator of the distance between
distributions. We justify the algorithm theoretically based on properties of
the nearest neighbour distance estimator. To demonstrate the effectiveness of
our algorithm, we apply it to a variety of test problems, including several
stochastic models of biochemical reaction networks, and a spatial model of
diffusion, and compare our results with existing algorithms
Efficient MRF Energy Propagation for Video Segmentation via Bilateral Filters
Segmentation of an object from a video is a challenging task in multimedia
applications. Depending on the application, automatic or interactive methods
are desired; however, regardless of the application type, efficient computation
of video object segmentation is crucial for time-critical applications;
specifically, mobile and interactive applications require near real-time
efficiencies. In this paper, we address the problem of video segmentation from
the perspective of efficiency. We initially redefine the problem of video
object segmentation as the propagation of MRF energies along the temporal
domain. For this purpose, a novel and efficient method is proposed to propagate
MRF energies throughout the frames via bilateral filters without using any
global texture, color or shape model. Recently presented bi-exponential filter
is utilized for efficiency, whereas a novel technique is also developed to
dynamically solve graph-cuts for varying, non-lattice graphs in general linear
filtering scenario. These improvements are experimented for both automatic and
interactive video segmentation scenarios. Moreover, in addition to the
efficiency, segmentation quality is also tested both quantitatively and
qualitatively. Indeed, for some challenging examples, significant time
efficiency is observed without loss of segmentation quality.Comment: Multimedia, IEEE Transactions on (Volume:16, Issue: 5, Aug. 2014
Jitter and Shimmer measurements for speaker diarization
Jitter and shimmer voice quality features have been successfully
used to characterize speaker voice traits and detect voice pathologies.
Jitter and shimmer measure variations in the fundamental frequency
and amplitude of speaker's voice, respectively. Due to their nature, they can be used to assess differences between speakers. In this paper, we investigate the usefulness of these voice quality features in the task of speaker diarization. The combination of voice quality features with the conventional spectral features, Mel-Frequency Cepstral Coefficients (MFCC), is addressed in the framework of Augmented Multiparty Interaction (AMI) corpus, a multi-party and spontaneous speech set of recordings. Both sets of features are independently modeled using mixture of Gaussians and fused together at the score likelihood level. The experiments carried out on the AMI corpus show that incorporating jitter and shimmer measurements to the baseline spectral features decreases the diarization error rate in most of the recordings.Peer ReviewedPostprint (published version
- …