Faculty Profiles - FUNABIKI Nobuo

MISC - FUNABIKI Nobuo

Division display 481 - 500 of about 573 ／ All the affair displays >>

通信プロトコルの試験系列生成問題に対するSATアルゴリズム適用法の提案

森亮憲, 大塚裕孝, 舩曵信生, 中田明夫, 東野輝夫

電子情報通信学会論文誌D-I 2002

静的およびモバイル・マルチキャストルーティング問題に対する最適パス選択解法の提案

藤井雅和, 舩曵信生, 横平徳美, 田島滋人, 常村和史, 東野輝夫

電子情報通信学会論文誌A 2002

A proposal of a quasi-solution state evolution algorithm for channel assignment problems

Nobuo Funabiki, Tokumi Yokohira, Toru Nakanishi, Shigeto Tajima, Teruo Higashino

Proc. of 16th international conference on information networking (ICOIN-16) 2002

A Proposal of an Optimal Path Selection Algorithm for Static and Mobile Multicast Routing Problems

FUJII M., FUNABIKI Nobuo, YOKOHIRA Tokumi, TAJIMA Shigeto, TSUNEMURA Kazufumi, HIGASHINO Teruo

IEICE Journal 85 ( 3 ) 730 - 730 2002

Language：English Publisher：The Institute of Electronics, Information and Communication Engineers

In this paper, we present an approximation algorithm called OPSAM (Optimal Path Selection Algorithm for Multicast) for the static multicast routing problem and the newly defined mobile multicast routing problem. Given a graph with the cost and the delay associated to each edge, a data source, a destination set, and the delay time limit, the first problem requires finding a multicast tree such that the total edge cost is not only minimized, but also the delay of any path from source to a destination does not surpass its limit. OPSAM first extracts plural path candidates for each destination to satisfy the delay constraint. Then, it repeatedly selects better paths among candidates so as to find a lowcost tree within a short computation time. The performance of OPSAM is verified through simulations in the random graph model and the Tiers model, where OPSAM is better than the best existing algorithm BSMA, especially for Tiers model instances. The second problem requires finding a sequence of multicast trees which should be modified to follow changes of mobile user locations, such that the sum of the total edge costs and the difference between two consecutive trees is minimized. The simulation results show the performance of OPSAM is better than BSMA.

CiNii Article

CiNii Books

researchmap

通信プロトコルの試験系列生成問題へのSATアルゴリズム適用法の提案

大塚裕孝, 中田明夫, 舩曵信生, 東野輝夫

電子情報通信学会技術研究報告, COMP2001-75 2002

双方向マンハッタンストリートネットワークのノード配置問題に対する階層型近似アルゴリズムの提案

米津正隆, 舩曵信生, 横平徳美, 中西透, 田島滋人, 中田明夫, 東野輝夫

電子情報通信学会技術研究報告, COMP2001-77 2002

An improved lip contour extraction method using deformable template and its automatic threshold adjusting method

YOKOGAWA Yujin, FUNABIKI Nobuo, HIGASHINO Teruo, MORI Yoshihide

IEICE technical report. 101 ( 434 ) 37 - 44 2001.11

Language：Japanese Publisher：The Institute of Electronics, Information and Communication Engineers

The precise extraction of the lip contour has been strongly demanded to plan the surgery and evaluate the recovery for patients with harelips and cleft palates. In this paper, we explain a non-symmetrical deformable template for the lip contour extraction using the template matching method to improve the existing symmetrical deformable template, and the transformation method of the lip contour model into the coordinate system based on the medial canthus point. Then, we propose an algorithm for adjusting the thresholds to extract the hue and value images. Through evaluations using face image samples including patients, we show the accuracy of our proposed method.

CiNii Article

CiNii Books

researchmap

Relaxation of coefficient sensitiveness to performance for neural networks using neuron filter through total coloring problems

Y Takenaka, N Funabiki, T Higashino

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES E84A ( 9 ) 2367 - 2370 2001.9

Language：English Publishing type：Rapid communication, short report, research note, etc. (scientific journal) Publisher：IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG

In this paper we show that the neuron filter is effective for relaxing the coefficient sensitiveness of the Hopfield neural network for combinatorial optimization problems. Since the parameters in motion equation have a significant influence on the performance of the neural network, many studies have been carried out to support determining the value of the parameters. However, not a few researchers have determined the value of the parameters experimentally yet. We show that the use of the neuron filter is effective for the parameter tuning, particularly for determining their values experimentally through simulations.

Web of Science

researchmap

A Proposal of a Lip Contour Approximation Method Using the Function Synthesis

SEKIOKA Tetsuya, YOKOGAWA Yuzin, FUNABIKI Nobuo, HIGASHINO Teruo, YAMADA Tomohiro, MORI Yoshihide

The Transactions of the Institute of Electronics,Information and Communication Engineers. 84 ( 3 ) 459 - 470 2001.3

Language：Japanese Publisher：The Institute of Electronics, Information and Communication Engineers

唇の輪郭線は, 口腔外科における口唇裂症などの術式検討や術後トレースに重要であり, シンプルかつ高精度のモデルでの自動抽出が望まれている.そこで本論文では, 顔画像を入力とし, 前処理, 1次検出, 2次検出の3段階の処理を経て, 唇の輪郭線を関数で合成する手法を提案する.まず前処理では, 顔画像から唇の位置を検出し, おおよその大きさを決定する.次に1次検出ではDeformable templateマッチング法により唇のおおよその輪郭線を探索する.そして2次検出では, 遺伝的プログラミングを用いて置換と分割によって詳細な唇の輪郭線を探索する.本提案手法が従来の動的輪郭モデル(SNAKES)よりも精度, パラメータ数, 探索時間の点で優れていることを一般人の唇, 口唇裂症患者の唇のサンプルに対するシミュレーションにより示す.

CiNii Article

CiNii Books

researchmap

An Optimal Path Selection Algorithm for Static Multicast Routing Problems

FUJII MASAKAZU, FUNABIKI NOBUO, NAKATA AKIO, KITAMICHI JUNJI, HIGASHINO TERUO

IEICE technical report. Theoretical foundations of Computing 100 ( 568 ) 39 - 46 2001.1

Language：Japanese Publisher：The Institute of Electronics, Information and Communication Engineers

In this paper, we present a heuristic algorithm called OPSAM(Optimal Path Selection Algorithm for Multicast)for the static multicast routing problem. Given a directed connected graph with two weights associated to each edge, representing the cost and the delay, a source sending out data, and a set of destinations receiving data, this problem requires to provide a multicast tree such that the total cost of edges in the tree is not only minimized, but also every path delay from the source to a destination is less than its upper limit. OPSAM first extracts plural candidates to each destination that satisfy the delay constraint. Then, it iteratively selects better paths among them so that it can find a low-cost tree within short time. The performance of OPSAM is verified through simulations in two types of network models, where especially, OPSAM shows the high performance for Tiers model instances, which are close to real networks.

CiNii Article

CiNii Books

researchmap

A proposal of a lip contour extraction method using deformable template and a transformation method into coordinate system based the medial canthus point

YOKOGAWA Yuzin, FUNABIKI Nobuo, HIGASHINO Teruo, YAMADA Tomohiro, MORI Yoshihide

Technical report of IEICE. PRMU 100 ( 566 ) 31 - 38 2001.1

Language：Japanese Publisher：The Institute of Electronics, Information and Communication Engineers

Recently, shapes and relative positions of face components such as the lip contour have been intensively studied in areas including medicine and psychology. Actually, the precise extraction of the lip contour and its position has been strongly demanded to plan the surgery and evaluate the recovery for patients with harelips and cleft palates. In this paper, we propose a non-symmetrical deformable template for the lip contour extraction using the template matching method to improve the existing symmetrical deformable template. Besides, we propose the transformation method of the lip contour model into the coorinate system based on the medial canthus point. Through evaluations using face image samples including patients, we show the accuracy of our proposed method.

CiNii Article

CiNii Books

researchmap

Relaxation of coefficient sensitiveness to performance for neural networks using neuron filter through total coloring

Yoichi Takenaka, Nobuo Funabiki, Teruo Higashino

IEICE Transactions on Fundamentals 2001

A global routing technique for wave-steered design methodology

N. Funabiki, A. Singh, A. Mukherjee, M. Marek-Sadowska

Proceedings - Euromicro Symposium on Digital Systems Design: Architectures, Methods and Tools, DSD 2001 430 - 436 2001

Language：English Publisher：Institute of Electrical and Electronics Engineers Inc.

Wave-Steering is a new circuit design methodology to realize high throughput circuits by embedding layout friendly structures in silicon. Latches guarantee correct signal arrival times at the input of synthesized modules and maintain the high throughput of operation. This paper presents a global routing technique for networks of wave-steered blocks. Latches can be distributed along interconnects. Their number depends on net topologies and signal ordering at the inputs of wave steered blocks. here, we route nets using Steiner tree heuristics and determine signal ordering and latch positions on interconnect. The problem of total latch number minimization is solved using SAT formulation. Experimental results on benchmark circuits show the efficiency of our technique. We achieve on average a 40% latch reduction at minimum latency over un-optimized circuits operating at 250 MHz in 0.25 μm CMOS technology.

DOI： 10.1109/DSD.2001.952358

Scopus

researchmap

モバイル・マルチキャストルーティング問題に対する最適パス選択解法の提案

常村和史, 田島滋人, 藤井雅和, 中田明夫, 横平徳美, 舩曵信生, 東野輝夫

マルチメディア通信と分散処理ワークショップ講演集 2001

ネットワークのリンクスケジューリングへのグラフ彩色アプローチ

田島滋人, 舩曵信生, 東野輝夫, 横平徳美, 中西透

電子情報通信学会技術研究報告, COMP2001-71 2001

A proposal of neuron filter: A constraint resolution scheme of neural networks for combinatorial optimization problems

Y Takenaka, N Funabiki, T Higashino

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES E83A ( 9 ) 1815 - 1823 2000.9

Language：English Publisher：IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG

A constraint resolution scheme in the Hopfield-type neural network named "Neuron Filter" is presented for efficiently solving combinatorial optimization problems. The neuron filter produces an output that satisfies the constraints of the problem as best as possible according to both neuron inputs and outputs. This paper defines the neuron filter and shows its introduction into existing neural networks for N-queens problems and FPGA board-level routing problems. The performance is evaluated through simulations wharf the results show that our neuron filter improves the searching: capability of the neural network with the shorter computation time.

Web of Science

researchmap

A proposal of neuron filter a constraint resolution scheme of neural networks for combinatorial optimization problems

Yoichi Takenaka, *Nobuo Funabiki, Teruo Higashino

IEICE Transactions on Fundamentals E83-A ( 9 ) 1815 - 1823 2000.9

A Formulation of an FPGA Logic-Block Pin Assignment Problem and Its Two-Stage Discrete Optimization Method

FUNABIKI Nobuo, IKENAGA Katsuyoshi, EGAWA Shinji, HIGASHINO Teruo

The Transactions of the Institute of Electronics,Information and Communication Engineers. A 83 ( 8 ) 976 - 988 2000.8

A minimal-state procssing search algorithm for graph coloring problems

FUNABIKI Nobuo, HIGASHINO Teruo

IEICE Transactions on Fundamentals E83-A ( 7 ) 1420 - 1430 2000.7

Language：English Publisher：The Institute of Electronics, Information and Communication Engineers

This paper presents a heuristic graph coloring algorithm named MIPS_CLR, a MInimal-state Processing Search algorithm for the graph CoLoRing problem. Given a graph G(V, E), the goal of this NP-complete problem is to find a color assignment to every vertex in V such that any pair of adjacent vertices must not receive the same color but also the total number of colors should be minimized. The graph coloring problem has been widely studied due to its large number of practical applications in various fields. In MIPS_CLR, a construction stage first generates an intial minimal state composed of as many as colored vertices by a simple greedy algorithm, after a miximal clique of G is found by a maximum clique algorithm. Then, a refinement stage iteratively seeks a solution state while keeping minimality in terms of a cost function by a minimal-state transition method. In this method, the schemes of a best color selection, a random color selection, a color assignment shuffle, and a gradual color expansion are used together to realize the discrete descent search with hill-climbing capabilities. The performance of MIPS_CLR is evaluated through solving DIMACS benchmark graph instances, where the solution quality is generally better than existing algorithms while the computation time is comparable with the best existing one. In particular, MIPS_CLR provides new lower bound solutions for several instances. The simulation results confirm the extensive search capability of our MIPS_CLR approach for the graph coloring problem.

CiNii Article

CiNii Books

researchmap

A minimal-state processing search algorithm for graph coloring problems

N Funabiki, T Higashino

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES E83A ( 7 ) 1420 - 1430 2000.7

Language：English Publisher：IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG

This paper presents a heuristic graph coloring algorithm named MIPS_CLR, a MInimal-state Processing Search algorithm for the graph CoLoRing problem. Given a graph G(V, E), the goal of this NP-complete problem is to find a color assignment to every vertex in II such that arty pair of adjacent vertices must not receive the same color but also the total number of colors should be minimized. The graph coloring problem has been widely studied due to its large number of practical applications in various fields. In MIPS-CLR, a construction stage first generates an initial minimal state composed of as many as: colored vertices by a simple greedy algorithm, after a maximal clique of G is found by a maximum clique algorithm. Then, a refinement stage iteratively seeks a solution state while keeping minimality in terms of a cost function by a minimal-state transition method. In this method, the schemes of a best color selection, a random color selection, a color assignment shuffle, and a gradual color expansion are used together to realize the discrete descent starch with hill-climbing capabilities. The performance of MIPS_CLR is evaluated through solving DIMACS benchmark graph instances, where the solution quality is generally better than existing algorithms while the computation time is comparable with the Lest existing one. In particular, MIPS-CLR provides new lower bound solutions for several instances. The simulation results, confirm the extensive search capability of our MIPS_CLR approach For the graph coloring problem.

Web of Science

researchmap

　 PREV - NEXT 　

< FUNABIKI Nobuo >

MISC - FUNABIKI Nobuo