Faculty Profiles - FUNABIKI Nobuo

MISC - FUNABIKI Nobuo

Division display 461 - 480 of about 573 ／ All the affair displays >>

A Proposal of a Tooth Contour Extraction Method Using Deformable Template Matching

NYUNOYA Yoshinori, FUNABIKI Nobuo, KISIMOTO Etuo

Technical report of IEICE. PRMU 103 ( 585 ) 43 - 48 2004.1

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

Our group has studied contour extraction methods for various face components such as lips and eyes from digital face images using the deformable template matching method. In our method, each template expressing a contour is composed of fixed number of simple mathematical functions including quadratic functions. This simple template enables us to compare component contours of various persons and to analyze statistical features of them through processing the limited number of parameters. In this paper, we propose a tooth contour extraction method using the deformable template matching, where the template is composed of four elliptic curves. Our method optimizes the parameters of the template by a local search method so that it is best fit to the edge image of a tooth, after automatically identifying the tooth region from a given teeth image. We describe the details of the proposed algorithm and show simulation results for several sample images.

CiNii Article

CiNii Books

researchmap

A proposal of hierarchical chordal ring network topology for WDM networks

T Kitani, N Funabiki, T Higashino

2004 12TH IEEE INTERNATIONAL CONFERENCE ON NETWORKS, VOLS 1 AND 2 , PROCEEDINGS 605 - 609 2004

Language：English Publisher：IEEE

This paper presents a hierarchical chordal ring network topology (HCRN) as a regular logical topology for multihop WDM networks. In order to minimize the traffic increase and the transmission delay through the network due to packet relays or hops on intermediate nodes in the multihop network, the network topology is hierarchically constructed in HCRN, so that more lightpaths are assigned to connections between nearby nodes than those for distant nodes, while the maximum hop between any pair of nodes is restrained. This hierarchical topology is also beneficial to reduce the number of required wavelengths through increasing their reuses by multiple lightpaths, which is important for cost-conscious metropolitan area networks. Through comparisons on the network diameter and the number of required wavelengths with the original chordal ring network topology, we show the effectiveness of our proposed HCRN.

DOI： 10.1109/ICON.2004.1409241

Web of Science

researchmap

A minimum dead space algorithm for wavelength reuse problems in WDM ring networks

Nobuo Funabiki, Toru Nakanishi, Yoshitaka Toyota, Jun Kawashima, Teruo Higashino

Proc. of International Conference on Optical Communications and Networks (ICOCN-2004) 2004

無線ネットワークのリンクスケジューリング問題に対するヒューリスティック解法の提案

田島滋人, 舩曵信生, 東野輝夫

情報処理学会論文誌, vol. 45, no. 2 2004

A Proposal of Improved Lip Contour Extraction Method Using Deformable Template Matching and Its Application to Dental Treatment

YOKOGAWA Yujin, FUNABIKI Nobuo, HIGASHINO Teruo, ODA Masashi, MORI Yoshihide

IEICE transactions on information and systems 86 ( 8 ) 1474 - 1474 2003.8

Deformable Templateマッチング法による唇輪郭抽出法の改良と歯科医療応用を目的とした評価

横川勇仁, 小田政志, 舩曵信生, 東野輝夫, 森悦秀

電子情報通信学会論文誌D-Ⅱ，vol. J86-D-Ⅱ, no.8 2003

A proposal of a two-stage heuristic algorithm for peer-to-peer multicast routing problems in multihome networks

Nobuo Funabiki, Jun Kawashima, Akihito Kubo, Kiyohiko Okayama, Teruo Higashino

Proc. of The Fifth Metaheuristics International Conference (MIC-2003) 2003

A two-stage hierarchical algorithm for wavelength assignment in WDM-based bidirectional Manhattan Street Networks

T Kitani, M Yonedu, N Funabiki, T Nakanishi, K Okayama, T Higashino

ICON 2003: 11TH IEEE INTERNATIONAL CONFERENCE ON NETWORKS 419 - 424 2003

Language：English Publisher：IEEE

Wavelength Division Multiplexing (WDM) technology provides a wideband communication networks by realizing multiple communication channels with different wavelengths on a single optical fiber. In this technology, each node (wavelength router) has a finite number of transmitters/receivers dealing with different wavelengths, where each wavelength is exclusively used for the communication channel between a specific pair of nodes. Thus, some transmission request may require multiple wavelengths going through several nodes before reaching its destination. As a result, the wavelength assignment to nodes is very important for efficient transmission in WDM-based networks. Among regular wavelength assignment topologies, Bidirectional Manhattan Street Network (BMSN) gives high performance to WDM-based networks. In this paper, we present a two-stage heuristic algorithm for the wavelength assignment in BMSN, called a HIWAS (HIerarchical Wavelength ASsignment algorithm for BMSN). The first stage of HIWAS finds an initial wavelength assignment hierarchically, not only to avoid a local minimum as best as possible but also to reduce the time complexity. The second stage improves the wavelength assignment by adopting the simulated annealing. The performance of HIWAS is verified through solving two types of random instances, where HIWAS provides a better solution with a shorter time than the best-known existing algorithm.

Web of Science

researchmap

Deformable-Templateマッチング法による眼の輪郭線抽出に関する研究

小田政志, 舩曵信生, 東野輝夫

電子情報通信学会技術研究報告, PRMU2003-140 2003

A proposal of a minimal-state processing search algorithm for link scheduling problems in packet radio networks

S Tajima, N Funabiki, A Sugano, T Higashino

2003 SYMPOSIUM ON APPLICATIONS AND THE INTERNET, PROCEEDINGS 128 - 135 2003

Language：English Publisher：IEEE COMPUTER SOC

In a large scale communication network, packets are transmitted from source nodes to destinations by going through several nodes on routes connecting them, because each node usually does not have a direct link to every node in the network. To maximize the usability in the network, the problems of selecting a transmission route for each connection request and of scheduling the link activations such that the total transmission time is minimized. This paper presents a four-stage approximation algorithm for the link scheduling problem (LSP) in a packet radio network, called MIPS-LSP, a MInimal-state Processing Search algorithm for LSR It is assumed that every link activation in the network is synchronously controlled by a single clock with a fixed time interval called a time slot. The first stage of MIPS-LSP computes the lower bound on the number of time slots for a given LSP instance. The second stage generates a link compatibility graph to represent the conflicts between links to be activated simultaneously. The third stage gives the initial state for search by a greedy method. The last stage iteratively searches a solution by a minimal-state evolution method. The performance of the algorithm is verified through extensive simulations using benchmarks in literature.

DOI： 10.1109/SAINT.2003.1183041

Web of Science

researchmap

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

米津正隆, 舩曵信生, 木谷友哉, 横平徳美, 中西透, 東野輝夫

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

A proposal of a minimal-state processing search algorithm for isochronous channel reuse problems in DQDB networks

N Funabiki, A Sugano, T Higashino

AINA 2003: 17TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS 229 - 232 2003

Language：English Publisher：IEEE COMPUTER SOC

The IEEE 802.6 MAC standard protocol defines the distributed-queue dual bus (DQDB) for metropolitan area networks (MANs). The isochronous channel reuse problem (ICRP) has been studied for the efficient use of DQDB. Given a set of established connections and a set of connection requests, the goal of ICRP is to maximize the number of satisfied requests by finding a proper channel assignment, such that no established connection is not only reassigned a channel, but also any pair of active connections does not interfere each other. In this paper, we propose a minimal-state processing search algorithm for ICRP (MIPS-ICRP). The simulation results show that MIPS-ICRP always provides near-optimum solutions.

DOI： 10.1109/AINA.2003.1192877

Web of Science

researchmap

A Proposal of Test Sequence Generation Method for Communication Protocols Using SAT Algorithm

MORI Takanori, OTSUKA Hirotaka, FUNABIKI Nobuo, NAKATA Akio, HIGASHINO Teruo

IEICE transactions on information and systems 85 ( 11 ) 1886 - 1887 2002.11

A Method to Generate Test Sequences for FSM Protocols using SAT Algorithm

2002 ( 15 ) 75 - 80 2002.10

A quasi-solution state evolution algorithm for channel assignment problems in cellular networks

N Funabiki, T Nakanishi, T Yokohira, S Tajima, T Higashino

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES E85A ( 5 ) 977 - 987 2002.5

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

For efficient use of limited electromagnetic wave resource, the assignment of communication channels to call requests is very important in a cellular network. This task has been formulated as an NP-hard combinatorial optimization problem named the channel assignment problem (CAP). Given a cellular network and a set of call requests, CAP requires to find a channel assignment to the call requests such that three types of interference constraints between channels are not only satisfied, but also the number of channels (channel span) is minimized. This paper presents an iterative search approximation algorithm for CAP, called the Quasi-solution state evolution algorithm for CAP (QCAP). To solve hard CAP instances in reasonable time, QCAP evolutes quasi-solution states where a subset of call requests are assigned channels and no more request can be satisfied without violating the constraint QCAP is composed of three stages. The first stage computes the lower bound on the channel span for a given instance. After the second stage greedily generates an initial quasi-solution state, the third stage evolutes them for a feasible channel assignment by iteratively generating best neighborhoods, with help of the dynamic state jump and the gradual span expansion for global convergence. The performance of QCAP is evaluated through solving benchmark instances in literature, where QCAP always finds the optimum or near-optimum solution in very short time. Our simulation results confirm the extensive search capability and the efficiency of QCAP.

Web of Science

researchmap

A minimal-state processing search algorithm for satisfiability problems

N Funabiki, T Yokohira, T Nakanishi, S Tajima, T Higashino

2001 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5 2769 - 2774 2002

Language：English Publisher：IEEE

The satisfiability problem (SAT) is a typical NP-complete problem where a wide range of applications has been studied. Given a set of variables U and a set of clauses C, the goal of SAT is to find a truth assignment to variables in U such that every clause in C is satisfied if it exits, or to derive the infeasibility otherwise. This paper presents an approximation algorithm called a minimal,state processing search algorithm for SAT (MIPS_SAT). MIPS_SAT repeatedly transits minimal states in terms of the cost function for searching a solution through a construction stage and a refinement stage. The first stage greedily generates an initial state composed of as many satisfied clauses as possible. The second stage iteratively seeks a solution while keeping state minimality. The performance of MIPS_SAT is verified through solving DIMACS benchmark instances.

Web of Science

researchmap

Binary neural networks for N-queens problems and their VLSI implementations

N Funabiki, T Kurokawa, M Ohta

CONTROL AND CYBERNETICS 31 ( 2 ) 271 - 296 2002

Language：English Publisher：POLISH ACAD SCIENCES SYSTEMS RESEARCH INST

Combinatorial optimization problems compose an important class of mathematical problems that include a variety of practical applications, such as VLSI design automation, communication network design and control, job scheduling, games, and genome informatics. These problems usually have a large number of variables to be solved. For example, problems for VLSI design automation require several million variables. Besides, their computational complexity is often intractable due to NP-hardness. Neural networks have provided elegant solutions as approximation algorithms to these hard problems due to their natural parallelism and their affinity to hardware realization. Particularly, binary neural networks have great potential to conform to current digital VLSI design technology, because any state and parameter in binary neural networks are expressed in a discrete fashion. This paper presents our studies on binary neural networks to the N-queens problem, and the three different approaches to VLSI implementations focusing on the efficient realization of the synaptic connection networks. Reconfigurable devices such as CPLDs and FPGAs contribute the realization of a scalable architecture with the ultra highs speed of computation. Based on the proposed architecture, more than several thousands of binary neurons can be realized on one FPGA chip.

Web of Science

researchmap

ネットワークのリンクスケジューリングにおけるタイムスロット数下限値算出法の改善

田島滋人, 舩曵信生, 東野輝夫

マルチメディア，分散，協調とモバイルシンポジウム(DICOMO 2002)講演集 2002

ユーザの移動情報を利用したモバイル・マルチキャストルーティング問題の一解法

常村和史, 田島滋人, 中田明夫, 舩曵信生, 東野輝夫

マルチメディア，分散，協調とモバイルシンポジウム(DICOMO 2002)講演集 2002

Webバグに基づくファイルの不正開封検知システムの提案

小林正憲, 舩曵信生, 中西透

コンピュータセキュリティシンポジウム2002講演集 2002

　 PREV - NEXT 　

< FUNABIKI Nobuo >

MISC - FUNABIKI Nobuo