JaLCDOI 10.18926/14086
FullText URL Mem_Fac_Eng_OU_41_1_63.pdf
Author Kanatani, Kenichi| Sugaya, Yasuyuki|
Abstract The convergence performance of typical numerical schemes for geometric fitting for computer vision applications is compared. First, the problem and the associated KCR lower bound are stated. Then, three well known fitting algorithms are described: FNS, HEIV, and renormalization. To these, we add a special variant of Gauss-Newton iterations. For initialization of iterations, random choice, least squares, and Taubin’s method are tested. Numerical simulations and real image experiments and conducted for fundamental matrix computation and ellipse fitting, which reveals different characteristics of each method.
Publication Title Memoirs of the Faculty of Engineering, Okayama University
Published Date 2007-01
Volume volume41
Issue issue1
Start Page 63
End Page 72
ISSN 0475-0071
language 英語
File Version publisher
NAID 120002308585
JaLCDOI 10.18926/14083
FullText URL Mem_Fac_Eng_OU_41_1_44.pdf
Author Maeno, Ryota| Konishi, Masami| Imai, Jun|
Abstract Petri net model is a frequently-used versatile tool which can represent a widely discrete event system. However, when the scale of the system becomes large, the calculation time for solving optimal problem (optimal firing sequence problem) is markedly increased. In this paper, we propose an approximation method that achieves the efficiency improvement of the solution by decomposing the Petri net for solving the optimal firing sequence problem. A timed Petri Net is decomposed into several subnets in which the optimal firing sequence for each subnet is solved by Dijkstra’s algorithm in polynomial computational complexity. The effectivity of the proposed method is verified by numerical experiments for the flowshop schedule problem.
Publication Title Memoirs of the Faculty of Engineering, Okayama University
Published Date 2007-01
Volume volume41
Issue issue1
Start Page 44
End Page 51
ISSN 0475-0071
language 英語
File Version publisher
NAID 120002308128
JaLCDOI 10.18926/14082
FullText URL Mem_Fac_Eng_OU_41_1_31.pdf
Author Hamana, Ryohei| Konishi, Masami| Imai, Jun|
Abstract Various kind of productions are made in semiconductor factories, where it employs the production system with multiprocess and multiple Automated Guided Vehicles(AGVs) for transportation. It is difficult to optimize planning of production and transportation simultaneously because of the complicated flow of semifinished products. This paper describes the formulations of production scheduling and transportation routing, and algorithm for simultaneous optimization of plannings by using logic cuts. The entire problem is decomposed to the master problem and the sub problem. If it derives the infeasible solutions, new constraints are added to the master problem to eliminate the solution area including infeasible solutions. The results of about optimality and computation time by using CPLEX solver are shown compared with conventional decomposition method to check up effectivity of proposed method in small size problem, and about optimality and computaion time for large scale problem.
Publication Title Memoirs of the Faculty of Engineering, Okayama University
Published Date 2007-01
Volume volume41
Issue issue1
Start Page 31
End Page 43
ISSN 0475-0071
language 英語
File Version publisher
NAID 120002308108
JaLCDOI 10.18926/14081
FullText URL Mem_Fac_Eng_OU_41_1_20.pdf
Author Imamura, Takuji| Konishi, Masami| Imai, Jun|
Abstract In this paper, we propose a simultaneous optimization method for inventory control and production planning problem for a chemical batch plant. The plant consists of blending process, intermediate storage tanks and filling process. In the proposed method, the original problem is decomposed into production planning sub-problem and inventory control sub-problem. Then the decision variables are optimized by alternately solving each sub-problem. The solution of the proposed method is compared with that of centralized optimization method. The effectiveness of the proposed method is investigated from numerical computational results.
Publication Title Memoirs of the Faculty of Engineering, Okayama University
Published Date 2007-01
Volume volume41
Issue issue1
Start Page 20
End Page 30
ISSN 0475-0071
language 英語
File Version publisher
NAID 120002308626
JaLCDOI 10.18926/14065
FullText URL Mem_Fac_Eng_OU_42_91.pdf
Author Ryohei, Hamana| Konishi, Masami| Imai, Jun|
Abstract Various kind of productions are made in semiconductor fabrications, where it employs the production system with multiprocesses and multiple Automated Guided Vehicles(AGVs) for transportation. It is difficult to optimize planning of production and transportation simultaneously because of the complicated flow of semifinished products. This paper describes the formulations of production scheduling, transportation routing and sequence planning of material handling system, and algorithm for simultaneous optimization of plannings by using solution space reduction and simulated annealing method. In this paper, all production system is decomposed to the production scheduling problem, transportation routing problem by AGVs and sequence planning of material handling system with managing stockers and buffers. Production scheduling problem and transportation routing problem are solved by the optimization algorithm using the decomposition routing problem. Sequence planning of material handling robot problem is solved by the algorithm using simulated annealing method.
Publication Title Memoirs of the Faculty of Engineering, Okayama University
Published Date 2008-01
Volume volume42
Issue issue1
Start Page 91
End Page 103
ISSN 0475-0071
language 日本語
File Version publisher
NAID 120002308279
JaLCDOI 10.18926/14064
FullText URL Mem_Fac_Eng_OU_42_79.pdf
Author Notsu Tadafumi| Konishi, Masami| Imai, Jun|
Abstract The operations of a reactor furnace such as a blast furnace still depend on the experiences and intuitions of skilled operators due to the complexity of internal furnace phenomena and high temperature. There is a great demand for stable operations under the circumstances of a decrease in the number of skilled operators and difficulty in technology inheritance. This paper aims to construct mathematical description for control of a reactor furnace. Further, the linear-quadratic-gaussian control system for a reactor furnace is proposed, which estimates inner furnace temperature distribution using measured data near furnace wall. Temperature distribution of a furnace is controlled based on the estimated inner temperature distribution changing of boundary conditions of a furnace. The practicability of the proposed control method was checked through numerical experiments.
Publication Title Memoirs of the Faculty of Engineering, Okayama University
Published Date 2008-01
Volume volume42
Issue issue1
Start Page 79
End Page 90
ISSN 0475-0071
language 英語
File Version publisher
NAID 120002308624
JaLCDOI 10.18926/14063
FullText URL Mem_Fac_Eng_OU_42_71.pdf
Author Kawase, Koichi| Konishi, Masami| Imai, Jun|
Abstract In this research, Fuzzy control theory is applied to the inventory control of the supply chain between multiple companies. The proposed control method deals with the amount of inventories expressing supply chain between multiple companies. Referring past demand and tardiness, inventory amounts of raw materials are determined by Fuzzy inference. The method that an appropriate inventory control becomes possible optimizing fuzzy control gain by using SA method for Fuzzy control. The variation of uncertain demand is given to the proposal method. Furthermore, the method of forecasting demand and the effectiveness of fuzzy control method are confirmed by numerical experiments. As the results, the proposal method suppressed increase in an unnecessary cost when demand varies.
Publication Title Memoirs of the Faculty of Engineering, Okayama University
Published Date 2008-01
Volume volume42
Issue issue1
Start Page 71
End Page 78
ISSN 0475-0071
language 英語
File Version publisher
NAID 120002308296
JaLCDOI 10.18926/14062
FullText URL Mem_Fac_Eng_OU_42_60.pdf
Author Kikuchi, Junji| Konishi, Masami| Imai, Jun|
Abstract In steel works, molten metals discharged from blast furnace are put into a pan for transportation called torpedo and transported to steel making factory by a locomotive. In molten metals transportation, it becomes issues to prevent temperature drop of molten metals for stable production of down stream plants to shorten transportation time. Therefore it is necessary to make an appropriate plan for molten metals transfer considering the production and the transportation simultaneously. In this paper, molten metals transfer planning method is proposed including production scheduling. That is, torpedo schedule, transfer request assignment and route plan of locomotives are optimized according to each objective.
Publication Title Memoirs of the Faculty of Engineering, Okayama University
Published Date 2008-01
Volume volume42
Issue issue1
Start Page 60
End Page 70
ISSN 0475-0071
language 英語
File Version publisher
NAID 120002308612
JaLCDOI 10.18926/14060
FullText URL Mem_Fac_Eng_OU_42_53.pdf
Author Chai Hong| Totsuji, Hiroo|
Abstract In order to transfer quantum information, the use of spin chains has been proposed and their transfer characteristics have been analyzed. As one of the latter, the maximum of the transfer probability over sufficiently long time period is often considered important and some examples with high maximum values have been given. In these examples, the coupling between neighboring spins are tuned so as to attain high efficiency. In this article, we discuss the effect of noise on the values of coupling constant. As a result, we propose a system where the efficiency is high and also the effect of noise is small.
Publication Title Memoirs of the Faculty of Engineering, Okayama University
Published Date 2008-01
Volume volume42
Issue issue1
Start Page 53
End Page 55
ISSN 0475-0071
language 英語
File Version publisher
NAID 120002308635
JaLCDOI 10.18926/14056
FullText URL Mem_Fac_Eng_OU_42_18.pdf
Author Kanatani, Kenichi| Yasuyuki Sugaya|
Abstract We classify and review existing algorithms for computing the fundamental matrix from point correspondences and propose new effective schemes: 7-parameter Levenberg-Marquardt (LM) search, EFNS, and EFNS-based bundle adjustment. Doing experimental comparison, we show that EFNS and the 7-parameter LM search exhibit the best performance and that additional bundle adjustment does not increase the accuracy to any noticeable degree.
Publication Title Memoirs of the Faculty of Engineering, Okayama University
Published Date 2008-01
Volume volume42
Issue issue1
Start Page 18
End Page 35
ISSN 0475-0071
language 英語
File Version publisher
NAID 120002308468
JaLCDOI 10.18926/14055
FullText URL Mem_Fac_Eng_OU_42_10.pdf
Author Kanatani, Kenichi|
Abstract The author introduced the "geometric AIC" and the "geometric MDL" as model selection criteria for geometric fitting problems. These correspond to Akaike’s "AIC" and Rissanen's "BIC", respectively, well known in the statistical estimation framework. Another criterion well known is Schwarz’ "BIC", but its counterpart for geometric fitting has been unknown. This paper introduces the corresponding criterion, which we call the "geometric BIC", and shows that it is of the same form as the geometric MDL. We present the underlying logical reasoning of Bayesian estimation.
Publication Title Memoirs of the Faculty of Engineering, Okayama University
Published Date 2008-01
Volume volume42
Issue issue1
Start Page 10
End Page 17
ISSN 0475-0071
language 英語
File Version publisher
NAID 120002308447
JaLCDOI 10.18926/14053
FullText URL Mem_Fac_Eng_OU_42_1.pdf
Author Asatani Jun| Koumoto, Takuya| Toru Fujiwara| Tadao Kasami|
Abstract Two typical examples, the (32, 21, 6) and (64, 45, 8) extended code of primitive permuted BCH codes, are considered. The sets of minimum weight codewords are analyzed in terms of Boolean polynomial representation. They are classied by using their split weight structure with respect to the left and right half trellis sections, and for each class, the standard form is presented. Based on the results, we can generate a proper list of the minimum weight codewords of the codes.
Keywords Boolean polynomial representation extended BCH codes minimum weight codewords binary shift invariance property
Publication Title Memoirs of the Faculty of Engineering, Okayama University
Published Date 2008-01
Volume volume42
Issue issue1
Start Page 1
End Page 9
ISSN 0475-0071
language 英語
File Version publisher
NAID 120002308333