Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
People Detection Based on Spatial Mapping of Friendliness and Floor Boundary Points for a Mobile Navigation Robot //// Hindawi Publishing Corporation Home Journals About Us About this Journal Submit a Manuscript Table of Contents Journal Menu Abstracting and Indexing Aims and Scope Annual Issues Article Processing Charges Articles in Press Author Guidelines Bibliographic Information Contact Information Editorial Board Editorial Workflow Free eTOC Alerts Reviewers Acknowledgment Subscription Information Open Focus Issues Published Focus Issues Focus Issue Guidelines Open Special Issues Published Special Issues Special Issue Guidelines Abstract Full-Text PDF Full-Text HTML Full-Text ePUB Linked References How to Cite this Article Complete Focus Issue Journal of Robotics Volume 2011 (2011), Article ID 683975, 10 pages doi:10.1155/2011/683975 Research Article <h2>People Detection Based on Spatial Mapping of Friendliness and Floor Boundary Points for a Mobile Navigation Robot</h2> Tsuyoshi Tasaki , 1 Fumio Ozaki , 2 Nobuto Matsuhira , 3 Tetsuya Ogata , 4 and Hiroshi G. Okuno 4 1 Toshiba Corporate Research & Development Center, 1, Komukai-Toshiba-cho, Saiwai-ku, Kawasaki 212-8582, Japan 2 Toshiba Corporation, Power Systems Company, 1-1, Shibaura 1-Chome, Minato-ku, Tokyo 105-8001, Japan 3 Department of Engineering Science and Mechanics, Shibaura Institute of Technology, 3-7-5, Toyosu, Koto-ku, Tokyo 135-8548, Japan 4 Graduate School of Informatics, Kyoto University, Yoshida-honmachi, Sakyo-ku, Kyoto 606-8501, Japan Received 14 July 2011; Revised 7 November 2011; Accepted 8 November 2011 Academic Editor: Danica Kragic Copyright © 2011 Tsuyoshi Tasaki et al. This is an open access article distributed under the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract Navigation robots must single out partners requiring navigation and move in the cluttered environment where people walk around. Developing such robots requires two different people detections: detecting partners and detecting all moving people around the robots. For detecting partners, we design divided spaces based on the spatial relationships and sensing ranges. Mapping the friendliness of each divided space based on the stimulus from the multiple sensors to detect people calling robots positively, robots detect partners on the highest friendliness space. For detecting moving people, we regard objects’ floor boundary points in an omnidirectional image as obstacles. We classify obstacles as moving people by comparing movement of each point with robot movement using odometry data, dynamically changing thresholds to detect. Our robot detected 95.0% of partners while it stands by and interacts with people and detected 85.0% of moving people while robot moves, which was four times higher than previous methods did. 1. Introduction Mobile navigation robots are expected to move smoothly at big facilities such as big supermarkets, museums, and airports [ 1 , 2 ]. Navigation robots are also expected to detect people that robots should navigate. Figure 1 shows a proposed navigation robot system. Our navigation robot system detects people who call the robot positively before navigation. When a person wants navigation service, our robot navigates the person to the destination by moving smoothly with detecting moving obstacles and avoiding them. Moving obstacles are dangerous, because the movements are not predicted easily. This paper focuses to describe people detection for our navigation robot system while robot stands by and moves. Figure 1: Our navigation robot system. People that robots want to detect while standing by are different from people that robots want to detect while moving. While standing by and interacting with people, the robot has to detect “people that call the robot positively” in order to offer a navigation service. While moving, it is important for a robot to detect all “moving people (obstacles)” around the robot in order to move smoothly. Moreover, the feature of people detection is different, too. One different feature is related to calculation cycle. While standing by and interacting with people, slower people detection can be allowed comparing to the people detection for moving. Therefore, the robot can use multiple sensors that are used naturally in human-human interaction. For example, the sensors are cameras (eyes), microphones (ears), and tactile sensors (skins). While the robot moves, it needs fast people detection for safety and does not have to use all sensors that are used for interaction. Therefore, detection by one sensor is desirable while moving. The other feature is related to localization accuracy (resolution). The robot does not need very high resolution for interaction. While interaction, it is efficient to use appropriate resolution for interaction. On the other hand, while the robot moves, it needs high resolution and it wants to detect people accurately. Recently, many works use distance measurement devices such as the Laser Range Finder (LRF) and stereo cameras [ 3 – 6 ] for people detection while interaction and moving. However, robots have to be equipped with more than one sensor when they classify all obstacles around them at once by the devices. Using many LRFs is expensive, and calibrating many cameras is troublesome. Using same kinds of multiple sensors is not desirable while moving. Moreover, these works do not deal with detecting people who call a robot. In order to detect all moving people around a robot by using one sensor while the robot moves, an omnidirectional camera is useful. However, it is difficult to apply the previous methods that classify obstacles as moving people or not [ 7 – 10 ] to distorted omnidirectional images without modifying them to undistorted images. Even if we modify images, the previous methods do not work well because modified images lose a lot of information. Moreover, classifying obstacles as moving people or not by a mobile camera is more difficult than classifying them by a static camera. We deal with two problems related to the people detection for a mobile navigation robot. One is detecting interaction partners who call a robot positively from among multiple people by using cameras, microphones, and tactile sensors. The other is classifying all obstacles around the robot as moving people or not by only one omnidirectional camera while the robot moves. While robots stand by and interact with people, we have developed a method for detecting an interaction partner based on the degree of friendliness as mapped onto the “space”, considering interaction distance and the range of multiple sensors for interaction. For obstacle classification, we have also developed a new method that focuses on objects’ floor boundary points where the robot can measure the distance from itself by only one omnidirectional camera. Our robot classifies a floor boundary point as a moving person when its movement is different from the robot’s movement. Solving these two problems, we have developed a mobile navigation robot which can select an appropriate person who calls the robot positively while robot stands by and can detect moving people while the robot moves. A contribution of this paper is developing the people detection method for the navigation robot while the robot stands by and moves. Section 2 describes our friendliness space map showing how friendliness is distributed in the space in order to detect an interaction partner. Section 3 describes the obstacle classification method based on tracking floor boundary points. In Section 4 , we show the result of questionnaires and confirm an accuracy of our classification method. Section 5 concludes this paper. 2. Interaction Partner Detection by Friendliness Space Map While Interaction 2.1. Distance between the Robot and People While Interaction 2.1.1. Interaction Distance of People When people interact with each other, the distance between them is associated with their degree of friendliness. Proxemics [ 11 ], which is a social psychology theory, says that two people interact at an appropriate physical distance from one another based on their relationship. In this theory, the interaction distance can be classified into roughly four groups: intimate, personal, social, and public. (i) Intimate distance (approximately 50 cm): people can communicate via physical interaction and express strong emotions. (ii) Personal distance (approximately 50–120 cm): people can talk intimately. (iii) Social distance (approximately 120–360 cm): people do not know each other well. (iv) Public distance (approximately 360 cm and more): people who have no personal relationship with each other can comfortably coexist at this distance. These distances can be used to set the degree of friendliness between the robot and each person, which shows how positively each person calls the robot. The distances shown in parentheses are only typical ones. They depend on each person’s personality and cultural background. 2.1.2. Effective Distance of Robot’s Function Since most functions and devices used by a robot are not effective for all distances, we assessed the effective distance for them. We investigated the effective distance of tactile recognition, speech recognition, sound source localization, and face localization, which are implemented into many robots as general functions. (1) Tactile Recognition Tactile recognition is done using tactile sensors, which are effective when people can touch the robot. The average length of a person’s arm is up to 50 cm. This distance is similar to the intimate distance. (2) Speech Recognition To determine the range for speech recognition, we place a speaker in front of a robot at every 50 cm from 50 cm to 3.0 m and played 200 words of the ATR phonetically balanced corpus [ 12 ]. The results of isolated word recognition using Julian [ 13 ], general Japanese automatic speech recognition software, show that the recognition rate is more than 85% for distances less than 1.5 m. Automatic speech recognition was found to be effective up to around 1.5 m. (3) Sound Source Localization A well-known sound source localization function uses the Interaural Phase Difference (IPD) and Interaural Intensity Difference (IID) [ 14 ]. The effective distance of sound source localization on average and the standard deviations were estimated in our laboratory. Three directions were evaluated separately. The horizontal direction was specified from right (0 deg) to left (180 deg), and the center was 90 deg. The localization errors were small (less than 3 deg) for distances less than about 3 m. Therefore, sound source localization should be stable up to around 3 m. (4) Face Localization We use MPIsearch [ 15 ] for face localization. The robot can measure the distance and direction. MPIsearch requires an image at least 12 by 12 pixels to detect a face. Such images correspond to a distance of 4.0 to 5.0 meters. In general, the effective distance of face localization is up to the public distance. This distance is decided by the size of template, the size of captured image, and the angle of view. The distance is not related to a selected algorithm very much. Detail discussions of effective distances are described in [ 16 ]. 2.1.3. Interaction Distance and Effective Distance of Functions The relationship between the interaction distance and the effective distance for the four functions is shown in Table 1 . As shown in the table, effective distance for the functions can correspond to the interaction distance effectively. Table 1: Relationship between distance and function. 2.2. Friendliness Space Map 2.2.1. Design Friendliness Space Map The sensor functions a robot can use effectively differ depending on the distance between the robot and each person. In other relational studies, the robot always used all sensors and interacted with people by focusing on the people. In our study, the robot interacted with people by focusing on the “space” of the people. In particular, the robot acted based on the space around the robot, segmented as described in Table 1 . Given the size of a person’s face and the accuracy of the robot’s functions, the direction element of space must be segmented to some extent. We segmented the space every 15 degrees based on the average size of the human face (16 cm × 23 cm) and the errors of functions within the personal distance. To identify the intimate space for the robot to interact with, we defined polar coordinates as shown in Figure 2 . These coordinates, which are segmented into cells, are called a “Friendliness Space Map.” Our robot calculates the “friendliness” of cell ( 𝑟 , 𝜃 ) using information about the location of people and comfortable/uncomfortable stimuli. To calculate the friendliness which shows how positively people call the robot, when a function is initiated by sensor input, our robot calculates the Human Existence Degree (HED), which shows whether people exist or not, of cells within the effective area of each function. For example, three areas where our robot calculated the HED are shown in Figure 2 : (1) in the case the right side of the robot is touched, (2) in the case the robot detects sound, and (3) in the case the robot detects face. Figure 2: Friendliness space map and effective area of functions. The effects of detecting the interaction partner using this map are as follows. (i) Since a robot can change its motion and select an interaction partner based on the friendliness of various spaces, it can attract people while it stands by. (ii) The action selection based on space can also be applied to various other objects. 2.2.2. Definition of Human Existence Degree by Integration of Functions In each cell on the map, the HED is calculated by taking advantage of the integrated functions. When a function 𝑘 locates a person at time 𝑡 𝑘 0 , it calculates the HED, 𝐿 𝑘 , 𝑡 , 𝑟 , 𝜃 , of cell ( 𝑟 , 𝜃 ) within the effective function area at time 𝑡 , as shown in ( 1 ). The 𝑘 ( 𝑘 = 1 , 2 , 3 ) is the functions, and 𝑑 𝑘 is the damping ratio which is decided based on the degree of confidence obtained by previous experiments of each function. The damping ratio introduced for expressing the accuracy of sensing becomes low as time goes by. Here, 𝐿 is related to only time 𝑡 for simplicity, though 𝐿 may be related to many parameters. 𝑡 𝑘 0 is renewed every time function 𝑘 operates: 𝐿 𝑘 , 𝑡 , 𝑟 , 𝜃 = e x p − 𝑑 𝑘 𝑡 − 𝑡 𝑘 0 . ( 1 ) The HED calculated by integration of all functions, 𝐸 𝑡 , 𝑟 , 𝜃 , of cell ( 𝑟 , 𝜃 ) at time 𝑡 is defined as the sum of the HED of each function: 𝐸 𝑡 , 𝑟 , 𝜃 = 3 𝑘 = 1 𝐿 𝑘 , 𝑡 , 𝑟 , 𝜃 . ( 2 ) 2.2.3. Shift in Friendliness by Stimulus The cells on the Friendliness Space Map are affected by the kind of stimulus which shows positivity or negativity. Our robot recognizes two kinds of stimuli by using tactile recognition. One is uncomfortable stimuli which show negativity, such as hitting the robot’s head or touching the robot’s bust. The other is comfortable stimuli which show positivity, such as patting the robot’s head. These stimuli are decided by human-human interaction when a person selects interaction partner. Comfortable stimuli are used to call person. On the other hand, uncomfortable stimuli are used to just tease. Since tactile recognition cannot localize people precisely, we assume that the person delivering the stimulus is in the cell with the highest HED within the intimate distance. That is, it is cell ( 1 , 𝜃 ), as obtained using 𝜃 = a r g m a x 𝜃 𝐸 𝑡 , 1 , 𝜃 . ( 3 ) If the stimulus occurs at time 𝑡 𝐶 0 , we define the Comfortable Degree (CD), 𝐶 𝑡 , 1 , 𝜃 , of cell ( 1 , 𝜃 ) selected at time 𝑡 as shown in ( 4 ). Here, 𝑑 𝐶 denotes the damping ratio, and 𝑣 denotes the kind of stimulus. When the stimulus is comfortable, 𝑣 is 1. When the stimulus is uncomfortable, 𝑣 is −1. 𝑡 𝐶 0 is renewed every time a stimulus is received: 𝐶 𝑡 , 𝑟 , 𝜃 = 𝑣 × e x p − 𝑑 𝐶 𝑡 − 𝑡 𝐶 0 . ( 4 ) 2.2.4. Definition of Friendliness The Friendliness Space Map is renewed and consists of both the HED and the CD obtained using the robot’s functions. The friendliness, 𝐼 𝑡 , 𝑟 , 𝜃 , of cell ( 𝑟 , 𝜃 ) at time 𝑡 is defined as the sum of the HED and the CD as shown in ( 5 ), where 𝑊 𝐿 and 𝑊 𝐶 correspond to the weights of the HED and the CD, respectively. In this time, we make 𝑊 𝐶 bigger than 𝑊 𝐿 because we want a robot to be sensitive to the stimulus: 𝐼 𝑡 , 𝑟 , 𝜃 = 𝑊 𝐿 × 𝐸 𝑡 , 𝑟 , 𝜃 + 𝑊 𝐶 × 𝐶 𝑡 , 𝑟 , 𝜃 . ( 5 ) 3. Moving People Detection by Classifying Obstacles Based on Floor Boundary Points While Moving 3.1. Floor Boundary Points Detection 3.1.1. Floor Detection by Ward’s Clustering We use floor colors for floor detection because floor colors are generally simple. Previous works use the Gaussian Mixture Model (GMM) for specific color detection [ 17 ]. The GMM can detect many specific colors, increasing a number of a mixed Gaussian. However, we have to evaluate the GMM many times in order to decide parameters such as the number of mixed Gaussian. Therefore, it is difficult for robots to apply the GMM to various environments quickly and accurately just after they start up. Our robot learns representative colors of the floor by itself based on the distribution of floor color data without prior setting. Considering the distribution, our floor detection method can adjust more easily than the GMM can and detects the floor as accurately as the GMM does. Here, in order to detect the representative colors of the floor, we assume that our robot is activated in the free space. Moreover, we use Ward’s clustering [ 18 ], which is one of the hierarchical clustering methods. Our robot selects the representative colors by Ward’s clustering as follows. (1) Our robot takes an image and gets 𝑁 color data from pixels to which the close area around it is projected. In an initial state, each datum shows a representative color. A cluster of color data that are similar to the representative color 𝑖 is denoted by 𝐶 𝑖 . (2) We choose two clusters 𝐶 1 and 𝐶 2 that minimize 𝐷 as shown in ( 6 ) and create a new cluster 𝐶 𝑘 that consists of the data in both 𝐶 1 and 𝐶 2 . Let 𝑐 𝑖 denote an average color vector in the cluster 𝐶 𝑖 : 𝐷 𝐶 1 , 𝐶 2 𝐶 = 𝑑 1 ∪ 𝐶 2 𝐶 − 𝑑 1 𝐶 − 𝑑 2 , 𝑑 𝐶 1 = 𝑥 ∈ 𝐶 𝑖 ‖ ‖ 𝑥 − 𝑐 𝑖 ‖ ‖ . ( 6 ) (3) In step 2, when 𝐶 𝑘 satisfies both ( 7 ) and ( 8 ), it is decided that 𝑐 𝑘 is the representative color and data in 𝐶 𝑘 are not used for following loops. When 𝐶 𝑘 satisfies only ( 7 ), data in 𝐶 𝑘 are just not used for following loops. 𝑇 𝐷 and 𝑇 𝑁 are constant thresholds, | 𝐶 𝑘 | is a number of the data in 𝐶 𝑘 : m i n 𝑘 ≠ 𝑖 𝐷 𝐶 𝑘 , 𝐶 𝑖 > 𝑇 𝐷 , | | 𝐶 ( 7 ) 𝑘 | | > 𝑇 𝑁 . ( 8 ) (4) Steps 2 and 3 continue until all data are not used. Because Ward’s clustering considers the distribution of data, each cluster is identified easily by Mahalanobis distance. A color datum 𝐼 is classified as floor color when we find a 𝐶 𝑜 that satisfies ( 9 ). 𝜇 𝑜 , Σ 𝑜 , and 𝜎 denote an average vector, a covariance matrix of data in 𝐶 𝑜 , and a threshold, respectively: 𝐼 − 𝜇 𝑜 𝑇 Σ 𝑜 − 1 𝐼 − 𝜇 𝑜 < 𝜎 . ( 9 ) When a robot uses an omnidirectoinal camera mounted on its head, the floor is projected to around the image center. Therefore, our robot classifies the pixels from center to outer by applying ( 9 ). If our robot finds continuous 𝑝 pixels that do not satisfy ( 9 ), a floor boundary point is detected at the position where the first pixel in 𝑝 pixels is located. These points show the boundary between the free space and obstacles and can be tracked easily. We have already confirmed that our floor detection method can work well on the supermarket floor [ 19 ]. However, not all points locate on the boundary between the floor and obstacles. We change dynamically by the method described in Section 3.2.2 . 3.1.2. Transforming Coordinates of Floor Boundary Points from Image Coordinates to Robot Coordinates In the case of using an omnidirectional camera incorporating a hyperbolic mirror, a position ( 𝑋 , 𝑌 , 𝑍 ) on the robot coordinates is projected to a position ( 𝑥 , 𝑦 ) on the image coordinates as follows [ 20 ]. Constants 𝑏 and 𝑐 denote proper parameters of the mirror, and 𝑓 denotes a focal distance: 𝑏 𝑥 = 𝑋 𝑓 2 − 𝑐 2 𝑏 2 + 𝑐 2 √ ( 𝑍 − 𝑐 ) − 2 𝑏 𝑐 𝑋 2 + 𝑌 2 + ( 𝑍 − 𝑐 ) 2 , 𝑏 𝑦 = 𝑌 𝑓 2 − 𝑐 2 𝑏 2 + 𝑐 2 √ ( 𝑍 − 𝑐 ) − 2 𝑏 𝑐 𝑋 2 + 𝑌 2 + ( 𝑍 − 𝑐 ) 2 . ( 1 0 ) Many robots are equipped with an omnidirectional camera, and they can measure or know the distance from the floor to the camera while they are moving [ 21 , 22 ]. Therefore, with regard to floor boundary points, the variable 𝑍 in ( 10 ) becomes constant, and we can measure the distance from the robot to floor boundary points by applying ( 10 ). In order to decide the parameters 𝑍 , 𝑏 , 𝑐 , and 𝑓 , we have drawn cross-stripes on the floor as shown in Figure 3 (a). 𝑛 pairs of ( 𝑋 𝑎 , 𝑌 𝑎 ) and ( 𝑥 𝑎 , 𝑦 𝑎 ) are acquired from the image to which 𝑛 cross-points are projected. Here, ( 𝑋 𝑎 , 𝑌 𝑎 ) and ( 𝑥 𝑎 , 𝑦 𝑎 ) denote the position of the cross-point 𝑎 on the robot coordinates and the image coordinates, respectively. Using 𝑛 pairs, parameters that minimize the evaluation function 𝐹 𝑣 as shown in ( 11 ) are decided by the downhill simplex method: 𝐹 𝑣 = 𝑛 − 1 𝑎 = 0 | | | | | | 𝑥 𝑎 − 𝑋 𝑎 𝑓 𝑏 2 − 𝑐 2 𝑏 2 + 𝑐 2 ( 𝑍 − 𝑐 ) − 2 𝑏 𝑐 𝑋 2 𝑎 + 𝑌 2 𝑎 + ( 𝑍 − 𝑐 ) 2 | | | | | | + 𝑛 − 1 𝑎 = 0 | | | | | | 𝑦 𝑎 − 𝑌 𝑎 𝑓 𝑏 2 − 𝑐 2 𝑏 2 + 𝑐 2 ( 𝑍 − 𝑐 ) − 2 𝑏 𝑐 𝑋 2 𝑎 + 𝑌 2 𝑎 + ( 𝑍 − 𝑐 ) 2 | | | | | | . ( 1 1 ) Figure 3: The omnidirectional image of the cross-stripes on the floor (a) and the bird’s eye images (b). For confirmation of parameters, a bird’s-eye image is created by using the decided parameters. Figure 3 (b) shows the bird’s-eye image. The lines that make cross-stripes on the floor are not distorted, because the decided parameters are corrected. Here, 1 pixel in this bird’s-eye image denotes about 5.0 cm in the real world. 3.2. Obstacle Classification by Floor Boundary Points 3.2.1. Classification Equation A floor boundary point 𝑚 on the image at time 𝑡 − d 𝑡 is detected by the method as shown in Section 3.1 . d 𝑡 depends on a processing speed. If the point 𝑚 can be tracked from 𝑡 − d 𝑡 to 𝑡 correctly, the position of 𝑚 at 𝑡 is located correctly on the image at 𝑡 . Here, we use Lucas Kanade tracker algorithm with image pyramid representation [ 23 ] as a tracking method. The tracking method works well even in the omnidirectional image as shown in [ 24 ]. It is easy to transform the coordinates of 𝑚 at 𝑡 − d 𝑡 and 𝑡 from the image coordinates to the robot coordinates ( 𝑋 𝑚 , 𝑌 𝑚 ) ( 𝑡 − d 𝑡 ) and ( 𝑋 𝑚 , 𝑌 𝑚 ) ( 𝑡 ) by referring to the bird’s-eye image. The relative position ( d 𝑋 , d 𝑌 , d Θ ) from 𝑡 − d 𝑡 to 𝑡 is estimated by odometry data. d Θ is based on the direction from the center of the robot to the front of the robot at 𝑡 − d 𝑡 . When 𝑚 is located at the boundary between a static obstacle and the floor, ( 𝑋 𝑚 , 𝑌 𝑚 ) ( 𝑡 ) is calculated by ( d 𝑋 , d 𝑌 , d Θ ) and ( 𝑋 𝑚 , 𝑌 𝑚 ) ( 𝑡 − d 𝑡 ) , as shown in ( 12 ): ⎛ ⎜ ⎜ ⎝ 𝑋 𝑚 𝑌 𝑚 ⎞ ⎟ ⎟ ⎠ ( 𝑡 ) = ⎛ ⎜ ⎜ ⎝ ⎞ ⎟ ⎟ ⎠ ⎛ ⎜ ⎜ ⎝ 𝑋 c o s d Θ − s i n d Θ s i n d Θ c o s d Θ 𝑚 𝑌 𝑚 ⎞ ⎟ ⎟ ⎠ ( 𝑡 − d 𝑡 ) + ⎛ ⎜ ⎜ ⎝ ⎞ ⎟ ⎟ ⎠ . d 𝑋 d 𝑌 ( 1 2 ) When 𝑚 is located at the boundary between a moving obstacle (person) and the floor, ( 12 ) is not satisfied. Therefore, we can regard ( 12 ) as a Classification Equation (CE); that is, the floor boundary point 𝑚 can be classified as a static obstacle or a moving one by confirming whether ( 12 ) is satisfied or not. Actually, ( 12 ) includes a small error 𝜺 depending on an image resolution and uncertainty in sensing, which is ignored. The following conditions should be satisfied in order to regard ( 12 ) as the classification equation. (1) Floor boundary points have to be located at the boundary between obstacles and the floor correctly in the image. (2) Floor boundary points have to be tracked correctly. (3) Camera parameters have to be decided correctly. (4) Odometry has to be calculated correctly. Condition 4 is satisfied in the general environment, because the odometry is comparatively correct during short movement. Figure 3 verifies that parameters are not so bad that condition 3 is satisfied, too. Floor boundary points can be tracked easily and tracking is not a major problem by the tracking method [ 25 ] when they are detected accurately, because they are located at the boundary where the colors change significantly. However, floor boundary points cannot always be detected correctly by using only the floor colors in various environments. We apply the result of confirming whether the CE is satisfied or not to the floor detection method. 3.2.2. Obstacle Classification The CE is satisfied as long as floor boundary point 𝑚 is located on the floor. One of the reasons why 𝑚 is not located on the floor is that the threshold 𝜎 in ( 9 ) is inappropriate. When the position of 𝑚 does not satisfy the CE, 𝜎 is too large or 𝑚 shows a moving obstacle. For confirmation, new floor boundary point 𝑚 is detected by decreasing 𝜎 in the direction where 𝑚 is located to 𝜎 − d 𝜎 . The parameter d 𝜎 should be small so that the robot does not narrow the floor area. The new floor boundary point 𝑚 is tracked from 𝑡 to 𝑡 − d 𝑡 and classified by confirming the CE again. When the position of 𝑚 satisfies the CE, our robot regards 𝑚 as a static obstacle. Moreover, the position of 𝑚 is changed to the position of 𝑚 . Conversely, if it is not satisfied, 𝑚 is regarded as a moving obstacle. Our method changes the parameter dynamically by the result of the CE. For example, in Figure 4 , the position of floor boundary point 𝐴 located at the boundary between the floor and a static obstacle satisfies the CE. The point 𝐵 that is not located at the boundary does not satisfy the CE. Therefore, 𝐵 creates a new floor boundary point 𝐵 and 𝐵 is tracked from 𝑡 to 𝑡 − d 𝑡 . Using the result of tracking, our robot confirms whether 𝐵 satisfies the CE or not. Because 𝐵 is located at the boundary, 𝐵 satisfies the CE in this case. Therefore, the position of 𝐵 is changed to the position of 𝐵 and 𝐵 is classified as a static obstacle. The point 𝐶 located at the boundary between a moving obstacle and the floor also does not satisfy the CE. The point 𝐶 creates a new point 𝐶 and its position is confirmed. Because d 𝜎 is small, the point at the boundary does not create a new point far from the original point. The position of 𝐶 does not satisfy the CE in this case, and 𝐶 is regarded as a moving obstacle. Figure 4: The example of classification process by using floor boundary points. Triangles are tracked from the left image to the right image. Circles are tracked from the right image to the left image. The robot moves by 20 cm. If the threshold is low at the beginning of the robot’s activation, all points are located on the floor. However, they are located between the boundary and the robot, and free space looks very small. Our classification method first uses high thresholds and detects the boundary that is a little larger than the true boundary. Moving and confirming the CE refine the threshold of each direction where the floor boundary point classified as a moving obstacle is located. Finally, the robot adapts the threshold of each direction and makes it possible to locate and classify obstacles accurately. When the illumination and floor color change, our robot adapts the threshold again. 4. Evaluation 4.1. Our Robot and Experimental System Our people detection method is implemented on our robot called ApriTau as shown in Figure 5 left. It has a vehicle that can acquire the odometry data. An omnidirectional camera is mounted on the top of its head and does not move with the head motion. Taking images while moving, it synchronizes the odometry data. ApriTau takes images whose size is 320 × 240 pixels continuously at 30 fps. It has microphones and touch sensors. It can detect people by using these sensors based on the method as shown in Section 2.2.1 . It can move its head and gaze at the interaction partner. Figure 5: ApriTau and experimental setting. Figure 6 shows our obstacle classification system while robot moves. The inputs are continuous omnidirectional images. The outputs are the results of the classification of each direction. The system detects 360 floor boundary points using the result of tracking previous points or the floor detection method in image at 𝑡 − d 𝑡 . Red squares or blue points are floor boundary points in Figure 7 . 360 points are detected every one degree. These points are tracked and classified. In Figure 7 , blue points and red squares are classified as static obstacles and moving obstacles (people), respectively. Most of them are located at the boundary between the floor and obstacles. A red line is drawn from the image center to the average of red points’ positions. This system integrates floor boundary points which are classified as moving obstacle like the red line, when points which are classified as moving obstacles are located near (less than 10 degree) the other points which are classified as moving obstacles. In order to learn the floor color, our robot is activated in the free space whose size is 1.0 (m) by 2.0 (m). We assume that we can find the space before opening facilities. Figure 6: The whole system of classification. Figure 7: The output of classification system. In these experiments, the thresholds 𝑇 𝐷 and 𝑇 𝑁 and the parameter 𝑝 as shown in Section 3.1 for floor detection are 18000, 10 pixel, and 3, respectively. These thresholds and parameters are decided experimentally, considering the resolution of the image. 4.2. Confirmation of Detecting People While the Robot Stands by and Interacts with People 4.2.1. Aim and Sequence of Experiment We investigated whether our method detects interaction partner while the robot stands by and interacts with people. We asked 4 people to interact with our robot freely. Our robot looks at the highest friendliness place and talks with people by using only simple words. Two labelers observe their interaction and select interaction partners whom our robot should interact with on the second time base. We evaluate our method by two values 𝐸 1 and 𝐸 2 as shown in ( 13 ) and ( 14 ): 𝑇 𝐸 1 = r o b 𝑇 l a b , 𝑇 ( 1 3 ) 𝐸 2 = e x i s t 𝑇 o u t . ( 1 4 ) 𝑇 l a b shows the duration when two labelers select same partners. 𝑇 r o b shows the duration when two labelers and our robot select same partners. 𝑇 o u t shows the duration when our robot outputs detecting people. 𝑇 e x i s t shows the duration when our robot outputs detecting people correctly. 4.2.2. Result and Discussion The experimental results show that 𝐸 1 denotes 0.95 and 𝐸 2 denotes 0.87. We think that 𝐸 1 is high enough to detect people who call robots. 𝐸 1 is higher than 𝐸 2 , which shows that our robot can especially select people whom humans (labelers) can select by only observing the interaction. One of the reasons why 𝐸 2 is a little low is that people do not always call the robot. Therefore, both our robot and labelers do not select the person to interact with. We think that it is not a problem because our system aims to detect people who call robots. 4.3. Evaluation of Obstacle Classification 4.3.1. Aim and Sequence of Experiment In order to confirm the effectiveness of changing the threshold 𝜎 dynamically based on the result of the CE, we compared the classification ratio of our method with that of a simple method using a constant threshold and that of a previous method. As the previous method, we use the method that modifies omnidirectional images to general images and detects movements that is different from movements of background, as shown in [ 26 ]. The color of the floor is not complex. The experimental steps are as follows. (1) ApriTau and another robot move on the given route. They pass each other. (2) ApriTau takes images synchronized with odometry data continuously while moving. (3) The images and the odometry data are input to the systems of our method, the simple method, and the previous method. Note that although same data are input to three systems, each system processes some of them because of the difference of the processing speed. (4) The classification ratios of our method, the simple method, and the previous method are calculated by outputs. In this experiment, the classification ratio is the 𝐹 value calculated by the recall ratio 𝑅 and the precision ratio 𝑃 as shown in ( 15 ). Here, 𝑁 𝐴 , 𝑁 𝑂 , and 𝑁 𝐶 show the number of images to which another moving robot is projected, the number of obstacles the system classified as moving obstacles, and the number of moving obstacles the system outputs and locates correctly, respectively: 𝑁 𝑅 = 𝐶 𝑁 𝐴 𝑁 , 𝑃 = 𝐶 𝑁 𝑂 , 𝐹 = 2 𝑅 𝑃 . ( 𝑅 + 𝑃 ) ( 1 5 ) 4.3.2. Result and Discussion The classification ratios of three methods are shown in Table 2 . The classification ratio of our method is 4 times higher than that of the simple method and that of the previous method. In particular, the improvement of the precision ratio affects the 𝐹 value. One of the reasons why the precision ratio of our method is much higher than that of the simple method is that ApriTau can select floor boundary points showing candidates of moving obstacles by the CE and relocate points correctly by strengthening the threshold detecting each point. The result shows that the accuracy of locating points greatly affects classification ratio. One of the reasons why the 𝐹 value of the previous method is low is losing information by changing omnidirectional images to general images. Another reason is that ApriTau and another robot pass each other. The movement of another robot is similar to the movement of background, and the previous method cannot detect another robot. Table 2: The classification ratios. However, the precision ratio of our method is a little low for robots’ smooth movement. In this paper, we assume that errors of tracking points are very small, which is certainly correct to some extent for the image coordinates. In the case of omnidirectional camera image, the distance resolution changes depending on the distance from the image center. It is very low for a distant place. Tracking errors of a few pixels become errors of a few meters for the world coordinates. Because of errors of a few meters, ( 12 ) does not work as the CE. When the floor boundary point is located at a position distant from the center of the image, we have to track it for a longer time and use its average movement. Moreover, it also might be effective to use adaptive scheme instead of the fixed parameter 𝑑 𝜎 as shown in Section 3.2.2 . 4.4. Evaluation of Moving People Detection 4.4.1. Aim and Sequence of Experiment In order to confirm our method detects moving people, we calculate the classification ratio in various patterns. In this experiment, a person and ApriTau move on the given route as shown in Figures 8 , 9 , and 10 . In order to confirm basic ability of our method, ApriTau and one person go straight and rotate. As same as the experiment in Section 4.3 , ApriTau takes images synchronized with odometry data and the classification ratio of our method is calculated. Figure 8: The experimental setting (Pattern 1 and 3). Figure 9: The experimental setting (Pattern 2 and 4). Figure 10: The experimental setting (Pattern 5). 4.4.2. Result and Discussion The classification ratios in each pattern are shown in Table 3 . The classification ratios in the case of the person walking (Patterns 1 and 2) are higher than 0.77, which is as high as the classification ratios in Section 4.3 . The classification ratios in the case of the person running (Patterns 3 and 4) are a little low. One of the reasons why the classification ratios are a little low is that the boundary between the running person and the floor is more complex than the boundary between the walking person and the floor. The complex boundary can make robots fail to detect floor boundary points accurately. We think that increasing floor boundary points can solve this problem. Table 3: The classification ratios in various patterns. The classification ratio in the case of the robot rotation (Pattern 5) is also a little low. One of the reasons why the classification ratio is a little low is that tracking area in the image in the case of rotation changes more than tracking area in the case of straight transition (Patterns 1–4) does. Changing tracking area very much makes robots fail to track the floor boundary points. Moreover, we need to synchronize the timestamps between odometry and images. We also think that it is effective to take into account uncertainty in sensing. The accuracy of odometry or tracking differs according to the robot movement. We have to use probabilistic method in the future work. 5. Conclusion This work has dealt with two problems related to people detection that is needed for the navigation robot system. One is how robot detects the person who calls it positively while standing by in order to select a person. The other is how one moving omnidirectional camera detects all moving people around the robot while moving in order to move safely. Changing the people detection methods according to tasks of the robot, we aim to select the person who needs navigation and detect moving people while robot moves in particular for safety. In order to solve the first problem, we have developed a people detection method based on the “friendliness space map,” which focuses on the “space” rather than the person to find and select people who call our robot positively. In order to solve the second problem, we have developed the new method that focuses on floor boundary points where one omnidirectional camera can measure the distance from the robot.The points are detected by the floor detection method using Ward’s clustering to find representative colors and Mahalanobis distance to identify floor colors. For detecting moving people, our robot tracks the floor boundary points. Comparing the robot’s movement with floor boundary points’ movement, our robot detects moving people and dynamically changes the threshold that the floor detection uses. We performed three experiments. The first experimental result showed that our robot detects 95% of the person who calls the robot positively by using friendliness space map. In the second experiment, we confirmed the classification ratio increased to 85%, which was four times higher than that of a previous method. The third experimental result showed that our method could detect a moving person in various situations. In future work, we plan to evaluate our navigation system in a crowded place such as a real supermarket. (This paper is an extended version of a conference paper [ 27 ] with additional description of moving people detection and a navigation robot system.) Acknowledgment This research was supported by New Energy and Industrial Technology Development Organization (NEDO, Japan) Project for Strategic Development of Advanced Robotics Elemental Technologies, Conveyance Robot System in the Area of Service Robots, and Robotic Transportation System for Commercial Facilities. <h4>References</h4> S. Thrun, M. Bennewitz, W. Burgard et al., “MINERVA: a second-generation museum tour-guide robot,” in Proceedings of the IEEE International Conference on Robotics and Automation , pp. 1999–2005, May 1999. R. Philippsen and R. Siegwart, “Smooth and efficient obstacle avoidance for a tour guide robot,” in Proceedings of the IEEE International Conference on Robotics and Automation , pp. 446–451, September 2003. Z. Jia, A. Balasuriya, and S. Challa, “ Sensor fusion based 3D target visual tracking for autonomous vehicles with IMM ,” in Proceedings of the IEEE International Conference on Robotics and Automation , pp. 1829–1834, April 2005. M. Weser, D. Westhoff, M. Hüser, and J. Zhang, “ Multimodal people tracking and trajectory prediction based on learned generalized motion patterns ,” in Proceedings of the IEEE International Conference on Multisensor Fusion and Integration for Intelligent Systems, , pp. 541–546, September 2006. Z. Chen and S. T. Birchfield, “ Person following with a mobile robot using binocular feature-based tracking ,” in Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems , pp. 815–820, November 2007. S. Nishio, N. Hagita, T. Miyashita, et al., “Sensor network for structuring people and environmental information,” in Cutting Edge Robotics , pp. 367–378, InTech, 2010. G. Silveira, E. Malis, and P. Rives, “ Real-time robust detection of planar regions in a pair of images ,” in Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems , pp. 49–54, October 2006. Y. Pang, Q. Huang, W. Zhang, Z. Hu, A. H. Rajpar, and K. Li, “ Real-time object tracking of a robot head based on multiple visual cues integration ,” in Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems , pp. 686–691, October 2006. B. Jung and G. S. Sukhatme, in Proceedings of the Conference on Intelligent Autonomous Systems , pp. 980–987, 2004. G. Chivilò, F. Mezzaro, A. Sgorbissa, and R. Zaccaria, “Follow-the-leader behaviour through optical flow minimization,” in Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems , pp. 3182–3187, October 2004. E. T. Hall, The Hidden Dimension , Doubleday Publishing, 1990. H. Kuwabara, Y. Sagisaka, K. Takeda, and M. Abe, “Construction of ATR Japanese speech database as a research tool,” Tech. Rep. TR-I-0086, 1989. A. Lee and T. Kawahara, “Recent development of open-source speech recognition engine Julius,” in Proceedings of the Asia-Pacific Signal and Information Processing Association Annual Summit and Conference , pp. 131–137, October 2009. H. G. Okuno, K. Nakadai, K. I. Hidai, H. Mizoguchi, and H. Kitano, “Human-robot interaction through real-time auditory and visual multiple-talker tracking,” in Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems , pp. 1402–1409, November 2001. I. Fasele and J. R. Movellan, “Comparison of neutrally inspired face detection algorithms,” in Proceedings of the International Conference on Artificial Neural Networks , pp. 1395–1401, 2002. T. Tasaki, S. Matsumoto, H. Ohba et al., “ Dynamic communication of humanoid robot with multiple people based on interaction distance ,” Transactions of the Japanese Society for Artificial Intelligence , vol. 20, pp. 209–219, 2005. H. Takeshima, T. Ida, and T. Kaneko, “Extracting object regions using locally Es-timated probability density functions,” in Proceedings of the Conference on Machine Vision Applications , 2007. J. H. Ward, “Hierarchical grouping to optimize an objective function,” Journal of the American Statistical Association , vol. 85, no. 301, pp. 236–244, 1963. T. Tasaki and F. Ozaki, “ Obstacle classification and location by using a mobile omnidirectional camera based on tracked floor boundary points ,” in Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems , pp. 5222–5227, October 2009. Y. Negishi, J. Miura, and Y. Shirai, “Calibration of omnidirectional stereo for mobile robots,” in Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems , pp. 2600–2605, October 2004. N. Mitsunaga, T. Miyashita, H. Ishiguro, K. Kogure, and N. Hagita, “ Robovie-IV: a communication robot interacting with people daily in an office ,” in Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems , pp. 5066–5072, October 2006. T. Kanda and H. Ishiguro, “Friendship estimation model for social robots to understand human relationships,” in Proceedings of the 13th IEEE International Workshop on Robot and Human Interactive Communication , pp. 539–544, September 2004. J. Y. Bouguet, Pyramidial Implementation of the Lucas Kanade Feature Tracker , OpenCV Documentation, Intel Corporation, Microprocessor Research Labs, 1999. R. Kawanishi, A. Yamashita, and T. Kaneko, “ Estimation of camera motion with feature flow model for 3D environment modeling by using omni-directional camera ,” in Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems , pp. 3089–3094, October 2009. B. D. Lucas and T. Kanade, “An iterative image registration technique with an application to stereo vision,” in Proceedings of the International Joint Conference on Artificial Intelligence , pp. 674–679, 1981. M. Piaggio, R. Formaro, A. Piombo, L. Sanna, and R. Zaccaria, “An optical-flow person following behavior,” in Proceedings of the IEEE ISIC/CIRNISAS Joint Conference , pp. 4078–4083, 1998. T. Tasaki, K. Komatani, T. Ogata, and H. G. Okuno, “Spatially mapping of friendliness for human-robot interaction,” in Proceedings of the International Conference on Intelligent Robots and Systems , pp. 1277–1282, 2005. //
Journal of Robotics – Hindawi Publishing Corporation
Published: Jan 11, 2012
Access the full text.
Sign up today, get DeepDyve free for 14 days.