フジヨシ アキオ藤芳 明生教授Akio FUJIYOSHI
■研究者基本情報
委員歴
■研究活動情報
受賞
論文
- Automatic Generation of Tactile Graphics of Characters to Support Handwriting of Blind Individuals
Shunnosuke Sonobe; Hitoshi Tanaka; Akio Fujiyoshi, ラスト(シニア)オーサー, Springer Nature Switzerland
Proceedings of the 19th International Conference on Computers Helping People with Special Needs (ICCHP 2024), LNCS, 2024年07月05日, ［査読有り］ - Graph Linear Notations with Regular Expressions
Ren Mimura; Kengo Miyamoto; Akio Fujiyoshi, 責任著者, 電子情報通信学会
IEICE Transactions on Information and Systems, 2024年03月, ［査読有り］ - A Tool for Improving Readability of Japanese PDF Files for the Print Disabled and People with Foreign Roots
Akio Fujiyoshi
Proceedings of The 5th International Workshop on,Digitization and E-Inclusion in Mathematics and Science 2024 (DEIMS2024), 2024年02月16日, ［査読有り］ - Simulating the Answering Process of Dyslexic Students for Audio Versions of the Common Test for University Admissions
Masashi Hatakeyama; Akio Fujiyoshi, ラスト(シニア)オーサー, Springer
Proceedings of the 18th International Conference on Computers Helping People with Special Needs (ICCHP 2022), LNCS 13342, 2022年07月13日, ［査読有り］ - Extracting Precise Coordinate Information of Components from E-Born PDF Files
Shunsuke Nakamura; Kento Kohase; Akio Fujiyoshi, ラスト(シニア)オーサー
Proceedings of The 4th International Workshop on,Digitization and E-Inclusion in Mathematics and Science 2021 (DEIMS2021), 2021年02月18日, ［査読有り］ - A Series of Simple Processing Tools for PDF Files for People with Print Disabilities
Shunsuke Nakamura; Kento Kohase; Akio Fujiyoshi, ラスト(シニア)オーサー, Springer
Proceedings of the 17th International Conference on Computers Helping People with Special Needs (ICCHP 2020), LNCS 12376, 2020年09月10日, ［査読有り］ - Layout Analysis of PDF Documents by Two-Dimensional Grammars for the Production of Accessible Textbooks
Kento Kohase; Shunsuke Nakamura; Akio Fujiyoshi, ラスト(シニア)オーサー, Springer
Proceedings of the 17th International Conference on Computers Helping People with Special Needs (ICCHP 2020), LNCS 12376, 2020年09月10日, ［査読有り］ - A Simple Extension to Finite Tree Automata for Defining Sets of Labeled, Connected Graphs
Akio Fujiyoshi; Daniel Průša, 筆頭著者, Springer
Proceedings of the 24th International Conference on Implementation and Application of Automata (CIAA 2019), Košice, LNCS 11601, 2019年07月23日, ［査読有り］ - 正規表現拡張SMILESを用いた化学構造検索の提案
坂本 雅志; 藤芳 明生, 責任著者, This paper proposes the use of regular expressions for chemical structure search. As regular expressions dramatically improve the convenience of string search, a regular expression extension for SMILES can improve the convenience of chemical structure search．The regular expression extension for SMILES is obtained from the existing SMILES notation by adding the curly brackets "{" and "}" for range specifications, the vertical bar "|" for enumerations of choices, the asterisk "*" for repetitions of 0 or more times, and the plus"+" for repetitions of 1 or more times. Software for chemical structure search using the extended SMILES was implemented and released., 日本コンピュータ化学会
Journal of Computer Chemistry, Japan, 2019年02月, ［査読有り］ - 正規表現拡張SMILESが示す化合物集合に対する部分構造探索
藤芳 明生; 坂本 雅志, 筆頭著者, This paper proposes a substructure search method for finding an element of a set of chemical structures represented by a SMILES string with regular expression extension. It is known that substructure search is an NP-hard problem in general. However, by taking advantage of a graph-theoretical characterization of chemical compounds, the proposed method runs fast enough. Software for substructure search using the proposed method was implemented and released., 日本コンピュータ化学会
Journal of Computer Chemistry, Japan, 2019年02月, ［査読有り］ - Universal Design Tactile Graphics Production System BPLOT4 for Blind Teachers and Blind Staffs to Produce Tactile Graphics and Ink Print Graphics of High Quality
Mamoru Fujiyoshi; Akio Fujiyoshi; Hiroshi Tanaka; Toru Ishida, 責任著者
Proceedings of the 16th International Conference on Computers Helping People with Special Needs (ICCHP 2018), Linz, LNCS 10897, 2018年07月11日, ［査読有り］ - Rank-Reducing Two-Dimensional Grammars for Document Layout Analysis
Daniel Prusa; Akio Fujiyoshi, We study the task of document layout analysis based on two-dimensional context-free grammars. We first identify a subclass of the grammars sufficient for a document structure description where productions follow a mechanism inducing regular languages in the case of one-dimensional productions. We then show that properties of such grammars can be conveniently utilized to implement a very fast top-down parser. Experimental results are reported for PDF documents, which are chosen as a test domain since we are motivated by a development of digital document access methods for people with disabilities in which a retrieval of structural information plays an important role., IEEE Computer Society
Proceedings of the International Conference on Document Analysis and Recognition, ICDAR, 2018年01月25日, ［査読有り］ - A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata
Akio Fujiyoshi, This paper presents a practical algorithm for the uniform membership problem of labeled multidigraphs of tree-width at most 2 for spanning tree automata. Though the theoretical existence of a linear-time algorithm for the membership problem for graphs of bounded tree-width was shown in the previous study, the implementation of the linear-time algorithm is expected to be impractical because it requires the construction of a finite-state automaton whose size is super-exponential in the size of the tree automaton and the tree-width of graphs. In addition, the tree automaton itself should be a part of the input in practical situations., WORLD SCIENTIFIC PUBL CO PTE LTD
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2017年08月, ［査読有り］ - 重度視覚障害を有する教職員等の点字教材の自立的作図を可能にするBplot (コマンド記述方式)
藤芳衛,藤芳明生,石田透,重度視覚障害を有する視覚特別支援学校の教員や点字出版所の職員が点訳の専門家として手で触察して把握する点字教材の点図を自立的に作図可能にするため点字教材作図システムBplotを更に改良し，重度視覚障害者に特化したBplot（コマンド記述方式）を開発した．主要な改良点は，エディタで記述する作図コマンドの引数を変数や関数を含む数式で記述可能としたこと，引数の計算がすべて自動化されたこと，また，蓄積された既存の画像データをBplot（コマンド記述方式）の作図コマンドに変換する技術を開発したこと，更に重度視覚障害者も作図部品として既存の画像データの活用が可能となったことである．Bplot（コマンド記述方式）の開発は，ただ単に教職員のみならず高校や大学の学生や社会人等，従来作図が困難であったすべての重度視覚障害者の点図の自作と活用を可能にする．
, 日本教育工学会
日本教育工学会論文誌, 2017年05月, ［査読有り］ - 形式文法を用いて化学構造式中の示性式を自動認識する化学構造式OCRの提案
佐藤文恭,藤芳明生, 責任著者, 本稿では，形式文法を用いて化学構造式中の示性式を自動認識する方法を提案する．示性式とは，文字のみで構成される化学構造式であり，一般的な化学構造式の一部として現れることがある．そのため，化学構造式OCRを開発するためには，示性式における原子間の結合情報を得る必要がある．従来のOCRアプリケーションでは，事前に示性式の構造を登録した辞書を用いることで，化学構造式画像の認識を行っている．しかし，この方法では辞書に登録されていない示性式は処理することができない．そこで，形式文法を用いて示性式の構文と意味を定義し，示性式の認識を文法の構文解析処理として行うことを提案する．In this paper, we propose a method to recognize condensed structural formulas in chemical structural formulas automatically using a formal grammar. A condensed structural formula is a chemical structural formula that consists of only characters. It appears as a part of general chemical structural formula. Therefore, in order to develop optical chemical structure recognition, we need to obtain the information of bonds between atoms in condensed structural formulas. Conventional optical chemical structure recognition applications use a predefined dictionary which stores the structure of condensed structural formulas. However, condensed structural formulas not stored in the dictionary cannot be processed. So, we define syntax and semantics of condensed structural formulas using a formal grammar and, thus, a recognition of condensed structural formulas can be done as a parsing process of the grammar.
情報処理学会論文誌, 2016年11月, ［査読有り］ - A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata
Akio Fujiyoshi, This paper presents a practical algorithm for the uniform membership problem of labeled multidigraphs of tree-width at most 2 for spanning tree automata. Though it has been shown that the membership problem is solvable in linear time for graphs of bounded tree-width, the algorithm obtained in the previous study is unusable in practice because of a big hidden constant., SPRINGER INT PUBLISHING AG
Proceedings of the 19th Conference on Implementation and Application of Automata (CIAA 2016), Seoul, LNCS 9705, 2016年07月19日, ［査読有り］ - Development of a Unified Production System for Various Types of Accessible Textbooks
Takuya Takaira; Yoshiaki Tani; and Akio Fujiyoshi, 責任著者, This paper presents a unified production system for various types of accessible textbooks. For students with print disabilities, it is important that various types of accessible textbooks should be available so that students can choose one as appropriate. The unified production system enables us to prepare production master data of several types of accessible textbooks at a time., SPRINGER INT PUBLISHING AG
Proceedings of the 15th International Conference on Computers Helping People with Special Needs (ICCHP 2016), Linz, LNCS 9758, 2016年07月14日, ［査読有り］ - A Simple Viewer and Editor of Sound-Embedded PDF for Elementary School Students with Print Disabilities
Yoshiaki Tani; Takuya Takaira; and Akio Fujiyoshi, 責任著者, This paper introduce is a simple viewer and editor of sound-embedded PDF that is suitable for elementary school students with print disabilities. These days, a lot of teaching materials are created in PDF. For student with print disabilities, the use of sound-embedded PDF was proposed. However, the production of documents in sound-embedded PDF was difficult for most teachers and students because complex tasks with expensive application software were necessary. Therefore, a simple viewer and editor of sound-embedded PDF was developed., SPRINGER INT PUBLISHING AG
Proceedings of the 15th International Conference on Computers Helping People with Special Needs (ICCHP 2016), Linz, LNCS 9758, 2016年07月13日, ［査読有り］ - Development of a Semiautomatic Production System for Efficient Production of Multimodal Textbooks
Takuya Takaira; Yoshiaki Tani; Akio Fujiyoshi, 責任著者
Proceedings of The 3rd International Workshop on Digitization and E-Inclusion in Mathematics and Science 2016 (DEIMS2016), 2016年02月05日, ［査読有り］ - Trial Production of Sound-Embedded Accessible PDF
Yoshiaki Tani; Takuya Takaira; Akio Fujiyoshi, 責任著者
Proceedings of The 3rd International Workshop on Digitization and E-Inclusion in Mathematics and Science 2016 (DEIMS2016), 2016年02月05日, ［査読有り］ - Recognition of Condensed Structural Formulas of Chemical Compounds Using a Formal Grammar
Fumiyasu Sato; Akio Fujiyoshi, 責任著者
Proceedings of The 3rd International Workshop on Digitization and E-Inclusion in Mathematics and Science 2016 (DEIMS2016), 2016年02月04日, ［査読有り］ - Paper-based textbooks with audio support for print-disabled students
Akio Fujiyoshi; Akiko Ohsawa; Takuya Takaira; Yoshiaki Tani; Mamoru Fujiyoshi; Yuko Ota, Utilizing invisible 2-dimensional codes and digital audio players with a 2-dimensional code scanner, we developed paper-based textbooks with audio support for students with print disabilities, called 'multimodal textbooks.' Multimodal textbooks can be read with the combination of the two modes: 'reading printed text' and 'listening to the speech of the text from a digital audio player with a 2-dimensional code scanner.' Since multimodal textbooks look the same as regular textbooks and the price of a digital audio player is reasonable (about 30 euro), we think multimodal textbooks are suitable for students with print disabilities in ordinary classrooms., IOS Press
Studies in Health Technology and Informatics, 2015年, ［査読有り］ - Recognition of Labeled Multidigraphs by Spanning Tree Automata
Akio Fujiyoshi, In this paper, we study tree automata recognizing labeled multidigraphs. We define that a labeled multidigraph is accepted by a tree automaton if and only if the graph has a spanning tree accepted by the tree automaton. We call this automaton a spanning tree automaton. The membership problem of labeled multidigraphs for a spanning tree automaton is NP-complete because the Hamiltonian path problem can be easily reduced to it. However, it will be shown that the membership problem is solvable in linear time for graphs of bounded tree-width., SPRINGER-VERLAG BERLIN
Proceedings of the 19th Conference on Implementation and Application of Automata (CIAA 2014), Giessen, LNCS 8587, 2014年08月02日, ［査読有り］ - Development of Synchronized CUI and GUI for Universal Design Tactile Graphics Production System BPLOT3
Mamoru Fujiyoshi; Akio Fujiyoshi; Akiko Osawa; Yusuke Kuroda; Yuta Sasaki, Synchronized CUI and GUI are developed for the universal design tactile graphics production system BPLOT3. BPLOT is the first tactile graphics production system for the blind that enables the blind to produce tactile graphics by themselves. With the new synchronized CUI and GUI of BPLOT3, the blind and the sighted can collaboratively produce tactile graphics. Proofreading of tactile graphics by a blind person is necessary in order to produce elaborate tactile graphics which can be used in textbooks or questions of entrance examinations. Because a blind person can modify tactile graphics by himself with BPLOT3, it will be a powerful tool., SPRINGER-VERLAG BERLIN
Proceedings of the 14th International Conference on Computers Helping People with Special Needs (ICCHP 2014), Paris, LNCS 8548, 2014年07月10日, ［査読有り］ - Development of Multimodal Textbooks with Invisible 2-Dimensional Codes for Students with Print Disabilities
Akio Fujiyoshi; Mamoru Fujiyoshi; Akiko Ohsawa; Yuko Ota, 筆頭著者, Utilizing invisible 2-dimensional codes and digital audio players with a 2-dimensional code scanner, we developed a new type of textbooks for students with print disabilities, called "multimodal text-books." Multimodal textbooks can be read with the combination of the two modes: "reading printed text" and "listening to the speech of the text from a digital audio player with a 2-dimensional code scanner." Since a multimodal textbook looks the same as a regular textbook and the price of a digital audio player is reasonable (about 30 euro), we think multimodal textbooks are suitable for students with print disabilities in ordinary classrooms., SPRINGER-VERLAG BERLIN
Proceedings of the 14th International Conference on Computers Helping People with Special Needs (ICCHP 2014), Paris, LNCS 8548, 2014年07月09日, ［査読有り］ - 文字認知障害者のための2次元コード方式のリスニングテストシステムの開発
藤芳衛; 大澤彰子; 小山田寛史; 薬師寺駿介; 青松利明; 澤崎陽彦; 藤芳明生, 国立大学入学者選抜研究連絡協議会
大学入試研究ジャーナル, 2013年03月, ［査読有り］ - Development of New Auditory Testing Media with Invisible 2-Dimensional Codes for Test-Takers with Print Disabilities
Mamoru Fujiyoshi; Akio Fujiyoshi; Akiko Ohsawa; Toshiaki Aomatsu; Haruhiko Sawazaki, Utilizing invisible 2-dimensional codes and digital audio players with a 2-dimensional code scanner, we developed two types of new auditory testing media. The result of experimental evaluation of the new testing media shows that, in addition to existing special accommodations such as large-print-format test and braille-format test, the introduction of the new auditory testing media enables all test-takers with print disabilities, including the newly blind, the severely partially sighted and the dyslexic, to take the National Center Test for University Admissions., SPRINGER-VERLAG BERLIN
Proceedings of the 13th International Conference on Computers Helping People with Special Needs (ICCHP 2012), Linz, LNCS 7382, 2012年07月11日, ［査読有り］ - Tree Automata Moving Freely on Undirected Graphs
Akio Fujiyoshi
Proceedings of the 1st International Workshop on Trends in Tree Automata and Tree Transducers (TTATT 2012), Nagoya, 2012年06月02日, ［査読有り］ - Evaluation of Two Types of New Auditory Testing Media with Paper Booklets and Digital Audio Players for the Active Reading of Test-Takers with Print Disabilities
Mamoru Fujiyoshi; Kazunori Minatani; Akiko Osawa; Akio Fujiyoshi; Hirofumi Oyamada; Shunsuke Yakushiji; Yuya Arai; Kosuke Shimizu; Tatsuya Shimada; Toshiaki Aomatsu; Haruhiko Sawazaki
Proceedings of The International Workshop on Digitization and E-Inclusion in Mathematics and Science 2012 (DEIMS12), 2012年02月09日, ［査読有り］ - Inconsistency-Driven Chemical Graph Construction in ChemInfty
Karzel Daniel; Koji Nakagawa; Akio Fujiyoshi; Masakazu Suzuki, This paper proposes a new method of chemical graph construction which is implemented in the chemical structure recognition and correction system ChemInfty (www.inftyproject.org/en/ChemInfty/). The system starts with recognizing the graphical elements of the chemical structure such as lines and characters. In the chemical graph construction phase the validity of the chemical graph is checked to detect inconsistencies. The graph construction starts with an empty chemical graph using only the graphical components. After a solving cycle the system returns a partially solved graph which can be checked for inconsistencies again. This results in a flexible, cycle based and inconsistency-driven graph construction. Furthermore the system introduces semi-automated correction allowing users to interact with the graph-construction cycles. © 2013 Springer-Verlag.
Proceedings of the Ninth International Workshop on Graphics Recognition (GREC 2011), LNCS 7423, 2011年09月15日, ［査読有り］ - Robust Method of Segmentation and Recognition of Chemical Structure Images in ChemInfty
Akio Fujiyoshi; Koji Nakagawa; Masakazu Suzuki, 筆頭著者
Pre-proceedings of the Ninth International Workshop on Graphics Recognition (GREC 2011), 2011年09月15日, ［査読有り］ - 読字障害者および重度の弱視者のための文字と音声のマルチモーダル問題の開発
藤芳衛; 南谷和範; 藤芳明生; 青松利明; 澤崎陽彦, 大学入試センター
大学入試研究ジャーナル, 2011年03月, ［査読有り］ - Minimum Spanning Tree Problem with Label Selection
Akio Fujiyoshi; Masakazu Suzuki, 筆頭著者, In this paper, we study the minimum spanning tree problem with label selection, that is, the problem of finding a minimum spanning tree of a vertex-labeled graph where the weight of each edge may vary depending on the selection of labels of vertices at both ends. The problem is especially important as the application to mathematical OCR. It is shown that the problem is NP-hard. However, for the application to mathematical OCR, it is sufficient to deal with only graphs with small tree-width. In this paper, a linear-time algorithm for series-parallel graphs is presented. Since the minimum spanning tree problem with label selection is closely related to the generalized minimum spanning tree problem, their relation is discussed., IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
IEICE Transactions on Information and Systems, 2011年02月, ［査読有り］ - A Variation of the Minimum spanning Tree Problem for the Application to Mathematical OCR
Akio Fujiyoshi; Masakazu Suzuki, 筆頭著者, In this paper, we introduce a variation of the minimum spanning tree problem for the application to mathematical OCR. The problem is obtained from the original minimum spanning tree problem by importing the notions of "candidate selection" and "link-label selection." It is shown that the problem is NP-hard. However, we find that, for the application to mathematical OCR, it is sufficient to deal with only a class of graphs that is recursively defined with some graphrewriting rules. For the class of graphs, it is shown that the problem can be solved in linear-time in the number of vertices of a graph., Faculty of Mathematics, Kyushu University
Journal of Math-for-Industry, 2010年10月, ［査読有り］ - Development of Tactile Graphics Production Software for Three-Dimensional Projections
Mamoru Fujiyoshi; Takeshi Kaneko; Akio Fujiyoshi; Susumu Oouchi; Kenji Yamazawa; Yuji Ikegami; Yasunari Watanabe; Yoshinori Teshima, In this paper, we introduce tactile graphics production software for three-dimensional projections. A blind person can use this software without assistance from the sighted and produce tactile graphics of three-dimensional projections. With this software, we want to study the limitation of tactile recognition of projections and improve the guidelines of teaching projections., SPRINGER-VERLAG BERLIN
Proceedings of the 12th International Conference on Computers Helping People with Special Needs (ICCHP 2010), Vienna, LNCS 6180, 2010年07月15日, ［査読有り］ - New Testing Method for the Dyslexic and the Newly Blind with a Digital Audio Player and Document Structure Diagrams
Mamoru Fujiyoshi; Akio Fujiyoshi; Toshiaki Aomatsu, 責任著者, A new testing method with a digital audio player and document structure diagrams is developed for the dyslexic and the newly blind, who have difficulties with reading in braille or print. Since documents in the National Center Test for University Admissions are very long and have very complicated document structure, ordinary auditory testing media. such as human reader or audio cassette are not appropriate. The new testing method can be administrated only with a digital audio player with 2-dimensional code reader and sheets of paper on which document structure diagrams and corresponding invisible 2-dimensional codes are printed., SPRINGER-VERLAG BERLIN
Proceedings of the 12th International Conference on Computers Helping People with Special Needs (ICCHP 2010), Vienna, LNCS 6179, 2010年07月14日, ［査読有り］ - Recognition of Directed Acyclic Graphs by Spanning Tree Automata
Akio Fujiyoshi
Theoretical Computer Science, 2010年07月, ［査読有り］ - Ground-Truthed Dataset of Chemical Structure Images in Japanese Published Patent Applications
Koji Nakagawa; Akio Fujiyoshi; Masakazu Suzuki, This paper presents a ground-truthed dataset of chemical structure images in Japanese published patent applications. The ground-truthed dataset of 5576 chemical images was made in the following manner. First, the graphical structure of chemical images was recognized by a chemical structure recognition software program developed by our group. Then, with a newly developed correction GUI, the graphical structure dataset was corrected manually. Second, the graphical structure dataset was converted into another dataset representing the chemical structure. The chemical structure dataset was also corrected manually by another newly developed correction GUI. The result of statisticalanalysis of chemical structure images contained in the Japanese published patent applications is also presented in this paper. Although we concentrated on Japanese published patent applications, this dataset includes a wide range of chemical structure images. Copyright 2010 ACM.
Proceedings of the 9th IAPR International Workshop on Document Analysis Systems (DAS 2010), Boston, 2010年06月10日, ［査読有り］ - Robust Recognition Method of Chemical Structure Images for Japanese Published Patent Applications
Akio Fujiyoshi; Koji Nakagawa; Masakazu Suzuki, 筆頭著者
Proceedings of the 9th IAPR International Workshop on Document Analysis Systems (DAS 2010), Boston, 2010年06月10日, ［査読有り］ - Grammatical verification for mathematical formula recognition based on context-free tree grammar
Akio Fujiyoshi; Masakazu Suzuki; Seiichi Uchida, This paper proposes the use of a formal grammar for the verification of mathematical formulae for a practical mathematical OCR system. Like a C compiler detecting syntax errors in a source file, we want to have a verification mechanism to find errors in the output of mathematical OCR. A linear monadic context-free tree grammar (LM-CFTG) is employed as a formal framework to define "well-formed" mathematical formulae. A cubic time parsing algorithm for LM-CFTGs is presented. For the purpose of practical evaluation, a verification system for mathematical OCR is developed, and the effectiveness of the system is demonstrated by using the ground-truthed mathematical document database InftyCDB-1 and a misrecognition database newly constructed for this study. © 2010 Birkhäuser Verlag Basel/Switzerland.
Mathematics in Computer Science, 2010年05月, ［査読有り］ - A New Audio Testing Method with Document Structure Tables for the Dyslexic and the Newly Blind
Mamoru Fujiyoshi; Akio Fujiyoshi; Toshiaki Aomatsu, 責任著者
Proceedings of the workshop on E-inclusion in mathematics and Science 2009 (WEIMS 2009), Fukuoka, 2009年12月12日, ［査読有り］ - Syntactic detection and correction of misrecognitions in mathematical OCR
Akio Fujiyoshi; Masakazu Suzuki; Seiichi Uchida, 筆頭著者, This paper proposes a syntactic method for detection and correction of misrecognized mathematical formulae for a practical mathematical OCR system. Linear monadic context-free tree grammar (LM-CFTG) is employed as a formal framework to define syntactically acceptable mathematical formulae. For the purpose of practical evaluation, a verification system is developed, and the effectiveness of the method is demonstrated by using the ground-truthed mathematical document database InftyCDB-1 and a misrecognition database newly constructed for this study. A satisfactory number of misrecognitions are detected and delivered to the correction process. © 2009 IEEE.
Proceedings of the 10th International Conference on Document Analysis and Recognition (ICDAR 2009), Barcelona, 2009年07月30日, ［査読有り］ - Statistical classification of spatial relationships among mathematical symbols
Walaa Aly; Seiichi Uchida; Akio Fujiyoshi; Masakazu Suzuki, In this paper, a statistical decision method for automatic classification of spatial relationships between each adjacent pair is proposed. Each pair is composed of mathematical symbols and/or alphabetical characters. Special treatment of mathematical symbols with variable size is important. This classification is important to recognize an accurate structure analysis module of math OCR. Experimental results on a very large database showed that the proposed method worked well with an accuracy of 99.57% by two important geometric feature relative size and relative position. © 2009 IEEE.
Proceedings of the 10th International Conference on Document Analysis and Recognition (ICDAR 2009), Barcelona, 2009年07月30日, ［査読有り］ - Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata
Akio Fujiyoshi, In this paper, we study tree automata for directed acyclic graphs (DAGs). We define the movement of a tree automaton oil a DAG so that a DAG is accepted by a tree automaton if and only if a DAG has a spanning tree accepted by a tree automaton. The NP-completeness of the membership problem of DAGs for a tree automaton is shown, and a linear-time recognition algorithm of series-parallel graphs for a tree automaton is presented., SPRINGER-VERLAG BERLIN
Proceedings of the 14th Conference on Implementation and Application of Automata (CIAA 2009), Sydney, LNCS 5642, 2009年07月15日, ［査読有り］ - Linear-Time Recognizable Classes of Tree Languages by Deterministic Linear Pushdown Tree Automata
Akio Fujiyoshi, In this paper, we study deterministic linear pushdown tree automata (deterministic L-PDTAs) and some variations. Since recognition of an input tree by a deterministic L-PDTA can be done in linear time, deterministic L-PDTAs are applicable to many kinds of applications. A strict hierarchy will be shown among the classes of tree languages defined by a variety of deterministic L-PDTAs. It will be also shown that deterministic L-PDTAs are weakly equivalent to nondeterministic L-PDTAs., IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
IEICE Transactions on Information and Systems, 2009年02月, ［査読有り］ - Verification of Mathematical Formulae Based on a Combination of Context-Free Grammar and Tree Grammar
Akio Fujiyoshi; Masakazu Suzuki; Seiichi Uchida, 筆頭著者, This paper proposes the use of a formal grammar for the verification of mathematical formulae for a practical mathematical OCR. system. Like a C compiler detecting syntax errors in a source file, we, rant to have a verification mechanism to find errors in the output of mathematical OCR. Linear monadic context-free tree grammar (LM-CFTG) was employed as a formal framework to define "well-formed" mathematical formulae. For the purpose of practical evaluation, a verification system for mathematical OCR was developed, and the effectiveness of the system was demonstrated by rising the ground-truthed mathematical document database INIFTY CDB-1., SPRINGER-VERLAG BERLIN
Proceedings of the 7th International Conference on Mathematical Knowledge Management (MKM 2008), Birmingham, LNCS(LNAI) 5144, 2008年07月28日, ［査読有り］ - Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees
Akio Fujiyoshi, SPRINGER-VERLAG BERLIN
Proceedings of the 13th International Conference on Implementation and Application of Automata (CIAA 2008), San Francisco, LNCS 5148, 2008年07月21日, ［査読有り］ - The Development of a Universal Design Tactile Graphics Production System BPLOT2
Mamoru Fujiyoshi; Akio Fujiyoshi; Nobuyuki Ohtake; Katsuhito Yamaguchi; Yoshinori Teshima, 責任著者, We introduce a new universal design tactile graphics production sYstem: BPLOT2. With BPLOT2, blind persons and sighted persons can sliare resources and cooperativelY draxv tactile graphics to be utilized in braille textbook,,' and teaching materials. Present tactile graphics design applications have only GUI (Graphical User Interface) with the need for IHOLIse operations and thus are not usable by blind persons. Equally inconvenient, our seIf-supporting tactile graphics procluction sYsteni for the blind. BPLOT. Haas only CUI (Character User Interface), so BPLOT is not popular aniong the sighted. Therefore, Nve implemented GUI on 13PLOT and realized universal design on 13PLOT2., SPRINGER-VERLAG BERLIN
Proceedings of the 11th International Conference on Computers Helping People with Special Needs (ICCHP 2008), Linz, LNCS 5105, 2008年07月09日, ［査読有り］ - 大学入試センター試験のユニバーサル・デザイン -学習障害者と中途失明者の受験を可能にするデジタル音声問題出題システムの評価-
藤芳衛; 藤芳明生; 澤崎陽彦, 国立大学入学者選抜研究連絡協議会
大学入試研究ジャーナル, 2007年03月, ［査読有り］ - Application of the CKY Algorithm to Recognition of Tree Structures for Linear, Monadic Context-Free Tree Grammars
Akio Fujiyoshi, In this paper, a recognition algorithm for the class of tree languages generated by linear, monadic context-free tree grammars (LM-CFTGs) is proposed. LM-CFTGs define an important class of tree languages because LM-CFTGs are weakly equivalent to tree adjoining grammars (TAGs). The algorithm uses the CKY algorithm as a subprogram and recognizes whether an input tree can be derived from a given LM-CFTG in O(n(4)) time, where n is the number of nodes of the input tree., IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
IEICE Transactions on Information and Systems, 2007年02月, ［査読有り］ - Analogical Conception of Chomsky Normal Form and Greibach Normal Form for Linear, Monadic Context-Free Tree Grammars
Akio Fujiyoshi, This paper presents the analogical conception of Chomsky normal form and Greibach normal form for linear, monadic context-free tree grammars (LM-CFTGs). LM-CFTGs generate the same class of languages as four well-known mildly context-sensitive grammars. It will be shown that any LM-CFTG can be transformed into equivalent ones in both normal forms. As Chomsky normal form and Greibach normal form for context-free grammars (CFGs) play a very important role in the study of formal properties of CFGs, it is expected that the Chomsky-like normal form and the Greibach-like normal form for LM-CFTGs will provide deeper analyses of the class of languages generated by mildly context-sensitive grammars., IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
IEICE Transactions on Information and Systems, 2006年12月, ［査読有り］ - A New Audio Testing System for the Newly Blind and the Learning Disabled to Take the National Center Test for University Admissions
Mamoru Fujiyoshi; Akio Fujiyoshi, 責任著者, A new audio testing system was developed for the newly blind and the learning disabled (dyslexia) who have difficulties with reading braille or print-format tests. The system enables them to take the National Center Test for University Admissions. The system was developed primarily on a tablet PC and presents not only speech sound but also document structures and figures from the test., SPRINGER-VERLAG BERLIN
Proceedings of the 10th International Conference on Computers Helping People with Special Needs (ICCHP 2006), Linz, LNCS 4061, 2006年07月12日, ［査読有り］ - 司法試験短答式試験のユニバーサル・デザイン -弱視受験者に対する試験時間延長率の推定と拡大文字問題冊子の改善-
藤芳衛; 藤芳明生; 柿澤敏文, 国立大学入学者選抜研究連絡協議会
大学入試研究ジャーナル, 2006年03月, ［査読有り］ - Deterministic Recognition of Trees Accepted by a Linear Pushdown Tree Automaton
Akio Fujiyoshi; Ikuo Kawaharada, 筆頭著者, In this paper, a deterministic recognition algorithm for the class of tree languages accepted by (nondeterministic) linear pushdown tree automata (L-PDTAs) is proposed. L-PDTAs accept an important class of tree languages since the class of their yield languages coincides with the class of yield languages generated by tree adjoining grammars (TAGs). The proposed algorithm is obtained by combining a bottom-up parsing procedure on trees with the CKY (Cocke-Kasami-Younger) algorithm. The running time of the algorithm is O(n(4)), where n is the number of nodes of an input tree., SPRINGER-VERLAG BERLIN
Proceedings of the 10th International Conference on Implementation and Application of Automata (CIAA 2005), Sophia Antipolis, LNCS 3845, 2005年06月27日, ［査読有り］ - 司法試験短答式試験のユニバーサル･デザイン,―点字試験の試験時間延長率の推定と音声試験の設計―
藤芳衛,藤芳明生, 国立大学入学者選抜研究連絡協議会
大学入試研究ジャーナル, 2005年03月, ［査読有り］ - Linearity and Nondeletion on Monadic Context-Free Tree Grammars
Akio Fujiyoshi
Information Processing Letters, 2005年01月, ［査読有り］ - Restrictions on Monadic Context-Free Tree Grammars
Akio Fujiyoshi
Proceedings of the 20th International Conference on Computational Linguistics (COLING-04), Geneva, 2004年08月23日, ［査読有り］ - Epsilon-Free Grammars and Lexicalized Grammars that Generate the Class of the Mildly Context-Sensitive Languages
Akio Fujiyoshi
Proceedings of the 7th International Workshop on Tree Adjoining Grammar and Related Formalisms (TAG+7), Vancouver, 2004年05月22日, ［査読有り］ - The Development of Unified Japanese Braille Code Based on the Unicode
Mamoru Fujiyoshi; Katsuhito Yamaguchi; Toru Ishida; Haruhiko Sawazaki; Nobuyuki Ohtake; Akio Fujiyoshi
Proceedings of the International Council on English Braille, the Third General Assembly, Toronto, 2004年04月01日, ［査読有り］ - 単一パラメータマクロ木変換機とSpine Grammarの関係
藤芳明生, Spine Grammar[1]は制限された文脈自由木文法[2]であり,自然言語学の分野において広く研究され高速な認識アルゴリズム[3],[4]が知られているTree Adjoining Grammar[5],[6]と同じ文字列言語のクラスを生成することが知られた木文法である.Spine Grammarの生成する木言語のクラスは,非終端記号のランクが1または0であるような文脈自由木文法の生成する木言語のクラスと一致することや,線形・プッシュダウン木オートマトン[1]が受理する木言語のクラスとも一致することが知られている.しかし,木変換機との関連については,まだ研究されていなかった.本研究は,完全決定性・線形・無削除という三つの制限とともに,単一パラメータと呼ぶ制限を満たすマクロ木変換機の生成する表層集合のクラスは,Spine Grammarの生成する木言語のクラスと一致することを証明するものである., 一般社団法人電子情報通信学会
電子情報通信学会論文誌, 2002年02月, ［査読有り］ - Estimating Testing Time Extension Ratios for Students with Disabilities from Item Cumulative Curves
Mamoru Fujiyoshi; Akio Fujiyoshi, 責任著者, This study was conducted to define item cumulative score ratio curves and item cumulative completion ratio curves and to propose a new method to estimate fair extension ratios of testing time for students with disabilities from these curves. The proposed method estimates extension ratios of testing time of regular tests under the time-limit method from experimentally collected test data utilizing the work-limit method. In this experiment we found that for students with visual disabilities, the present extension ratio of testing time at the National Center Test for University Admissions in Japan is fair in Mathematics and English and that in order to improve the present testing method of the National Center Test, further extension of testing time is necessary for some subjects with a large amount of reading questions, such as Japanese., SPRINGER-VERLAG TOKYO
Proceedings of the International Meeting of the Psychometric Society (IMPS2001), Osaka, New Developments in Psychometrics, Springer, 2001年07月18日, ［査読有り］ - Comparability of Paper-and-Pencil Test and Computer-Based Test in Terms of Distributions of Completion Time and Score
Mamoru Fujiyoshi; Akio Fujiyoshi; Tomoichi Ishizuka
National Center for University Entrance Examinations Research Bulletin, 2001年03月, ［査読有り］ - 順序機械の多項式時間推論アルゴリズム
高橋克彦,藤芳明生,笠井琢美, 本論文は, 未知なるMoore型順序機械の入出力例からMoore型順序機械を推論するアルゴリズムを述べる.この推論アルゴリズムが出力する仮説は, 与えられた入出力例に矛盾しない非決定性のMoore型順序機械であり, かつ仮説の更新時間が入出力例の長さの総和の多項式時間になることを示す.更にこの推論アルゴリズムが, Moore型順序機械を極限において同定することを, Moore型順序機械の構造から定義されるcomplete入出力例を用いることにより示す., 一般社団法人電子情報通信学会
電子情報通信学会論文誌, 2001年01月, ［査読有り］ - Spinal-Formed Context-Free Tree Grammars
Akio Fujiyoshi; Takumi Kasai, 筆頭著者, In this paper we introduce a restricted model of context-free tree grammars called spine grammars, and study their formal properties including considerably simple normal forms. Recent research on natural languages has suggested that formalisms for natural languages need to generate a slightly larger class of languages than context-free grammars, and for that reason tree adjoining grammars have been widely studied relating them to natural languages. It is shown that the class of string languages generated by spine grammars coincides with that of tree adjoining grammars. We also introduce accepters called linear pushdown tree automata, and show that linear pushdown tree automata accept exactly the class of tree languages generated by spine grammars. Linear pushdown tree automata are obtained from pushdown tree automata with a restriction on duplicability for the pushdown stacks., SPRINGER VERLAG
Theory of Computing Systems, 2000年01月, ［査読有り］ - Multi-Phase Tree Transformations
Akio Fujiyoshi; Takumi Kasai, 筆頭著者, In this paper, we introduce a computational model of a tree transducer called a bi-stage transducer and study its properties. We consider a mapping on trees realized by composition of any sequence of top-down transducers and bottom-up transducers, and call such a mapping a multi-phase tree transformation. We think a multi-phase tree transformation is sufficiently powerful. It is shown that in the case of rank-preserving transducers, a multi-phase tree transformation is realized by a bi-stage transducer., IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science, 1997年04月, ［査読有り］
MISC
書籍等出版物
講演・口頭発表等
- ゲームデザインによる読み書き障害児向けインタラクティブ教科書アプリの開発
芦田千頼; 藤芳明生
情報アクセシビリティをめぐる諸問題に関する研究集会, 2025年02月21日
20250221, 20250222 - 図に配慮した音声出題方式の提案と関数グラフの音声説明の自動生成
佐藤瑠美; 豊田莉子; 藤芳明生
情報アクセシビリティをめぐる諸問題に関する研究集会, 2025年02月21日
20250221, 20250222 - 機械学習に組合せ最適化アルゴリズムを導入したPDF文書の読み順序推定
水口遥渡; 藤ヶ谷優磨; 新井涼太; 藤芳明生
情報アクセシビリティをめぐる諸問題に関する研究集会, 2025年02月21日
20250221, 20250222 - ChatGPTを活用した視覚障害者に対する理系科目の学習支援の可能性
越川颯; 薗部駿之介; 志田優海; 藤芳明生
日本特殊教育学会 第62回大会, 2024年09月06日
20240906, 20240909 - 読みに困難を示す児童に対する「ペンでタッチすると読める音声付教科書」の活用効果に関する研究
山田美優; 藤芳明生; 細川美由紀; 原田浩司
日本特殊教育学会 第62回大会, 2024年09月07日
20240906, 20240908 - 視覚障害者の書字をサポートするための字体確認ソフトウェアの開発
薗部駿之介; 志田優海; 越川颯; 藤芳明生
日本特殊教育学会 第62回大会, 2024年09月06日
20240906, 20240908 - Graph Linear Notations with Regular Expressions
三村 廉; 宮部 恭兵; 宮本 賢伍; 藤芳 明生
冬のLAシンポジウム, 2023年01月31日
20230130, 20230201 - 読みの力を育てる全校支援システムの構築 ーアセスメントと音声付き教科書の活用を通してー
原田 浩司、藤芳 明生、坂尻 正次、大西 淳児
日本LD学会第31回大会, 2022年10月29日
20221029, 20221030 - 文字列シーケンスの最短マッチング
宮部 恭兵; 三村 廉; 宮本 賢伍; 藤芳 明生
冬のLAシンポジウム, 2022年02月02日
20220201, 20220203 - 音声教材とICT活用による教科書アクセシビリティ保障の現状と課題
村上 博行、風早 史子、藤堂 栄子、藤芳 明生、山下 祥代、髙橋 利恵、長田 江里
日本LD学会第30回大会, 2021年12月10日
20211210, 20211212 - 数式OCRにおける文法解析の有効性について
藤芳明生
科学文書の電子処理とアクセシビリティ, 2009年02月15日 - Tree Grammarを用いた数式構造の検証の提案
藤芳明生
科学文書の電子処理とアクセシビリティ, 2008年02月17日 - 試験のユニバーサル・デザイン－出題文書量による解答所要時間の予測－
藤芳衛,藤芳明生
日本テスト学会 第５回大会, 2007年08月30日, 日本テスト学会 - 決定性・線形プッシュダウン木オートマトン
藤芳明生
夏のＬＡシンポジウム, 2007年07月18日 - 決定性・線形プッシュダウン木オートマトンによる木構造の線形時間認識
藤芳明生
電子情報通信学会コンピュテーション研究会, 2007年06月29日 - ユニバーサルデザインによる視覚障害者用触読図作図システムの開発
藤芳衛、藤芳明生、大武信之、山口雄仁
電子情報通信学会技術研究報告, 2007年03月 - 過去問を利用した大学入試センター試験・英語の適応型コンピュータ・テストの試作
藤芳明生; 藤芳衛
日本テスト学会 第４回大会, 2006年08月27日 - LM-CFTGが生成する木言語の下降型認識と上昇型認識の比較
藤芳明生
夏のＬＡシンポジウム, 2006年08月04日 - テストのユニバーサル・デザイン－学習障害者と中途失明者の受験を可能にする大学入試センター試験用音声問題出題システムの開発－
藤芳衛; 堀江祥仙; 藤芳明生; 石崎喜晴
電子情報通信学会技術研究報告, 2006年03月 - 単項文脈自由木文法の様々なサブクラスについて
藤芳明生
夏のLAシンポジウム, 2004年07月15日 - Lexicalization and Greibach Normal Form for Spine Grammars
藤芳明生
夏のLAシンポジウム, 2003年07月16日
共同研究・競争的資金等の研究課題
