An efficient approach for Interactive Sequential Pattern Recognition. (April 2017)

• Record Type: Journal Article
• Authors: Calvo-Zaragoza, Jorge; Oncina, Jose
• Is Part Of: Pattern recognition. Volume 64(2017:Apr.)
• Page Start: 295
• Page End: 304
• Publication Date: 2017-04
• Subjects: Interactive Pattern Recognition -- Sequential Pattern Recognition -- Human-computer interaction -- Word graphs -- Efficient search; Pattern perception -- Periodicals; Perception des structures -- Périodiques; Patroonherkenning; 006.4
• DOI: 10.1016/j.patcog.2016.11.006
• Languages: English
• ISSNs: 0031-3203

Abstract

Abstract: Interactive Pattern Recognition (IPR) is an emergent framework in which the user is involved actively in the recognition process by giving feedback to the system when an error is detected. Although this framework is expected to reduce the number of errors to correct, it may increase the time required to complete the task since the machine needs to recompute its proposal after each interaction. Therefore, a fast computation is required to make the interactive system profitable and user-friendly. This work presents an efficient approach to deal with IPR tasks when data has a sequential nature. Our approach includes some computation at the very beginning of the task but it then achieves a linear complexity after user corrections. We also show how these tasks can be effectively carried out if the solution space is defined with a Regular Language. This fact has indeed proven to be the most relevant factor to improve the efficiency of the approach. Several experiments are carried out in which our proposal is faced against a classical search. Results show a reduction in time in all experiments considered, solving efficiently some complex IPR tasks thanks to our proposals. Abstract : Highlights: Searching the optimal decoding for Interactive Sequential Pattern Recognition tasks may be computationally expensive. A normalization procedure is proposed so that computing optimal hypotheses becomes more efficient. A specially profitable case is reported when dealing with Regular Languages. Experimental results show a significant save of computational time.