Jacques Saraydaryan

Raphael Leber

Fabrice Jumel

People management framework using a

come

Introduction

Interacting with humans in populated environments is a very challenging task for social robots. Many tasks, like people identification, intention recognition, navigation in crowed environments or situation description need to be performed by domestic robots.

The RoboCup@Home (part of the RoboCup international robotic competition) intends to evaluate current domestic robots through real life scenarios. The focus lies on human-robot-interaction, navigation and mapping in dynamic environments, computer vision, object manipulation and adaptive behaviors. A set of benchmark tasks is used to evaluate the robots' abilities and performance in realistic home environment settings. For example, during the "Party Host scenario" trials, robots provide general assistance to guests during a party (welcome, introduce a new guest to others, describe guests to the bartender, escort an exiting guest to a cab ...).

Such interactions require abilities such as following an operator, finding a specific person in a crowd or comprehensibly describing a person. High level information about people (detected people, pose estimation, body description, clothing description...) has to be extracted from raw data provided by robot sensors.

As some characteristics (typically a person's positions) vary over time, the use of the tracking approach, more precisely, Multiple Object Tracking (MOT) [START_REF] Luo | Multiple object tracking: A review[END_REF], is needed. In recent works, the Deep Learning approach applied on large dataset has allowed the extraction of numerous human features (e.g. clothes color, gender, hat, hair color) [START_REF] Cao | Openpose: Realtime multi-person 2d pose estimation using part affinity fields[END_REF][START_REF] Chen | Pedestrian attribute recognition with part-based CNN and combined feature representations[END_REF]. All these approaches give important clues and tools to characterize and track people and could be based on simple sensors such as a 2D camera.

In the case of a domestic robot, we need a framework able to provide all these features with only onboard sensors. A modern approach would be to define all the characteristics needed and train a neural network. Unfortunately, at this time, the creation and labeling of such a large and complex dataset is not possible. The only practical approach is to aggregate different features extraction tools (mostly based on deeplearning) and merge them. For example, a RoboCup@Home team developed a general tracking tool for MOT called "wire" [START_REF] Elfring | Semantic world modeling using probabilistic multiple hypothesis anchoring[END_REF]. Another team defined a specific framework for "Person-Following" tasks [START_REF] Kim | An architecture for person-following using active target search[END_REF] based on OpenPose tools [START_REF] Cao | Openpose: Realtime multi-person 2d pose estimation using part affinity fields[END_REF] and color features extraction.

Relevant works have been made on MOT applied to people tracking [START_REF] Luo | Multiple object tracking: A review[END_REF], but few of them are from a human (or robot) eye's perspective (e.g MOT16). Most MOT proposals consist of tracking scenes through a surveillance camera that is positioned much higher than the human eye. When people disappear and reappear, trackers need to re-identify people and associate them with a previous identity. This process, called Person Re-Identification (PReID) [START_REF] Lavi | Survey on deep learning techniques for person re-identification task[END_REF], uses different collected persons characteristics. In the context of domestic robots, the problem of re-identification is important, but in order to achieve various tasks, abilities to extract goal oriented people characteristics is essential. In this paper we propose a framework allowing the extraction of people's high-level information from a 2D camera and the tracking of people over time for future interactions. The proposed people management framework (available on github1 ) aggregates body and person features. At this time, people pose and posture, clothing colors, face recognition are combined with tracking and re-identification abilities. The paper is composed as follows: the section 1 talked about the needs of people management abilities for domestic robots. The section 2 presents an overview of our people features extraction and tracking framework. The people features extraction processes are detailed in section 3. A proposed people tracking system is described in section 4. The section 5 presents results on pepper robot experiments. Finally, future works and improvement are discussed in section 6.

Overview of the People Management Architecture

As presented in section 1, managing social scenarios, with direct and indirect people interactions, involves to characterize, track people and understand their intentions.

To do so, we provide a framework collecting people information and extracting high-level semantic data. These semantic data, goal oriented, are crucial to achieve social robots scenarios.

The figure 1 presents the different framework blocks. First of all, the robot gets scene information through camera (2D picture). This image is processed in order to extract each person in the scene (OpenPose [START_REF] Cao | Openpose: Realtime multi-person 2d pose estimation using part affinity fields[END_REF]). Semantic information are added concerning people posture, hand posture and estimated position (Pose Extraction). Then information such as face and clothes are used to identify a person (face detection, color detection and naming). Finally, all semantic information are gathered and sent to the robot decision process. Robot can identify people, understand intentions (e.g hand call) and has an overview of the scene. p f ace = (label, score) where label and score ∈ [0, 1] representing respectively the id of the detected face and the probability of matching with previously learned faces p shirt , p trouser define the dominant colors of portion of the shirt and portion of the trouser. Each of theses items is a list of objects composed of a color name, the RGB value, the HSV value and the percentage of the portion of the targeted object (shirt or trouser). e.g p shirt = {p metaC0 , p metaC1 , ..., p metaCm } where p metaCi = (p rgbi , p hsvi , p namei , p scorei ), ∀i ∈ [0, m] p posture ∈ {standing, sitting, lying, undef ined} is the label of the detected posture p hand posture is an array of 2 objects (Left and Right arm), each object represents the posture of the arms p hand posture = (p hand L , p hand R ) such as p handi ∈ {point lef t, point right, call, crossed, undef ined}|∀i ∈ {L, R} p pose = (x, y, θ) is the estimated pose (position and orientation), expressed in a "top-view" map with the robot as the origin.

All those information are managed by the People Management block in charge of scheduling and launching people features detection blocks.

Indeed, the following workflow is executed: As soon as the Openpose block detects people, the Pose Extraction block is triggered. Information such as people pose (standing, sitting, ...), people bounding box, shirt and trouser regions of interest (ROI) are then available. These ROI are used to extract main colors of shirt and trouser through the Color Detection block. The people bounding box becomes the input of the Face Recognition which identify people if they were already seen, register the current face otherwise. At the end, the People Management block gathers all these features to each detected people and publish information.

People and associated features are then collected by an additional block: the People Tracker, that creates and maintains a set of tracked persons over the time.

When information of observed person p at a given time t is collected, a score is computed for each p regarding to a list of already tracked people T i . This score combines person attributes e.g face, color and pose score. If the score is upper a threshold the current observed person p update the tracked person T i , otherwise a new tracked person is created. A forget function removes tracked persons if they are not updated with new observations. Sections below detail each processing block of the framework.

3 People Features extraction

People pose and posture

For each detected person, OpenPose outputs a list of body parts, each given with a confidence and a point on the image. Those points are expressed in 2 dimensions but the third dimension is crucial to get people pose on a map, and gives more information for people posture. To compensate the lack of a depth measurement, we will explain how we lay on a main hypothesis and on a calibration dataset. The hypothesis is that the camera horizontal field of view is parallel to the ground. This hypothesis will be used in the computation of p pose and p posture . The calibration dataset will be used to estimate people distance with linear interpolation. Therefore the calibration enters in the computation of p pose . The calibration dataset is made as follow : we recorded at every meter, an average size person, straight on his legs and facing the camera, in order to maximize the limbs components on the 2D camera plane.

People pose p pose is computed in four steps. The first step is to estimate the depth of the persons (p pose,x ) in the image. To do so, we consider that at least one limb (e.g : one front leg, one arm, one flank, ...) is seen with most of its components on the image plane (depth component small enough to be neglected) We find such limb limb ref in order to perform a distance evaluation.

To find it, we normalized each limb size with its respective calibration limb size.

with H F OV the camera horizontal field of view, i w the image width and p neck,x the horizontal coordinate of a person's neck on the image.

To complete pose on the map, equation 2 computes their orientation based on right and left confidence of people body parts (face and shoulder only). People front or back side are defined by shoulder sides and/or nose presence. Depending on front/back side, we compute α (-π/2 or π/2) and β (0 or π) in order to get an orientation angle

p pose,θ = α * ψ + β ψ = bodypart conf idence right -bodypart conf idence lef t bodypart conf idence right + bodypart conf idence lef t (2)
Posture : With a limited 2D information, multiple combinations could match with one of each posture. As well, a same combination could match for all the postures. To solve the first problem we use a scoring system on different combinations To fix the second problem we considered the hypothesis mentioned for pose detection. Here are the evaluation criteria for each position, starting with the body. "Standing" relies on xy thigh ratio and neck position on image height (i.e. hypothesis). "Sitting" checks height ratio of thigh and calf as well as knee angle. "Lying" test looks at legs xy ratio and also at head (each point) position on image height. About hands, "Pointing left/right" and arm "Crossed" compute forearms and clavicles as vectors. Hand "Call" checks wrist above shoulder or elbow above nose.

Color Detection

We optimized our previous color detection system [START_REF] Jumel | Context Aware Robot Architecture, Application to the RoboCup@Home Challenge[END_REF] to give additional information to the People Management block. Although our color detection is still based on kmean-clustering on the H of the HSV image color, our system extracts dominant colors and associated readable names (E.g Red, Dark Blue,...). To do so, main HSV color value is converted in RGB value given fixed S and V values (only the Hue value is considered). Then, the closest X11 color is used [START_REF] Pettit | Css color module level 3. W3c recommendation, W3C[END_REF] to associate a name.

Information about saturation and value intensity is relevant to express darkness and extreme value such white and black. Based on the HSV color representations, thresholds on saturation and values are used to complete color name.

Future integration of deep learning color naming based approaches [START_REF] Yu | Weakly supervised domainspecific color naming based on attention[END_REF] will help to improved common issues concerning illumination and textures.

Face Recognition

The face recognition mechanism is based on the method provided by Adam Geitgey's based on the ResNet-34 of [10] library2 . By adding automatic face learning if no matching exists, our method allows a dynamic people face learning and recognition. Using a set of face recognition options (HOG [START_REF] Dalal | Histograms of oriented gradients for human detection[END_REF], Haar Cascades [START_REF] Viola | Rapid object detection using a boosted cascade of simple features[END_REF], bounding box from OpenPose), the learning face phase can be adapted according to the need. As a result, when the service is targeted with an image, the system return per detected face a percentage of matching of the more relevant learner face or unknown otherwise. If no known face is detected, the current detected face is learned automatically.

People Tracking

All persons with associated features need to be followed and tracked over time. Thus, a robot could keep a state of met people, called tracked people, that it could use for future tasks. The People Tracker block is a Multiple Object Tracker (MOT), that need, according to the literature [START_REF] Luo | Multiple object tracking: A review[END_REF], to cover 2 objectives: What is the number of objects ? How to maintain object identities ?

In the different targeted scenarios, the number of people is not previously known, tracked people is maintained during a time until to be removed by the system in accordance with the forgetting function. Identities of tracked people are fed by people observations that update the tracked people states. The tracked people update is triggered using a similarity function, resulting of the summation of multiple cues, between people observations and tracked people set. The greedy approach is used to associate observation with the most similar tracked person.

This state of met people is defined by a tracked person, noted T i ∈ T where T is the set of tracked persons. A tracked person T i is composed of a set of person features like face, color and pose information updated with people, p, attributes when associated to T i . Additional information such as a weight (how many time a detected person p is associated with the tracked person T i ), lastU pdateT ime (referring to the last time a detected person p is associated with the tracked person T i ) are used to keep or forget a tracked person When the tracker receives detected people p, it computes a score of similarity between p and T j based on attributes, e.g f ace, shirt color, trouser color and pose. The similarity score (called general score ) is defined as follows for the given attribute set:

general score (p, T j ) = w 0 .f ace score (p, T j )+w 1 .color score (p, T j )+w 2 .pose score (p, T j )
(3) The different general score weights w k can be adjusted according to the needs: if the pose information rate is high the importance of w 2 will increase. If the target scenario needs to identify people with specific color, the w 1 score weight should be higher. Furthermore, score weights could be computed using a Boosting based algorithm [START_REF] Luo | Multiple object tracking: A review[END_REF](e.g AdaBoost) given a training labeled dataset.

If the similarity score is over a threshold, the person p updates current tracked person T i such as T i = argmax T (general score (p, T )), otherwise a new tracked person is created and updated with p information. Other affections are possible using Hungarian method as used in [START_REF] Bewley | Simple online and realtime tracking[END_REF]. For the rest of the article, only face, color and pose person attributes will be considered.

A tracked person T i can be defined as follows:

T i = (T pose i , T F i , T C i , T weight i , T last i
) where :

-T pose i is the current tracked person pose, -T F i contains information about the face of the tracked person, ) is added to T F i such as

T F i = {T metaF0 i , T metaFi i , ..., T metaFo i } / T metaFj i = (T labelj i , T f weightj i , T lastj
T labelo+1 i = p f ace i , T f weighto+1 i = 1 and T lasto+1 i = now.

Forgetting outdated tracked people

In order to keep the system stable, outdated tracked people are removed. The forgetting function has to keep tracked persons for a given time from their respective updates. Moreover, tracked persons with a greater weight has to be kept longer. Considering these constraints, the following function based on classical forgetting curve is used as f orget function:

f orget(T i ) = 1 + log T h t - T h w min(T h w , T weight i ) * (now -T last i ) ( 4
)
where T h t define the maximum time that a tracked person would be kept if no update occurs, and T h w is a weight threshold over which the tracked person would be kept during the maximum time. Moreover T h w and T h t can be customized for VIP tracked persons (for example operator in a people following task).

A tracked person updated regularly in the past will be kept by the tracker from its last update until the T h t value (only if T weight i ≥ T h w ). Finally, given T i , for a forget function value f orget(T i ) < 0, the tracked person T i is removed.

Face Similarity score

The Face detection block associates to each person some face labels with confidence scores. When a person face is unknown, a new face is registered. So a same person can be associated to a set of faces (e.g due to different camera/person settings). The face similarity score maintains for each tracked person T i a set of face information T F i as defined in section 4. According to the detected person p with a given face label p f ace . The face score (noted f ace score ) given by the current observation, is equal to the face weight T f weight k i of the person tracked, normalized with the sum of all people tracked face weight such as T label k i = p f ace . This function gives values for an observed face, proportional to the past associated faces weights.

Color Similarity score

When the face becomes unavailable, color information about clothes gives important clues to associate an observed person to a tracked person. Given an observed person p and a tracked person T i , the used color score is the distance d() between, for example, p shirt and the average hsv color of T C i . d() function can be e.g. Hue distance value, Euclidean distance, one of the CIELAB ∆E * distances [START_REF] Mcdonald | Cie94-a new colour-difference formula*[END_REF][START_REF] Luo | The development of the cie 2000 colour-difference formula: Ciede2000[END_REF]. Other image distance/similarity can be computed like Color Histogram intersection [START_REF] Michael | Color indexing[END_REF].

Pose Similarity score

Standard tracking system, such as Kalman filter or particle filter, are designed to track a single person according to move estimation and observed data. Knowing the pose of a tracked person, Kalman filter could be used to measure the similarity of the given measure p pose and tracked person. To do so, the Kalman filter is applied on the current tracked person T i with the observed person pose p pose such as

(T pose i t , t ) = KF (T pose i t-1 , t-1 , u t , p pose t ) where
is the covariance error on the state and u the command applied on the system (in our case, u = 0 because no prior information about person's objectives is considered).

Then we define, the pose score as a distance between observation and the new state of the system. This pose score (pose score ) is also normalized in [0, 1] regarding to the distances of other tracked person pose.

The Kalman filter estimation is kept only on the T i on which the observed people p is associated. For the other tracked persons the previous state is restored.

If the system guarantees a sufficient information rate (regarding to the human velocity max e.g 5ms -1 ), the Kalman filter can be applied. If the data rate is too low, the motion model of the Kalman filter becomes inefficient leading a great filter drift. We propose, in the case, to use only the last person tracked position and compute a function as an incertitude propagation model of the last position. The Pepper robot from SoftBank Robotics is our evaluation platform collecting images of the scene. The camera of the pepper produces VGA (640x480) images at a rate fixed of 10fps.

Several scenarios have been tested, the presented one (a video illustrating the results here 3 ) is composed of a robot at a fixed position, (with head camera parallel to the ground) and 3 people appearing at different time. An example of robot feedback is displayed in in figure 2.

In the first part of the scenario, a person (called person 1) is sitting in front of the robot (red shirt), after calling the robot (hand call), the person stands up and travels in the robot field of vision. Then, the person 1 sits again. In the second part of the scenario, a second person (called person 2) then appears (green shirt) and travels around the person 1. In a third scenario part, both person 1 and person 2 stand up and cross each other. Finally, a third person appears, walks and stands between person 1 and person 2. Then all people, walk in the robot direction and stand close to the robot.

During all the experiments different person features including shirt color, trouser color, person posture, hands posture are correctly identified. Some color names has some variation (especially between cyan and blue color names, same as red and pink). Few color name errors occurred. They are mainly due to a bad trouser ROI or due to the presence of the person's arm in the shirt ROI. Concerning person posture and arm posture, no errors has been identify during the experiments The figure 3 shows the different people tracked score according to the time.

On the top figure, the scenario situation is described. Indications such as how many people is there in the scene and what are the current people postures are available. Below all scores of generated tracked people are displayed during the time. Thus general score4 , f ace score , color score and pose score of tracked people are available. Tracked people are identified by a dedicated color and an universally unique identifier (UUID). Finally at the bottom of the picture, relevant scenario moments are indicated.

During the part 1 of the scenario the sitting person 1 is well identify by the face detector. Moreover color and position values have no variations during the time leading to high color and pose score. As soon as person 1 turns his back to the robot, the general score dropped due to the absence of face identification. One can see at the key time one, that the shirt color score dropped down, this is due to the fact that no shirt bounding box is available.

A new person appears at part 2, the key time 2 shows that the color score of the trouser of the person 2 dropped and rise up two times. This variation results of bad color detection. Indeed, the trouser bounding box at the both moments is apply on chair and not on people.

At key time 3, tracked person associated with person 2 has medium face score values, increasing gradually over time. In fact, first face recognition on person 2 is bad, next one are better but due to the discontinued face recognition, the f ace score increase slowly.

In part 3, person 1 and 2 cross each other and keep their associated tracked people. At key time 4, a person leaves the scene and when he comes back at key time 5, a bad face recognition prevents the good association . Person 1 for for its part, is associated with a new tracked person. At the end on key time 6, a new person enters into the scene and is also associated with a tracked person until the end of the experiment. The present scenario shows that both people features extraction and people tracking has good results.

Finally, a primary version of our features extraction system has been tested during the RoboCup@Home 2018 competition, leading the LyonTech team to gain points to the Speech and Person Recognition scenario. The figure 4 displayed results obtaining during the competition. Despite a few bad color names processing most of information describes correctly the scene.

Conclusion

To consider robot deployment in homes, people identification, intention recognition or situation description capabilities have to be developed with cheap and general purpose sensors such as a classical 2D camera.

Our main contribution is proposing a framework which equips robots with high-level information about individuals that in turn yields more productive social interactions. The framework is driven by domestic use cases (e.g. following people, locating people, checking if people sat, looking at people pointing, describing one person among others, coming to a person calling). It manages different blocks to extract people distinctive high-level features such as clothing colors, face recognition, position and posture.

Different real-life experimentation demonstrate the usability and relevance of the framework, especially during the RoboCup@Home 2018 competition.

Global performance could be enhanced with higher resolution images (better face recognition and better position evaluation) as well as more computation power (more FPS leading to better tracking). Some block's improvements are still in development. Regarding to the tracker, weights of the scoring system could be optimized with reinforcement or adaptive learning. Concerning the pose extraction, The dependence between people position and people height can be reduced through other features (e.g. age, gender).To go further, the framework allows an easy addition of new blocks, even for new features, in order to answer new use-cases, or to have better performance on already covered use-cases. A coming block, is the implementation of the work of our colleagues [START_REF] Chen | Pedestrian attribute recognition with part-based CNN and combined feature representations[END_REF] to get 45 more features (e.g. Causal/Formal upper/lower clothes, carrying plastic bag, gender) of people.

Fig. 1 :

 1 Fig. 1: People Management Architecture Let a detected person noted p ∈ P , the following features are associated such as p = (p f ace , p shirt , p trouser , p posture , p hand posture , p pose ) where :

} 4 . 1

 41 i ) ∀j ∈ [0, o] where T f weightj i represents the number of observation matching the current face and T lastj i the last update date. -T C i contains clothes colors information, T C i = {T hsv1 i Updating tracked people When a person p i is associated to a tracked person T i , the T i attributes are updated. First of all, current tracked person weight and last update time are updated (T weight i + = 1, T last i = now). This information is used to keep or remove a tracked person. T i pose is adjusted to the observation pose values, T pose i = p pose i . The T i color update process, given a queue size, adds the new main hsv color p hsv k i and removed the oldest hsv color if the queue size is reached (FIFO). Concerning face information, if the face label of the person is equal to one of T F i label, the weight and the last detected time of this one are updated. Otherwise, a new vector (T

  d() is the distance function (in our case euclidean distance), v max is the maximum human velocity considered and ∆T the time elapsed since the last person tracked update, ∆T = now -T last i . The pose score function to apply on low data rate is also normalized between [0, 1] regarding to other tracked person distances.5 Experimental Evaluation

Fig. 2 :

 2 Fig. 2: Experimentation feedback

Fig. 3 :

 3 Fig. 3: Tracked people score during the experimentation

Fig. 4 :

 4 Fig. 4: Result of Speech and People Recognition scenario during the RoboCup@Home 2018 challenge

  Let call limbs normalized the list of normalized limbs. As we miss one dimension (image depth) we know that the biggest normalized limb is the one with the most components in the image plane, as it is in calibration data. Then we do limb ref = max(limbs normalized ) to select the biggest normalized limb as a reference to evaluate distance.Once limb ref is found, it is compared to calibration data in order to find with the closest two calibrated distances. A linear interpolation is done between the two closest calibration data, in order to find limb ref distance (d limb ref ), and therefore the measured body distance. This distance is set in p pose,x = d limb ref . Then we approximate p pose,y with equation 1

	p pose,y ∼ p pose,x * sin(	H F OV * (p neck,x -(i w /2)) i w	)

https://github.com/Robocup-Lyontech/People-Management-Framework

https://github.com/ageitgey/face recognition

https://youtu.be/0qSulBGBarg

Weights of the generalscore are chosen according the ground truth on several scenarios and results of a weight w0 = 0.5 for the f acescore, w1 = 0.15 for the colorscore and w2 = 0.35 for the posescore.