<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="http://onlinelibrary.wiley.com/rss/journal/10.1002/(ISSN)1520-6432" xmlns="http://purl.org/rss/1.0/"><title>Electronics and Communications in Japan (Part II: Electronics)</title><description> Wiley Online Library : Electronics and Communications in Japan (Part II: Electronics)</description><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2F%28ISSN%291520-6432</link><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc</dc:publisher><dc:language xmlns:dc="http://purl.org/dc/elements/1.1/">en</dc:language><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><prism:issn xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">8756-663X</prism:issn><prism:eIssn xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">1520-6432</prism:eIssn><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2007-12-01T00:00:00-05:00</dc:date><prism:coverDisplayDate xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">December 2007</prism:coverDisplayDate><prism:volume xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">90</prism:volume><prism:number xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">12</prism:number><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">1</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">139</prism:endingPage><image rdf:resource="http://onlinelibrary.wiley.com/store/10.1002/(ISSN)1520-6432/asset/cover.gif?v=1&amp;s=0688a8c577063f11c1a62ace01775760169e5958"/><items><rdf:Seq><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20421"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20413"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20414"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20422"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20423"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20424"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20416"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20425"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20426"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20427"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20428"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20406"/></rdf:Seq></items></channel><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20421" xmlns="http://purl.org/rss/1.0/"><title>HMM-based text segmentation using variational Bayes learning and its application to audio-visual indexing</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20421</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">HMM-based text segmentation using variational Bayes learning and its application to audio-visual indexing</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Takafumi Koshinaka, Akitoshi Okumura, Ryosuke Isotani</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2007-11-12T00:00:00-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/ecjb.20421</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/ecjb.20421</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20421</prism:url><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">1</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">11</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Recent progress in large-vocabulary continuous speech recognition (LVCSR) has raised the possibility of applying information retrieval techniques to the resulting text. This paper presents a novel unsupervised text segmentation method. Assuming a generative model of a text stream as a left-to-right hidden Markov model (HMM), text segmentation can be formulated as model parameter estimation and model selection using the text stream. The formulation is derived based on the variational Bayes framework, which is expected to work well with highly sparse data such as text. The effectiveness of the proposed method is demonstrated through a series of experiments, where broadcast news programs are automatically transcribed and segmented into separate news stories. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 90(12): 1–11, 2007; Published online in Wiley InterScience (<!--TODO: clickthrough URL--><a href="http://www.interscience.wiley.com" title="Link to external resource: http://www.interscience.wiley.com">www.interscience.wiley.com</a>). DOI 10.1002/ecjb.20421</p></div>]]></content:encoded><description>Recent progress in large-vocabulary continuous speech recognition (LVCSR) has raised the possibility of applying information retrieval techniques to the resulting text. This paper presents a novel unsupervised text segmentation method. Assuming a generative model of a text stream as a left-to-right hidden Markov model (HMM), text segmentation can be formulated as model parameter estimation and model selection using the text stream. The formulation is derived based on the variational Bayes framework, which is expected to work well with highly sparse data such as text. The effectiveness of the proposed method is demonstrated through a series of experiments, where broadcast news programs are automatically transcribed and segmented into separate news stories. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 90(12): 1–11, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjb.20421</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20413" xmlns="http://purl.org/rss/1.0/"><title>Robust obstacle detection in general road environment based on road extraction and pose estimation</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20413</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Robust obstacle detection in general road environment based on road extraction and pose estimation</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Akihito Seki, Masatoshi Okutomi</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2007-11-12T00:00:00-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/ecjb.20413</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/ecjb.20413</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20413</prism:url><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">12</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">22</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper proposes a method of obstacle detection using vehicle-mounted stereo cameras. There are various objects in the road environment; these can be divided into objects, such as pedestrians, which have the possibility of colliding with the vehicle, and objects, such as road patterns, which do not have such a possibility. In this paper, an obstacle is defined as an object which is located in the space through which the vehicle will travel. In order to decide whether an object is an obstacle from the pattern in the image, it is necessary to estimate the position of the pattern in relation to the road surface. For this purpose, the planar region is determined by dynamically estimating the homography (projection transformation) matrix between the images corresponding to the plane. The pose of the camera with respect to the road is determined. Then the spatial position obtained by stereo measurement is converted to road coordinates, based on the orientation of the road surface. By applying segmentation based on the converted result of stereo measurement, obstacles are detected. On ordinary roads it is required to detect various obstacles, ranging from relatively small obstacles such as pedestrians and bicycles to large obstacles such as cars. The proposed method can detect obstacles without explicit modeling. The effectiveness of the proposed method is demonstrated by experiments using various actual images. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 90(12): 12–22, 2007; Published online in Wiley InterScience (<!--TODO: clickthrough URL--><a href="http://www.interscience.wiley.com" title="Link to external resource: http://www.interscience.wiley.com">www.interscience.wiley.com</a>). DOI 10.1002/ecjb.20413</p></div>]]></content:encoded><description>This paper proposes a method of obstacle detection using vehicle-mounted stereo cameras. There are various objects in the road environment; these can be divided into objects, such as pedestrians, which have the possibility of colliding with the vehicle, and objects, such as road patterns, which do not have such a possibility. In this paper, an obstacle is defined as an object which is located in the space through which the vehicle will travel. In order to decide whether an object is an obstacle from the pattern in the image, it is necessary to estimate the position of the pattern in relation to the road surface. For this purpose, the planar region is determined by dynamically estimating the homography (projection transformation) matrix between the images corresponding to the plane. The pose of the camera with respect to the road is determined. Then the spatial position obtained by stereo measurement is converted to road coordinates, based on the orientation of the road surface. By applying segmentation based on the converted result of stereo measurement, obstacles are detected. On ordinary roads it is required to detect various obstacles, ranging from relatively small obstacles such as pedestrians and bicycles to large obstacles such as cars. The proposed method can detect obstacles without explicit modeling. The effectiveness of the proposed method is demonstrated by experiments using various actual images. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 90(12): 12–22, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjb.20413</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20414" xmlns="http://purl.org/rss/1.0/"><title>An overview and case study of a statistical regression testing method for software maintenance</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20414</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">An overview and case study of a statistical regression testing method for software maintenance</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Tomohiko Takagi, Zengo Furukawa, Toshinori Yamasaki</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2007-11-12T00:00:00-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/ecjb.20414</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/ecjb.20414</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20414</prism:url><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">23</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">34</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>We propose a statistical regression testing method for evaluating the reliability of software as part of the software maintenance process. Maintenance procedures take up more than half the time of the software development process; in addition, software reliability is an important factor in determining the dependability of a product. Regression tests are performed in order to conserve or improve software reliability as part of the software maintenance process. However, existing systematic testing methods based on regression tests are not necessarily appropriate for evaluating software reliability. The statistical regression testing method is a means for compensating for the flaws of such existing methods. In this method a model of how the user makes use of the software is defined by means of a Markov chain; this is known as the <em>usage model</em>, and then test cases are generated at random according to a probability distribution based on this usage model. In this paper we perform experiments applying the proposed method to a small-scale client server program and demonstrate that the proposed method can be implemented. In addition, we clarify the effects and issues that may be anticipated when applying the method and establish how it may be used in practice. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 90(12): 23–34, 2007; Published online in Wiley InterScience (<!--TODO: clickthrough URL--><a href="http://www.interscience.wiley.com" title="Link to external resource: http://www.interscience.wiley.com">www.interscience.wiley.com</a>). DOI 10.1002/ecjb.20414</p></div>]]></content:encoded><description>We propose a statistical regression testing method for evaluating the reliability of software as part of the software maintenance process. Maintenance procedures take up more than half the time of the software development process; in addition, software reliability is an important factor in determining the dependability of a product. Regression tests are performed in order to conserve or improve software reliability as part of the software maintenance process. However, existing systematic testing methods based on regression tests are not necessarily appropriate for evaluating software reliability. The statistical regression testing method is a means for compensating for the flaws of such existing methods. In this method a model of how the user makes use of the software is defined by means of a Markov chain; this is known as the usage model, and then test cases are generated at random according to a probability distribution based on this usage model. In this paper we perform experiments applying the proposed method to a small-scale client server program and demonstrate that the proposed method can be implemented. In addition, we clarify the effects and issues that may be anticipated when applying the method and establish how it may be used in practice. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 90(12): 23–34, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjb.20414</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20422" xmlns="http://purl.org/rss/1.0/"><title>Performance improvement approach for dependable computing system with optical voting circuit</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20422</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Performance improvement approach for dependable computing system with optical voting circuit</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Yoshimitsu Yanagawa, Takuya Takahara, Takahide Mizuno, Hirobumi Saito</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2007-11-12T00:00:00-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/ecjb.20422</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/ecjb.20422</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20422</prism:url><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">35</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">46</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper proposes a new voting method using light that makes possible the realization of a high-performance computing system equipped with both flexibility and dependability. Soft errors inside computers due to terrestrial radiation have become a problem in recent years. We have proposed a highly dependable triple voting-type computing system that can be used even in the strong radiation environment of space. While this system uses reconfigurable SRAM-based FPGA to achieve high flexibility, the system operation speed was limited by synchronization problems in voting circuits located on parallel buses, and by the bottleneck of a limited upper speed for the radiation-tolerant device used in the voting logic circuit. As a result, we study the use of a serial bus, and propose a voting circuit using light that is suitable for a high-speed serial bus. This optical voting circuit is highly compatible with the high-speed serial interfaces provided on recent FPGAs, and is easily configurable using existing optical communications devices. In operations tests using an optical communications module, we obtained voting performance at a 1 Gbit/s communication speed, and estimated that the upper speed limit for the test system is 2.14 Gbit/s. Use of a higher speed optical communication module and circuit optimization should make it possible to achieve even higher speeds. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 90(12): 35–46, 2007; Published online in Wiley InterScience (<!--TODO: clickthrough URL--><a href="http://www.interscience.wiley.com" title="Link to external resource: http://www.interscience.wiley.com">www.interscience.wiley.com</a>). DOI 10.1002/ecjb.20422</p></div>]]></content:encoded><description>This paper proposes a new voting method using light that makes possible the realization of a high-performance computing system equipped with both flexibility and dependability. Soft errors inside computers due to terrestrial radiation have become a problem in recent years. We have proposed a highly dependable triple voting-type computing system that can be used even in the strong radiation environment of space. While this system uses reconfigurable SRAM-based FPGA to achieve high flexibility, the system operation speed was limited by synchronization problems in voting circuits located on parallel buses, and by the bottleneck of a limited upper speed for the radiation-tolerant device used in the voting logic circuit. As a result, we study the use of a serial bus, and propose a voting circuit using light that is suitable for a high-speed serial bus. This optical voting circuit is highly compatible with the high-speed serial interfaces provided on recent FPGAs, and is easily configurable using existing optical communications devices. In operations tests using an optical communications module, we obtained voting performance at a 1 Gbit/s communication speed, and estimated that the upper speed limit for the test system is 2.14 Gbit/s. Use of a higher speed optical communication module and circuit optimization should make it possible to achieve even higher speeds. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 90(12): 35–46, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjb.20422</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20423" xmlns="http://purl.org/rss/1.0/"><title>Color photometric stereo and virtual image rendering using neural networks</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20423</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Color photometric stereo and virtual image rendering using neural networks</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Haruki Kawanaka, Yuji Iwahori, Robert J. Woodham, Kenji Funahashi</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2007-11-12T00:00:00-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/ecjb.20423</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/ecjb.20423</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20423</prism:url><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">47</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">60</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>In this paper we extend the application of neural network-based photometric stereo founded on the principle of empirical photometric stereo to color images proposing a method for computing both the normal vectors of a target object and its color reflectance coefficients. This method is able to render objects that have non-Lambert reflectance properties without using any parametric reflectance function as a reflectance model. In addition, we propose a novel neural network-based rendering method that allows the generation of realistic virtual images of an object with arbitrary light source direction and from arbitrary viewpoints based on the physical reflectance properties of the actual object and perform a comparative evaluation with approximations by existing models, the Phong model, and the Torrance–Sparrow model. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 90(12): 47–60, 2007; Published online in Wiley InterScience (<!--TODO: clickthrough URL--><a href="http://www.interscience.wiley.com" title="Link to external resource: http://www.interscience.wiley.com">www.interscience.wiley.com</a>). DOI 10.1002/ecjb.20423</p></div>]]></content:encoded><description>In this paper we extend the application of neural network-based photometric stereo founded on the principle of empirical photometric stereo to color images proposing a method for computing both the normal vectors of a target object and its color reflectance coefficients. This method is able to render objects that have non-Lambert reflectance properties without using any parametric reflectance function as a reflectance model. In addition, we propose a novel neural network-based rendering method that allows the generation of realistic virtual images of an object with arbitrary light source direction and from arbitrary viewpoints based on the physical reflectance properties of the actual object and perform a comparative evaluation with approximations by existing models, the Phong model, and the Torrance–Sparrow model. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 90(12): 47–60, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjb.20423</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20424" xmlns="http://purl.org/rss/1.0/"><title>A dynamic background extraction method for indoor intruder detection</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20424</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">A dynamic background extraction method for indoor intruder detection</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Ryuya Shimada, Naohiro Kawaguchi, Kenta Kaga, Hiromitsu Yamada, Terunori Mori</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2007-11-12T00:00:00-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/ecjb.20424</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/ecjb.20424</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20424</prism:url><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">61</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">76</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>With recent increases in criminal activity, research and development efforts are required for detection of intruders. This paper proposes an element technique for developing a cheap intruder detection system with high performance. The following three functions are developed in this study. (1) The system can deal with smooth changes of illumination, including movement of the light source. (2) For a slowly moving intruder, the region of presence is clearly detected. (3) For an intruder pausing his movement, the region of presence is clearly detected. Functions (1) and (2) are apparently contradictory. The basic idea of the method is to detect the region of presence of the intruder based on the difference image between the background image without the intruder and the present input image. The crucial point then is how to update accurately and simply the present background image, and there has been no method that realizes the above three functions at the same time. In contrast, we realized these functions by an approach in which weighted averaging is not applied to the detected intruder region and its boundary in the background image. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 90(12): 61–76, 2007; Published online in Wiley InterScience (<!--TODO: clickthrough URL--><a href="http://www.interscience.wiley.com" title="Link to external resource: http://www.interscience.wiley.com">www.interscience.wiley.com</a>). DOI 10.1002/ecjb.20424</p></div>]]></content:encoded><description>With recent increases in criminal activity, research and development efforts are required for detection of intruders. This paper proposes an element technique for developing a cheap intruder detection system with high performance. The following three functions are developed in this study. (1) The system can deal with smooth changes of illumination, including movement of the light source. (2) For a slowly moving intruder, the region of presence is clearly detected. (3) For an intruder pausing his movement, the region of presence is clearly detected. Functions (1) and (2) are apparently contradictory. The basic idea of the method is to detect the region of presence of the intruder based on the difference image between the background image without the intruder and the present input image. The crucial point then is how to update accurately and simply the present background image, and there has been no method that realizes the above three functions at the same time. In contrast, we realized these functions by an approach in which weighted averaging is not applied to the detected intruder region and its boundary in the background image. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 90(12): 61–76, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjb.20424</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20416" xmlns="http://purl.org/rss/1.0/"><title>A real-time human movement transfer system for an omnidirectional display</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20416</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">A real-time human movement transfer system for an omnidirectional display</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Naohisa Sakamoto, Yukio Yasuhara, Nobuyuki Kukimoto, Yasuo Ebara, Koji Koyamada</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2007-11-12T00:00:00-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/ecjb.20416</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/ecjb.20416</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20416</prism:url><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">77</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">86</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper proposes a system in which a human image with movement is captured by a multiviewpoint camera and is converted in real time to three-dimensional data, which are sent by network transfer so that the image can be displayed at a remote site in three dimensions, using an omnidirectional display device. In the proposed system, the target human image is reconstructed in voxelwise, using parallel volume intersection for multiple images. The reconstructed voxels represent only the presence or absence of the object. Then coloring is required, based on texture information that is obtained by projecting the voxel on each image plane. The judgment as to whether the voxel is visible is important in the coloring process. In this study we attempt to achieve real-time processing from imaging to display. A parallel coloring procedure is developed by using a human image buffer in each camera, so that the visibility of the voxels is judged in real time. In order to investigate the effectiveness of the system, an experimental system for multiviewpoint image processing was constructed using five cameras and six PCs. A human image with movement was captured and a performance of 2.63 FPS was achieved for reconstruction with a spatial resolution of 96×96×96 (a voxel size of 10 mm). The reconstructed data were directly transferred to the omnidirectional display device without being stored in memory, and were displayed, demonstrating the effectiveness of the proposed method.  © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 90(12): 77–86, 2007; Published online in Wiley InterScience (<!--TODO: clickthrough URL--><a href="http://www.interscience.wiley.com" title="Link to external resource: http://www.interscience.wiley.com">www.interscience.wiley.com</a>). DOI 10.1002/ecjb.20416</p></div>]]></content:encoded><description>This paper proposes a system in which a human image with movement is captured by a multiviewpoint camera and is converted in real time to three-dimensional data, which are sent by network transfer so that the image can be displayed at a remote site in three dimensions, using an omnidirectional display device. In the proposed system, the target human image is reconstructed in voxelwise, using parallel volume intersection for multiple images. The reconstructed voxels represent only the presence or absence of the object. Then coloring is required, based on texture information that is obtained by projecting the voxel on each image plane. The judgment as to whether the voxel is visible is important in the coloring process. In this study we attempt to achieve real-time processing from imaging to display. A parallel coloring procedure is developed by using a human image buffer in each camera, so that the visibility of the voxels is judged in real time. In order to investigate the effectiveness of the system, an experimental system for multiviewpoint image processing was constructed using five cameras and six PCs. A human image with movement was captured and a performance of 2.63 FPS was achieved for reconstruction with a spatial resolution of 96×96×96 (a voxel size of 10 mm). The reconstructed data were directly transferred to the omnidirectional display device without being stored in memory, and were displayed, demonstrating the effectiveness of the proposed method.  © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 90(12): 77–86, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjb.20416</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20425" xmlns="http://purl.org/rss/1.0/"><title>Model generation interface for simulation of left ventricular motion</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20425</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Model generation interface for simulation of left ventricular motion</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Akira Amano, Kenichi Kanda, Tsukasa Shibayama, Yuu Kamei, Tetsuya Matsuda</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2007-11-12T00:00:00-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/ecjb.20425</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/ecjb.20425</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20425</prism:url><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">87</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">98</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>In the field of life science, a tremendous amount of quantitative data related to biological systems continues to accumulate. There are still many aspects of biological phenomena which are not fully analyzed, due to interaction between various phenomena and mechanisms. The simulation technique provides useful approaches to the analysis of such phenomena, in which the model describing the phenomenon and the model parameters are adjusted. Usually, however, simulation models for biological functions are very complex, and a tremendous amount of time is required in comprehensively adjusting the model and its parameters and then evaluating the simulation results. This study aims at construction of a model for the left ventricular motion, and considers the left ventricular shape model, the cell orientation model, and the coronary artery model as its components. An interface is constructed by which the above models and the model parameters can be adjusted. Using this interface, it is possible to evaluate the simulation model efficiently. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 90(12): 87–98, 2007; Published online in Wiley InterScience (<!--TODO: clickthrough URL--><a href="http://www.interscience.wiley.com" title="Link to external resource: http://www.interscience.wiley.com">www.interscience.wiley.com</a>). DOI 10.1002/ecjb.20425</p></div>]]></content:encoded><description>In the field of life science, a tremendous amount of quantitative data related to biological systems continues to accumulate. There are still many aspects of biological phenomena which are not fully analyzed, due to interaction between various phenomena and mechanisms. The simulation technique provides useful approaches to the analysis of such phenomena, in which the model describing the phenomenon and the model parameters are adjusted. Usually, however, simulation models for biological functions are very complex, and a tremendous amount of time is required in comprehensively adjusting the model and its parameters and then evaluating the simulation results. This study aims at construction of a model for the left ventricular motion, and considers the left ventricular shape model, the cell orientation model, and the coronary artery model as its components. An interface is constructed by which the above models and the model parameters can be adjusted. Using this interface, it is possible to evaluate the simulation model efficiently. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 90(12): 87–98, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjb.20425</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20426" xmlns="http://purl.org/rss/1.0/"><title>Learning of color transformation considering local illumination changes for interactive object recognition</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20426</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Learning of color transformation considering local illumination changes for interactive object recognition</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Yasushi Makihara, Yoshiaki Shirai, Nobutaka Shimada</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2007-11-12T00:00:00-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/ecjb.20426</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/ecjb.20426</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20426</prism:url><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">99</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">110</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper describes a learning method of color transformation considering local illumination changes in a scene for interactive object recognition. We deal with refrigerator scenes with external and internal light. The external illumination changes are expressed in terms of locations in the refrigerator and the parameters are learned. Because the intensity of the internal illumination depends not only on the location but also on the transmissivity of target objects and existence of shading objects, we try recognizing objects by changing the intensity and determine one at which the object is successfully recognized. Experiments of object detection show the effectiveness of our method. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 90(12): 99–110, 2007; Published online in Wiley InterScience (<!--TODO: clickthrough URL--><a href="http://www.interscience.wiley.com" title="Link to external resource: http://www.interscience.wiley.com">www.interscience.wiley.com</a>). DOI 10.1002/ecjb.20426</p></div>]]></content:encoded><description>This paper describes a learning method of color transformation considering local illumination changes in a scene for interactive object recognition. We deal with refrigerator scenes with external and internal light. The external illumination changes are expressed in terms of locations in the refrigerator and the parameters are learned. Because the intensity of the internal illumination depends not only on the location but also on the transmissivity of target objects and existence of shading objects, we try recognizing objects by changing the intensity and determine one at which the object is successfully recognized. Experiments of object detection show the effectiveness of our method. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 90(12): 99–110, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjb.20426</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20427" xmlns="http://purl.org/rss/1.0/"><title>Effectiveness of an evolutionary algorithm for the multi-objective rectangular packing problem</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20427</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Effectiveness of an evolutionary algorithm for the multi-objective rectangular packing problem</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Shinya Watanabe, Tomoyuki Hiroyasu, Mitsunori Miki</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2007-11-12T00:00:00-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/ecjb.20427</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/ecjb.20427</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20427</prism:url><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">111</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">120</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper considers the rectangular packing problem and investigates the effectiveness of the neighborhood cultivation genetic algorithm (NCGA). NCGA, which we proposed, is a new algorithm in which the unique mechanism of neighborhood crossover is combined with effective mechanisms for search in multi-objective GA proposed in the past. The effectiveness of the proposed method in typical test problems has already been investigated with satisfactory results in past studies. The rectangular packing problem, on the other hand, is applied to floor planning, such as chip area minimization in large-scale integrated circuits. It is a kind of discrete combinatorial problem in which it is known that the search is difficult and a very long time is required until the solution is obtained. This paper formulates the rectangular packing problem as a multi-objective problem with the vertical and horizontal lengths of the placement configuration as the objectives. The sequence-pair is used as the block placement representation, and PPEX is used as the crossover procedure. Using these processes, the effectiveness of NCGA is investigated. For comparison, three other methods—NSGA-II, SPEA2, and non-NCGA (NCGA without neighborhood crossover)—are investigated. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 90(12): 111–120, 2007; Published online in Wiley InterScience (<!--TODO: clickthrough URL--><a href="http://www.interscience.wiley.com" title="Link to external resource: http://www.interscience.wiley.com">www.interscience.wiley.com</a>). DOI 10.1002/ecjb.20427</p></div>]]></content:encoded><description>This paper considers the rectangular packing problem and investigates the effectiveness of the neighborhood cultivation genetic algorithm (NCGA). NCGA, which we proposed, is a new algorithm in which the unique mechanism of neighborhood crossover is combined with effective mechanisms for search in multi-objective GA proposed in the past. The effectiveness of the proposed method in typical test problems has already been investigated with satisfactory results in past studies. The rectangular packing problem, on the other hand, is applied to floor planning, such as chip area minimization in large-scale integrated circuits. It is a kind of discrete combinatorial problem in which it is known that the search is difficult and a very long time is required until the solution is obtained. This paper formulates the rectangular packing problem as a multi-objective problem with the vertical and horizontal lengths of the placement configuration as the objectives. The sequence-pair is used as the block placement representation, and PPEX is used as the crossover procedure. Using these processes, the effectiveness of NCGA is investigated. For comparison, three other methods—NSGA-II, SPEA2, and non-NCGA (NCGA without neighborhood crossover)—are investigated. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 90(12): 111–120, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjb.20427</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20428" xmlns="http://purl.org/rss/1.0/"><title>A computer simulation of relative backscattering coefficients of sea surfaces in satellite altimetry</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20428</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">A computer simulation of relative backscattering coefficients of sea surfaces in satellite altimetry</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Kazunobu Fukuda, Kiyotaka Fujisaki, Mitsuo Tateiba</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2007-11-12T00:00:00-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/ecjb.20428</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/ecjb.20428</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20428</prism:url><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">121</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">128</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>The purpose of this study is to establish a method for estimating the sea wave period by satellite radar altimetry. The backscatter coefficient, which is closely related to the period, is evaluated by computer simulation. Specifically, the following method is presented. The sea wave is modeled on the basis of the Pierson–Moskowitz spectrum. The average received power is determined by radar altimetry simulation of our proposal. It is shown that the backscatter coefficient of the sea surface can be calculated on a relative basis. Using the data for the relative received power calculated from various sea wave parameters, the relation between the significant wave height and the backscatter coefficient, and also the relation between the significant wavelength and the backscatter coefficient, are derived. Thus, the possibility of observing the sea wave period by using satellite radar altimetry is demonstrated. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 90(12): 121–128, 2007; Published online in Wiley InterScience (<!--TODO: clickthrough URL--><a href="http://www.interscience.wiley.com" title="Link to external resource: http://www.interscience.wiley.com">www.interscience.wiley.com</a>). DOI 10.1002/ecjb.20428</p></div>]]></content:encoded><description>The purpose of this study is to establish a method for estimating the sea wave period by satellite radar altimetry. The backscatter coefficient, which is closely related to the period, is evaluated by computer simulation. Specifically, the following method is presented. The sea wave is modeled on the basis of the Pierson–Moskowitz spectrum. The average received power is determined by radar altimetry simulation of our proposal. It is shown that the backscatter coefficient of the sea surface can be calculated on a relative basis. Using the data for the relative received power calculated from various sea wave parameters, the relation between the significant wave height and the backscatter coefficient, and also the relation between the significant wavelength and the backscatter coefficient, are derived. Thus, the possibility of observing the sea wave period by using satellite radar altimetry is demonstrated. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 90(12): 121–128, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjb.20428</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20406" xmlns="http://purl.org/rss/1.0/"><title>Time series prediction model for sequential learning</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20406</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Time series prediction model for sequential learning</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Manabu Gouko, Yoshihiro Sugaya, Hirotomo Aso</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2007-11-12T00:00:00-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/ecjb.20406</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/ecjb.20406</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fecjb.20406</prism:url><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">129</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">139</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>As a time series prediction model for sequential learning considering memory size limitations, this paper proposes the Adaptive and Sequential Learning Network (ASLN) model. The proposed model sequentially memorizes time sequence information given as the input and then performs prediction based on the memory. While effective use of the memory capacity is attempted for changes in the ambient environment, the model can follow up by varying its own memory. The model memorizes the elements contained in the input time series and the information on their transitions. It identifies the elements with a higher frequency of inputs among the time series and memorizes them as priority items. Information on the transitions of the input elements is represented as a state vector and is memorized by a layered neural network. The state vector maintains information on the past input sequence so that expression of the context is possible. A numerical experiment shows that the proposed model can predict a time series while tracking environmental changes. An experiment on learning of a number sequence was performed, using handwritten number patterns containing fluctuations. The prediction capability was verified with an increasing number of patterns. Guidelines are also provided for setting of parameters, which is important when the model memorizes the transition information of the time series. © 2007  Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 90(12): 129–139, 2007; Published online in Wiley InterScience (<!--TODO: clickthrough URL--><a href="http://www.interscience.wiley.com" title="Link to external resource: http://www.interscience.wiley.com">www.interscience.wiley.com</a>). DOI 10.1002/ecjb.20406</p></div>]]></content:encoded><description>As a time series prediction model for sequential learning considering memory size limitations, this paper proposes the Adaptive and Sequential Learning Network (ASLN) model. The proposed model sequentially memorizes time sequence information given as the input and then performs prediction based on the memory. While effective use of the memory capacity is attempted for changes in the ambient environment, the model can follow up by varying its own memory. The model memorizes the elements contained in the input time series and the information on their transitions. It identifies the elements with a higher frequency of inputs among the time series and memorizes them as priority items. Information on the transitions of the input elements is represented as a state vector and is memorized by a layered neural network. The state vector maintains information on the past input sequence so that expression of the context is possible. A numerical experiment shows that the proposed model can predict a time series while tracking environmental changes. An experiment on learning of a number sequence was performed, using handwritten number patterns containing fluctuations. The prediction capability was verified with an increasing number of patterns. Guidelines are also provided for setting of parameters, which is important when the model memorizes the transition information of the time series. © 2007  Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 90(12): 129–139, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjb.20406</description></item></rdf:RDF>