{"id":"https://openalex.org/W2160495859","doi":"https://doi.org/10.1109/icassp.2003.1199474","title":"Iterative decoding of two-dimensional hidden Markov models","display_name":"Iterative decoding of two-dimensional hidden Markov models","publication_year":2003,"publication_date":"2003-12-22","ids":{"openalex":"https://openalex.org/W2160495859","doi":"https://doi.org/10.1109/icassp.2003.1199474","mag":"2160495859"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2003.1199474","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2003.1199474","pdf_url":null,"source":{"id":"https://openalex.org/S4363608982","display_name":"2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059987704","display_name":"Florent Perronnin","orcid":null},"institutions":[{"id":"https://openalex.org/I1902872","display_name":"EURECOM","ror":"https://ror.org/00sse7z02","country_code":"FR","type":"education","lineage":["https://openalex.org/I1902872","https://openalex.org/I205703379"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"F. Perronnin","raw_affiliation_strings":["Multimedia Communications Department, Institut Eurecom, Sophia-Antipolis, France"],"affiliations":[{"raw_affiliation_string":"Multimedia Communications Department, Institut Eurecom, Sophia-Antipolis, France","institution_ids":["https://openalex.org/I1902872"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055361726","display_name":"Jean\u2010Luc Dugelay","orcid":"https://orcid.org/0000-0003-3151-4330"},"institutions":[{"id":"https://openalex.org/I1902872","display_name":"EURECOM","ror":"https://ror.org/00sse7z02","country_code":"FR","type":"education","lineage":["https://openalex.org/I1902872","https://openalex.org/I205703379"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"J.-L. Dugelay","raw_affiliation_strings":["Multimedia Communications Department, Institut Eurecom, Sophia-Antipolis, France"],"affiliations":[{"raw_affiliation_string":"Multimedia Communications Department, Institut Eurecom, Sophia-Antipolis, France","institution_ids":["https://openalex.org/I1902872"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026459097","display_name":"Kenneth Rose","orcid":"https://orcid.org/0000-0001-9463-2647"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. Rose","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5059987704"],"corresponding_institution_ids":["https://openalex.org/I1902872"],"apc_list":null,"apc_paid":null,"fwci":2.5011,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.89789636,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"3","issue":null,"first_page":"III","last_page":"329"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11901","display_name":"Bayesian Methods and Mixture Models","score":0.9684000015258789,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11901","display_name":"Bayesian Methods and Mixture Models","score":0.9684000015258789,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9253000020980835,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9100000262260437,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hidden-markov-model","display_name":"Hidden Markov model","score":0.8779522180557251},{"id":"https://openalex.org/keywords/viterbi-algorithm","display_name":"Viterbi algorithm","score":0.8625075817108154},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7379198670387268},{"id":"https://openalex.org/keywords/forward-algorithm","display_name":"Forward algorithm","score":0.7082769870758057},{"id":"https://openalex.org/keywords/iterative-viterbi-decoding","display_name":"Iterative Viterbi decoding","score":0.6672800183296204},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6586325764656067},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6586182117462158},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5355024337768555},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.51938396692276},{"id":"https://openalex.org/keywords/soft-output-viterbi-algorithm","display_name":"Soft output Viterbi algorithm","score":0.5166571140289307},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5153931379318237},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5054783821105957},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.464645117521286},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.44525957107543945},{"id":"https://openalex.org/keywords/markov-model","display_name":"Markov model","score":0.39519140124320984},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.3738285303115845},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2794020473957062},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26917195320129395},{"id":"https://openalex.org/keywords/variable-order-markov-model","display_name":"Variable-order Markov model","score":0.24080145359039307},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.10821488499641418}],"concepts":[{"id":"https://openalex.org/C23224414","wikidata":"https://www.wikidata.org/wiki/Q176769","display_name":"Hidden Markov model","level":2,"score":0.8779522180557251},{"id":"https://openalex.org/C60582962","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Viterbi algorithm","level":3,"score":0.8625075817108154},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7379198670387268},{"id":"https://openalex.org/C196455857","wikidata":"https://www.wikidata.org/wiki/Q5473264","display_name":"Forward algorithm","level":5,"score":0.7082769870758057},{"id":"https://openalex.org/C113638808","wikidata":"https://www.wikidata.org/wiki/Q6094410","display_name":"Iterative Viterbi decoding","level":5,"score":0.6672800183296204},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6586325764656067},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6586182117462158},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5355024337768555},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.51938396692276},{"id":"https://openalex.org/C130319729","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Soft output Viterbi algorithm","level":5,"score":0.5166571140289307},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5153931379318237},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5054783821105957},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.464645117521286},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.44525957107543945},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.39519140124320984},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.3738285303115845},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2794020473957062},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26917195320129395},{"id":"https://openalex.org/C54907487","wikidata":"https://www.wikidata.org/wiki/Q7915688","display_name":"Variable-order Markov model","level":4,"score":0.24080145359039307},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.10821488499641418},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icassp.2003.1199474","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2003.1199474","pdf_url":null,"source":{"id":"https://openalex.org/S4363608982","display_name":"2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.79.7600","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.79.7600","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.scl.ece.ucsb.edu/pubs/pubs_B/b03_1.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W188272584","https://openalex.org/W1480865305","https://openalex.org/W2024581784","https://openalex.org/W2044442377","https://openalex.org/W2073385196","https://openalex.org/W2099111195","https://openalex.org/W2125838338","https://openalex.org/W2136126387","https://openalex.org/W2152873414","https://openalex.org/W6656414104","https://openalex.org/W6674851815","https://openalex.org/W6680065369"],"related_works":["https://openalex.org/W2062804535","https://openalex.org/W1915619113","https://openalex.org/W2993094530","https://openalex.org/W2143297499","https://openalex.org/W2767243160","https://openalex.org/W2544568790","https://openalex.org/W2382079494","https://openalex.org/W1521950899","https://openalex.org/W4328011717","https://openalex.org/W252801571"],"abstract_inverted_index":{"While":[0],"the":[1,13,23,48,90,95,114,144],"hidden":[2],"Markov":[3],"model":[4],"(HMM)":[5],"has":[6],"been":[7],"extensively":[8],"applied":[9],"to":[10,18,57,106],"one-dimensional":[11],"problems,":[12],"complexity":[14],"of":[15,32,42,68,81,89],"its":[16,98,104],"extension":[17],"two-dimensions":[19],"grows":[20],"exponentially":[21],"with":[22,62,139],"data":[24],"size":[25],"and":[26,70,76,83,97,141],"is":[27,56],"intractable":[28],"in":[29],"most":[30,49],"cases":[31],"interest.":[33],"We":[34,93,101],"introduce":[35],"an":[36],"efficient":[37],"algorithm":[38,108,121,148],"for":[39,47,110],"approximate":[40,58],"decoding":[41,79,111],"2D":[43,60,112],"HMMs,":[44],"i.e.,":[45],"searching":[46],"likely":[50],"state":[51,118],"sequence.":[52],"The":[53],"basic":[54],"idea":[55],"a":[59,63,86],"HMM":[61],"turbo-HMM":[64],"(T-HMM),":[65],"which":[66],"consists":[67],"horizontal":[69],"vertical":[71],"1D":[72],"HMMs":[73],"that":[74,143],"\"communicate\",":[75],"allow":[77],"iterated":[78],"(ID)":[80],"rows":[82],"columns":[84],"by":[85],"modified":[87],"version":[88],"forward-backward":[91],"algorithm.":[92],"derive":[94],"approach":[96,138],"re-estimation":[99],"equations.":[100],"then":[102],"compare":[103],"performance":[105],"another":[107],"designed":[109],"HMMs:":[113],"path":[115],"constrained":[116],"variable":[117],"Viterbi":[119],"(PCVSV)":[120],"(Li,":[122],"J.":[123],"et":[124],"al.,":[125],"IEEE":[126],"Trans.":[127],"on":[128],"Sig.":[129],"Processing,":[130],"vol.48,":[131],"no.2,":[132],"2000).":[133],"Finally,":[134],"we":[135],"combine":[136],"our":[137],"PCVSV":[140],"show":[142],"combination":[145],"outperforms":[146],"each":[147],"taken":[149],"separately.":[150]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
