Please wait, while we are loading the content...
Please wait, while we are loading the content...
Content Provider | IEEE Xplore Digital Library |
---|---|
Author | Vidyasagar, M. |
Copyright Year | 2005 |
Description | Author affiliation: Tata Consultancy Service, No. 1 Software Units Layout, Madhapur, Hyderabad 500 081, India, sagar@atc.tc.co.n (Vidyasagar, M.) |
Abstract | Suppose m is a positive integer, and let M:= {1,...,m}. Suppose {Yt} is a stationary stochastic process assuming values in M. IN this paper we study the question: When does there exist a hidden Markov model (HMM) that perfectly reproduces the complete statistics of this process? Though HMM's are more than forty years old, no complete solution to this problem is available. It is known that a necessary condition for the process to have a HMM is that an assoicated `Hankel' matrix should have finite rank. It is also known that the condition is not sufficient in general. In subsequent work, an alogrithm for constructing a HMM for a finite rank process has been given, assuming at the outset that the process has a HMM. Hence, to date there are no conditions, either necessary or sufficient, for a process to have a HMM that can be stated in terms of the process alone, and nothing else. Against this background, in the present paper we show the following: (i) Suppose a process has finite Hankel rank. Then there always exists a `regular quasi-realization' of the process. Moreover, two regular quasi-realizations are related through a similarity transformation. (ii) If in addition the process is á- mixing, every regular quasi-realization has additional features. Specifically, the `state transition' matrix associated with the quasi-realization satisfies the `quasi-strong Perron property' (its spectral radius is one, the spectral radius is a simple eigenvalue, and there are no other eigenvalues on the unit circle). |
Starting Page | 6632 |
Ending Page | 6637 |
File Size | 156230 |
Page Count | 6 |
File Format | |
ISBN | 0780395670 |
DOI | 10.1109/CDC.2005.1583227 |
Language | English |
Publisher | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Publisher Date | 2005-12-15 |
Publisher Place | Spain |
Access Restriction | Subscribed |
Rights Holder | IEEE/EUCA |
Subject Keyword | Hidden Markov models Statistics Application software Stochastic processes Eigenvalues and eigenfunctions Markov processes Speech processing Source coding Computational biology Organisms |
Content Type | Text |
Resource Type | Article |
National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.
Learn more about this project from here.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
Sl. | Authority | Responsibilities | Communication Details |
---|---|---|---|
1 | Ministry of Education (GoI), Department of Higher Education |
Sanctioning Authority | https://www.education.gov.in/ict-initiatives |
2 | Indian Institute of Technology Kharagpur | Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project | https://www.iitkgp.ac.in |
3 | National Digital Library of India Office, Indian Institute of Technology Kharagpur | The administrative and infrastructural headquarters of the project | Dr. B. Sutradhar bsutra@ndl.gov.in |
4 | Project PI / Joint PI | Principal Investigator and Joint Principal Investigators of the project |
Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon |
5 | Website/Portal (Helpdesk) | Queries regarding NDLI and its services | support@ndl.gov.in |
6 | Contents and Copyright Issues | Queries related to content curation and copyright issues | content@ndl.gov.in |
7 | National Digital Library of India Club (NDLI Club) | Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach | clubsupport@ndl.gov.in |
8 | Digital Preservation Centre (DPC) | Assistance with digitizing and archiving copyright-free printed books | dpc@ndl.gov.in |
9 | IDR Setup or Support | Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops | idr@ndl.gov.in |
Loading...
|