Search results for " Marko"

showing 10 items of 201 documents

An automatic system for humanoid dance creation

2016

Abstract The paper describes a novel approach to allow a robot to dance following musical rhythm. The proposed system generates a dance for a humanoid robot through the combination of basic movements synchronized with the music. The system made up of three parts: the extraction of features from audio file, estimation of movements through the Hidden Markov Models and, finally, the generation of dance. Starting from a set of given movements, the robot choices sequence of movements a suitable Hidden Markov Model, and synchronize them processing musical input. The proposed approach has the advantage that movement execution probabilities could be changed according evaluation of the dance executi…

Computational creativityDanceRobotComputational creativityCognitive NeuroscienceExperimental and Cognitive Psychology02 engineering and technology03 medical and health sciences0302 clinical medicineArtificial IntelligenceRobustness (computer science)0202 electrical engineering electronic engineering information engineeringHidden Markov modelSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniMovement (music)business.industryCognitive architectureDanceRobotCo-creative toolMusic perception020201 artificial intelligence & image processingArtificial intelligencePsychologybusiness030217 neurology & neurosurgeryHumanoid robotBiologically Inspired Cognitive Architectures
researchProduct

Modeling and Performance Analysis of Channel Assembling in Multichannel Cognitive Radio Networks With Spectrum Adaptation

2012

[EN] To accommodate spectrum access in multichannel cognitive radio networks (CRNs), the channel-assembling technique, which combines several channels together as one channel, has been proposed in many medium access control (MAC) protocols. However, analytical models for CRNs enabled with this technique have not been thoroughly investigated. In this paper, two representative channel-assembling strategies that consider spectrum adaptation and heterogeneous traffic are proposed, and the performance of these strategies is evaluated based on the proposed continuous-time Markov chain (CTMC) models. Moreover, approximations of these models in the quasistationary regime are analyzed, and closed-fo…

Computer Networks and CommunicationsComputer scienceAerospace EngineeringMarkov process02 engineering and technologyContinuous-time Markov chain (CTMC) modelsChannel assemblingsymbols.namesake0203 mechanical engineering0202 electrical engineering electronic engineering information engineeringCognitive radio networks (CRNs)Electrical and Electronic EngineeringAdaptation (computer science)SimulationMarkov chainPerformance analysisSpectrum (functional analysis)020206 networking & telecommunications020302 automobile design & engineeringINGENIERIA TELEMATICACognitive radioAutomotive EngineeringsymbolsSpectrum adaptationAlgorithmCommunication channelIEEE Transactions on Vehicular Technology
researchProduct

Part of Speech Tagging Using Hidden Markov Models

2020

Abstract In this paper, we present a wide range of models based on less adaptive and adaptive approaches for a PoS tagging system. These parameters for the adaptive approach are based on the n-gram of the Hidden Markov Model, evaluated for bigram and trigram, and based on three different types of decoding method, in this case forward, backward, and bidirectional. We used the Brown Corpus for the training and the testing phase. The bidirectional trigram model almost reaches state of the art accuracy but is disadvantaged by the decoding speed time while the backward trigram reaches almost the same results with a way better decoding speed time. By these results, we can conclude that the decodi…

Computer scienceBrown CorpusSpeech recognitionBigramTrigramHidden Markov modelTag systemSentenceWord (computer architecture)Decoding methodsInternational Journal of Advanced Statistics and IT&C for Economics and Life Sciences
researchProduct

Molecular dynamics simulations in hybrid particle-continuum schemes: Pitfalls and caveats

2017

Heterogeneous multiscale methods (HMM) combine molecular accuracy of particle-based simulations with the computational efficiency of continuum descriptions to model flow in soft matter liquids. In these schemes, molecular simulations typically pose a computational bottleneck, which we investigate in detail in this study. We find that it is preferable to simulate many small systems as opposed to a few large systems, and that a choice of a simple isokinetic thermostat is typically sufficient while thermostats such as Lowe-Andersen allow for simulations at elevated viscosity. We discuss suitable choices for time steps and finite-size effects which arise in the limit of very small simulation bo…

Computer scienceGeneral Physics and AstronomySolverCondensed Matter - Soft Condensed Matter01 natural sciencesThermostatBottleneck010305 fluids & plasmaslaw.invention010101 applied mathematicsMolecular dynamicsHardware and ArchitectureDiscontinuous Galerkin methodlaw0103 physical sciencesSoft matterStatistical physics0101 mathematicsShear flowHidden Markov model
researchProduct

Algorithmic Aspects of Speech Recognition: A Synopsis

2000

Speech recognition is an area with a sizable literature, but there is little discussion of the topic within the computer science algorithms community. Since many of the problems arising in speech recognition are well suited for algorithmic studies, we present them in terms familiar to algorithm designers. Such cross fertilization can breed fresh insights from new perspectives. This material is abstracted from A. L. Buchsbaum and R. Giancarlo, Algorithmic Aspects of Speech Recognition: An Introduction, ACM Journal of Experimental Algorithmics, Vol. 2, 1997, http://www.jea.acm.org.

Computer scienceSpeech recognitionSpeech corpusHidden Markov modelGeneralLiterature_REFERENCE(e.g.dictionariesencyclopediasglossaries)
researchProduct

A Bayesian-optimal principle for learner-friendly adaptation in learning games

2010

Abstract Adaptive learning games should provide opportunities for the student to learn as well as motivate playing until goals have been reached. In this paper, we give a mathematically rigorous treatment of the problem in the framework of Bayesian decision theory. To quantify the opportunities for learning, we assume that the learning tasks that yield the most information about the current skills of the student, while being desirable for measurement in their own right, would also be among those that are efficient for learning. Indeed, optimization of the expected information gain appears to naturally avoid tasks that are exceedingly demanding or exceedingly easy as their results are predic…

Computer sciencebusiness.industryApplied MathematicsE-learning (theory)05 social sciencesBayesian probability050301 educationMulti-task learningMachine learningcomputer.software_genre050105 experimental psychologyTask (project management)0501 psychology and cognitive sciencesAdaptive learningArtificial intelligenceHidden Markov modelAdaptation (computer science)business0503 educationcomputerGeneral PsychologyDynamic Bayesian networkJournal of Mathematical Psychology
researchProduct

Hidden Markov Model Based Machine Learning for mMTC Device Cell Association in 5G Networks

2019

Massive machine-type communication (mMTC) is expected to play a pivotal role in emerging 5G networks. Considering the dense deployment of small cells and the existence of heterogeneous cells, an MTC device can discover multiple cells for association. Under traditional cell association mechanisms, MTC devices are typically associated with an eNodeB with highest signal strength. However, the selected eNodeB may not be able to handle mMTC requests due to network congestion and overload. Therefore, reliable cell association would provide a smarter solution to facilitate mMTC connections. To enable such a solution, a hidden Markov model (HMM) based machine learning (ML) technique is proposed in …

Computer sciencebusiness.industryAssociation (object-oriented programming)Reliability (computer networking)05 social sciences050801 communication & media studiesMachine learningcomputer.software_genreNetwork congestion0508 media and communicationsEnodeB0502 economics and business050211 marketingArtificial intelligenceState (computer science)Hidden Markov modelbusinessVDP::Teknologi: 500::Informasjons- og kommunikasjonsteknologi: 550computer5GData transmissionICC 2019 - 2019 IEEE International Conference on Communications (ICC)
researchProduct

Automatic place detection and localization in autonomous robotics

2007

This paper presents an approach for the simultaneous learning and recognition of places applied to autonomous robotics. While noteworthy results have been achieved with respect to off-line training process for appearance-based navigation, novel issues arise when recognition and learning are simultaneous and unsupervised processes. The approach adopted here uses a Gaussian mixture model estimated by a novel incremental MML-EM to model the probability distribution of features extracted by image-preprocessing. A place detector decides which features belong to which place integrating odometric information and a hidden Markov model. Tests demonstrate that the proposed system performs as well as …

Computer sciencebusiness.industryFeature extractionRoboticsComputer Science Applications1707 Computer Vision and Pattern RecognitionMixture modelMachine learningcomputer.software_genreObject detectionsymbols.namesakeControl and Systems EngineeringsymbolsRobotUnsupervised learningArtificial intelligenceHidden Markov modelbusinessGaussian processcomputerSoftware1707
researchProduct

A Sub-Symbolic Approach to Word Modelling for Domain Specific Speech Recognition

2006

In this work a sub-symbolic technique for automatic, data driven language models construction is presented. Such a technique can be used to arrange a language-modelling module, which can be easily integrated in existing speech recognition architectures, such as the well-found HTK architecture. The proposed technique takes advantages from both the traditional LSA approach and from a novel application of a probability space metric known as "Hellinger's distance". Experimental trials are also presented, in order to validate the proposed approach.

Computer sciencebusiness.industrySpeech recognitionMachine learningcomputer.software_genreDomain (software engineering)Speech enhancementMetric (mathematics)Artificial intelligenceLanguage modelHellinger distanceHidden Markov modelbusinesscomputerNatural languageWord (computer architecture)Seventh International Workshop on Computer Architecture for Machine Perception (CAMP'05)
researchProduct

Detection of TV commercials

2004

This paper presents a system that labels TV shots either as commercial or program shots. The system uses two observations: logo presence and shot duration. These observations are modeled using HMMs, and a Viterbi decoder is finally used for shot labeling. The system has been tested on several hours of real video, achieving more than 99% correct labeling.

Computer sciencebusiness.industrySpeech recognitionShot (filmmaking)ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONViterbi algorithmsymbols.namesakeComputingMethodologies_PATTERNRECOGNITIONViterbi decoderPattern recognition (psychology)symbolsComputer visionArtificial intelligenceHidden Markov modelbusinessDecoding methods2004 IEEE International Conference on Acoustics, Speech, and Signal Processing
researchProduct