start-ver=1.4 cd-journal=joma no-vol= cd-vols= no-issue= article-no= start-page=118 end-page=125 dt-received= dt-revised= dt-accepted= dt-pub-year=2005 dt-pub=20056 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=Coordination of appearance and motion data for virtual view generation of traditional dances en-subtitle= kn-subtitle= en-abstract= kn-abstract=

A novel method is proposed for virtual view generation of traditional dances. In the proposed framework, a traditional dance is captured separately for appearance registration and motion registration. By coordinating the appearance and motion data, we can easily control virtual camera motion within a dancer-centered coordinate system. For this purpose, a coordination problem should be solved between the appearance and motion data, since they are captured separately and the dancer moves freely in the room. The present paper shows a practical algorithm to solve it. A set of algorithms are also provided for appearance and motion registration, and virtual view generation from archived data. In the appearance registration, a 3D human shape is recovered in each time from a set of input images after suppressing their backgrounds. By combining the recovered 3D shape and a set of images for each time, we can compose archived dance data. In the motion registration, stereoscopic tracking is accomplished for color markers placed on the dancer. A virtual view generation is formalized as a color blending among multiple views, and a novel and efficient algorithm is proposed for the composition of a natural virtual view from a set of images. In the proposed method, weightings of the linear combination are calculated from both an assumed viewpoint and a surface normal.

en-copyright= kn-copyright= en-aut-name=KamonYuji en-aut-sei=Kamon en-aut-mei=Yuji kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= en-aut-name=YamaneRyo en-aut-sei=Yamane en-aut-mei=Ryo kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=2 ORCID= en-aut-name=MukaigawaYasuhiro en-aut-sei=Mukaigawa en-aut-mei=Yasuhiro kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=3 ORCID= en-aut-name=ShakunagaTakeshi en-aut-sei=Shakunaga en-aut-mei=Takeshi kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=4 ORCID= affil-num=1 en-affil= kn-affil=Sharp Corporation affil-num=2 en-affil= kn-affil=Okayama University affil-num=3 en-affil= kn-affil=Osaka University affil-num=4 en-affil= kn-affil=Okayama University en-keyword=humanities kn-keyword=humanities en-keyword=image colour analysis kn-keyword=image colour analysis en-keyword=image motion analysis kn-keyword=image motion analysis en-keyword=image registration kn-keyword=image registration en-keyword=stereo image processing kn-keyword=stereo image processing en-keyword=tracking kn-keyword=tracking en-keyword=virtual reality kn-keyword=virtual reality END start-ver=1.4 cd-journal=joma no-vol= cd-vols= no-issue= article-no= start-page=2 end-page=13 dt-received= dt-revised= dt-accepted= dt-pub-year=2005 dt-pub=20056 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=Further improving geometric fitting en-subtitle= kn-subtitle= en-abstract= kn-abstract=

We give a formal definition of geometric fitting in a way that suits computer vision applications. We point out that the performance of geometric fitting should be evaluated in the limit of small noise rather than in the limit of a large number of data as recommended in the statistical literature. Taking the KCR lower bound as an optimality requirement and focusing on the linearized constraint case, we compare the accuracy of Kanatani's renormalization with maximum likelihood (ML) approaches including the FNS of Chojnacki et al. and the HEIV of Leedan and Meer. Our analysis reveals the existence of a method superior to all these.

en-copyright= kn-copyright= en-aut-name=KanataniKenichi en-aut-sei=Kanatani en-aut-mei=Kenichi kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= affil-num=1 en-affil= kn-affil=Department of Computer Science, Okayama University en-keyword=computer vision kn-keyword=computer vision en-keyword=maximum likelihood estimation kn-keyword=maximum likelihood estimation en-keyword=surface fitting kn-keyword=surface fitting END start-ver=1.4 cd-journal=joma no-vol=1 cd-vols= no-issue= article-no= start-page=999 end-page=1004 dt-received= dt-revised= dt-accepted= dt-pub-year=2005 dt-pub=20053 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=Optical-drop wavelength assignment problem for wavelength reuse in WDM ring metropolitan area networks en-subtitle= kn-subtitle= en-abstract= kn-abstract=This paper presents a formulation of the optical-drop wavelength assignment problem (ODWAP) and its heuristic algorithm for WDM ring networks. The wavelength-division multiplexing (WDM) technology has been popular in communication societies for providing very large communication bands by multiple lightpaths with different wavelengths on a single optical fiber. Particularly, a double-ring optical network architecture based on the packet-over-WDM technology such as the HORNET architecture has been studied as a next generation platform for metropolitan area networks (MANs). Each node in this architecture is equipped with a wavelength-fixed optical-drop and a tunable transmitter so that a lightpath can be established between any pair of nodes without wavelength conversions. In this paper, we formulate ODWAP for efficient wavelength reuse under heterogeneous traffic in this network. Then, we propose a simple heuristic algorithm for ODWAP. Through extensive simulations, we demonstrate the effectiveness of our approach in reducing waiting times for packet transmissions when a small number of wavelengths are available to retain the network cost for MANs. en-copyright= kn-copyright= en-aut-name=FunabikiNobuo en-aut-sei=Funabiki en-aut-mei=Nobuo kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= en-aut-name=IsogaiMegumi en-aut-sei=Isogai en-aut-mei=Megumi kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=2 ORCID= en-aut-name=NakanishiToru en-aut-sei=Nakanishi en-aut-mei=Toru kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=3 ORCID= en-aut-name=HigashinoTeruo en-aut-sei=Higashino en-aut-mei=Teruo kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=4 ORCID= affil-num=1 en-affil= kn-affil=Department of Communication Network Engineering, Okayama University affil-num=2 en-affil= kn-affil=Department of Communication Network Engineering, Okayama University affil-num=3 en-affil= kn-affil=Department of Communication Network Engineering, Okayama University affil-num=4 en-affil= kn-affil=Graduate School of Information Science and Technology, Osaka University en-keyword=metropolitan area networks kn-keyword=metropolitan area networks en-keyword=optical fibre networks kn-keyword=optical fibre networks en-keyword=telecommunication network topology kn-keyword=telecommunication network topology en-keyword=telecommunication traffic kn-keyword=telecommunication traffic en-keyword=wavelength division multiplexing kn-keyword=wavelength division multiplexing END start-ver=1.4 cd-journal=joma no-vol= cd-vols= no-issue= article-no= start-page=384 end-page=390 dt-received= dt-revised= dt-accepted= dt-pub-year=2005 dt-pub=2005 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=A protection method against massive error mails caused by sender spoofed spam mails en-subtitle= kn-subtitle= en-abstract= kn-abstract=Wide spread of spam mails is one of the most serious problems on e-mail environment. Particularly, spam mails with a spoofed sender address should not be left alone, since they make the mail server corresponding to the spoofed address be overloaded with massive error mails generated by the spam mails, and since they waste a lot of network and computer resources. In this paper, we propose a protection method of the mail server against such massive error mails. This method introduces an additional mail server that mainly deals with the error mails in order to reduce the load of the original mail server. This method also provide a function that refuses error mails to these two mail servers to save the network and computer resources. en-copyright= kn-copyright= en-aut-name=YamaiNariyoshi en-aut-sei=Yamai en-aut-mei=Nariyoshi kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= en-aut-name=OkayamaKiyohiko en-aut-sei=Okayama en-aut-mei=Kiyohiko kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=2 ORCID= en-aut-name=MiyashitaTakuya en-aut-sei=Miyashita en-aut-mei=Takuya kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=3 ORCID= en-aut-name=MaruyamaShin en-aut-sei=Maruyama en-aut-mei=Shin kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=4 ORCID= en-aut-name=NakamuraMotonori en-aut-sei=Nakamura en-aut-mei=Motonori kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=5 ORCID= affil-num=1 en-affil= kn-affil=Okayama University affil-num=2 en-affil= kn-affil=Okayama University affil-num=3 en-affil= kn-affil=Okayama University affil-num=4 en-affil= kn-affil=Kyoto University affil-num=5 en-affil= kn-affil=Kyoto University en-keyword=Internet kn-keyword=Internet en-keyword=security of data kn-keyword=security of data en-keyword=unsolicited e-mail kn-keyword=unsolicited e-mail END start-ver=1.4 cd-journal=joma no-vol= cd-vols= no-issue= article-no= start-page=241 end-page=247 dt-received= dt-revised= dt-accepted= dt-pub-year=2004 dt-pub=20045 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=Robust face recognition by combining projection-based image correction and decomposed eigenface en-subtitle= kn-subtitle= en-abstract= kn-abstract=This work presents a robust face recognition method, which can work even when an insufficient number of images are registered for each person. The method is composed of image correction and image decomposition, both of which are specified in the normalized image space (NIS). The image correction [(F. Sakaue and T. Shakunaga, 2004), (T. Shakunaga and F. Sakaue, 2002)] is realized by iterative projections of an image to an eigenspace in NIS. It works well for natural images having various kinds of noise, including shadows, reflections, and occlusions. We have proposed decomposition of an eigenface into two orthogonal eigenspaces [T. Shakunaga and K. Shigenari, 2001], and have shown that the decomposition is effective for realizing robust face recognition under various lighting conditions. This work shows that the decomposed eigenface method can be refined by projection-based image correction. en-copyright= kn-copyright= en-aut-name=ShakunagaTakeshi en-aut-sei=Shakunaga en-aut-mei=Takeshi kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= en-aut-name=SakaueFumihiko en-aut-sei=Sakaue en-aut-mei=Fumihiko kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=2 ORCID= en-aut-name=ShigenariKazuma en-aut-sei=Shigenari en-aut-mei=Kazuma kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=3 ORCID= affil-num=1 en-affil= kn-affil=Department of Information Technology, Faculty of Engineering Okayama University affil-num=2 en-affil= kn-affil=Department of Information Technology, Faculty of Engineering Okayama University affil-num=3 en-affil= kn-affil=Department of Information Technology, Faculty of Engineering Okayama University en-keyword=eigenvalues and eigenfunctions kn-keyword=eigenvalues and eigenfunctions en-keyword=face recognition kn-keyword=face recognition en-keyword=object recognition kn-keyword=object recognition END start-ver=1.4 cd-journal=joma no-vol= cd-vols= no-issue= article-no= start-page=229 end-page=232 dt-received= dt-revised= dt-accepted= dt-pub-year=2003 dt-pub=20033 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=A proposal of a minimal-state processing search algorithm for isochronous channel reuse problems in DQDB networks en-subtitle= kn-subtitle= en-abstract= kn-abstract=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. We propose a minimal-state processing search algorithm for ICRP (MIPS/sub -/ICRP). The simulation results show that MIPS/sub -/ICRP always provides near-optimum solutions. en-copyright= kn-copyright= en-aut-name=FunabikiNobuo en-aut-sei=Funabiki en-aut-mei=Nobuo kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= en-aut-name=SuganoAyako en-aut-sei=Sugano en-aut-mei=Ayako kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=2 ORCID= en-aut-name=HigashinoTeruo en-aut-sei=Higashino en-aut-mei=Teruo kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=3 ORCID= affil-num=1 en-affil= kn-affil=Department of Communication Network Engineering, Okayama University affil-num=2 en-affil= kn-affil=Department of Communication Network Engineering, Okayama University affil-num=3 en-affil= kn-affil=Graduate School of Information Science and Technology, Osaka University en-keyword=IEEE standards kn-keyword=IEEE standards en-keyword=access protocols kn-keyword=access protocols en-keyword=channel allocation kn-keyword=channel allocation en-keyword=metropolitan area networks kn-keyword=metropolitan area networks en-keyword=performance evaluation kn-keyword=performance evaluation en-keyword=telecommunication standards kn-keyword=telecommunication standards END