JP2006285358A - Edge-tracking method and computer program thereof - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a method for tracking a moving object, such as human body at a high-frame rate, with a series of images. <P>SOLUTION: A method for tracking edges in a series of images of an object includes a step of preparing a model of the object; a step (180) of projecting the edges of the model of the object onto an image plane of an image; steps (182, 184 and 186) of searching pairs of edge pixels of the image, within a preset region of each surrounding of the edges projected onto the image plane; a step (188) of obtaining line segments, corresponding to the pairs of each edge pixel of the projected edges; a step (190) of displaying the line segments by pairs of prescribed parameters defining the line segments for each projected edge; and a step of updating the model of the object by using the line segments. <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to motion capture systems, and more particularly to tracking the edges of objects in a series of images suitable for high frame rates.

  The idea of capturing motion of a human body without a marker is to capture human motion by operating only an image sequence without requiring any additional configuration. The hardware for such a system consists of only one or more cameras in addition to a computer, and can therefore be easily set at a reasonable price.

  However, in order to apply this to the active head of a humanoid robot, some limitations must be addressed. In addition to the limitation of two cameras located at relatively short distances, the active head can potentially move, so no optical flow or similar algorithms are available for foreground segmentation. You need to keep that in mind. The biggest problem is that the calculation must be done in real time at a frame rate of at least 30 Hz, preferably 60 Hz or higher to achieve optimal results.

The general definition of the motion capture problem is to find the exact shape of the 3D human body model connected by the underlying joints for each of the input images or for the tuples of the images. The main problem is that the search space increases exponentially as the number of degrees of freedom (Degree Of Freedom) of the human body model increases. A realistic model of the human body has at least 25 DOF. If the DOF is so high, the dimension of the search space becomes very high.
A. Break and M.C. Isard, "Active Contour", Springer, 1998 (A. Blake and M. Isard. Active Contours. Springer, 1998.) J. et al. Deutscher, A. Break, and I.I. Raid, “Motion capture of articulated objects by annealed particle filtering,” Computer Vision and Pattern Recognition (CVPR), pages 216-2133, Hilton Head, USA, 2000 (J. Deutscher, A. Blake, and I. Reid. Articulated body motion capture by annealed particle filtering. In Computer Vision and Pattern Recognition (CVPR), pages 2126-2133, Hilton Head, USA, 2000.) J. et al. Deutscher, A. Davison and I. Raid, “Automatic Partitioning of High Dimensional Search Space Related to Motion Capture of Concatenated Objects”, Computer Vision and Pattern Recognition (CVPR), pages 669-676, Kauai, USA, 2001 (J. Deutscher, A Davison, and I. Reid. Automatic partitioning of high dimensional search spaces associated with articulated body motion capture. In Computer Vision and Pattern Recognition (CVPR), pages 669-676, Kauai, USA, 2001.) M.M. Isard and A.I. Blake, "Concentration-Conditional Density Propagation for Visual Tracking," Computer Vision International Journal, 29 (1): 5-28, 1998 (M. Isard and A. Blake. Condensation-conditional density propagation for visual tracking International Journal of Computer Vision, 29 (1): 5-28, 1998.) J. et al. McCormick, “Stochastic Models and Stochastic Algorithms for Visual Tracking”, Oxford University, PhD thesis. UK, 2000 (JD MacCormick. Probabilistic models and stochastic algorithms for visual tracking. PhD thesis, University of Oxford, UK, 2000.) J. et al. McCormick and M.M. Isard, “Partitioned sampling, articulated objects, and interface quality hand tracking”, Computer Vision Europe Conference (ECCV), pages 3-19, Dublin, Ireland, 2000 (J. MacCormick and M Isard. Partitioned sampling, articulated objects, and interface-quality hand tracking. In European Conference Computer Vision (ECCV), pages 3-19, Dublin, Ireland, 2000.) H. Siddenbler, “Probabilistic Tracking and Reconstruction of 3D Human Motion in Monocular Video Sequences”, Royal Institute of Technology Doctoral Dissertation, Stockholm, Sweden, 2001 (H. Sidenbladh. Probabilistic Tracking and Reconstruction of 3D Human Motion in Monocular Video Sequences. PhD thesis, Royal Institute of Technology, Stockholm, Sweden, 2001.)

  Accordingly, one of the objects of the present invention is to provide a method suitable for high frame rates that allows a moving object such as a human body to be tracked in a series of images.

  According to one aspect of the present invention, a method for tracking edges in a series of images of an object comprises: preparing a model that describes the shape of the object; and aligning the edges of the model of the object to an image plane of the image. Projecting, searching for a set of edge pixels of the image within a predetermined area around each of the projected edges on the image plane, and a line for each set of edge pixels of the projected edge Applying a segment, for each projected edge, representing the segment with a set of predetermined parameters defining the segment, and updating the object model with the segment.

  According to the above-described method, the amount of calculation is substantially reduced, and image tracking of an object in a series of images can be performed at a high frame rate.

  Preferably, the searching step includes determining a set of search points for each projected edge, and projecting edges on each side of the projected edge for each search point for each projected edge. Searching for a high-contrast point in the image that is within a predetermined distance in a direction intersecting with.

  More preferably, the direction intersecting the projected edge is a direction orthogonal to the projected edge.

  More preferably, the determining step includes the step of determining a set of search points at a fixed distance for each projected edge.

  The above model may be described by a plurality of shapes that the model can take and the probabilities associated with each. The updating step includes the step of predicting a new set of model shapes by adding noise to the selected particles of the model shape probability distribution function, and each of the new set of model shapes. Calculating a predetermined error measure between the set of edges and the set of edge pixels, and assigning a weight to each shape of the new set of shapes according to the associated error measure calculated in the calculating step; Calculating a new model by calculating the sum of the new shapes weighted by the respective weights.

  Another aspect of the invention relates to a computer program that, when executed on a computer, causes the computer to execute all the steps of any of the methods described above.

1. 1. Introduction In this embodiment, the current shape probability distribution is calculated using particle filtering by the Bayesian framework. Particle filtering, also known as a concentration algorithm, is generally used for contour tracking (Non-Patent Documents 1, 5, 6), especially as shown in Non-Patent Documents 2 and 7, as introduced in Non-Patent Document 4. It is known to be a robust technique that can be applied to human body motion capture.

In visual tracking, the particle filter operates as follows. The x _t is the state vector of the t-th frame, and the observation vector _{y t,} the _{Y t = {y 1 ... y} t} and the history of _{y t.} The state estimation is formulated as estimating the probability density distribution (pdf) p (x _t | Y _t ). In a particle filter, p (x _t | Y _t ) is represented as several sets of discrete samples:

ここでｓ_ｔ ^（ｉ）（ｉ＝１〜Ｎ）は、状態空間ｘ_ｔにおけるランダムでディスクリートなサンプルを示す。サンプルｓ_ｔ ^（ｉ）は対応の重みπ_ｔ ^（ｉ）に対応する確率を有する。従って、ｐ（ｘ_ｔ｜Ｙ_ｔ）で非ガウスｐｄｆを近似することが可能である。

Here, s _t ⁽ⁱ⁾ (i = 1 to N) represents a random and discrete sample in the state space x _t . Sample s _t ⁽ⁱ⁾ has a probability corresponding to the corresponding weight π _t ⁽ⁱ⁾ . Therefore, it is possible to approximate a non-Gaussian pdf with p (x _t | Y _t ).

In the particle filter, each sample is updated at the estimation step and the observation step. In the estimating step, the sample s _t-1 ^ζ is selected from the following set according to the probability proportional to the weight π _t-1 ⁽ⁱ⁾ .

その後新たなサンプルｓ_ｔ ^（ｉ）が動力学的モデルｐ（ｘ_ｔ｜ｓ_ｔ−１＝ｓ_ｔ−１ ^ζ）から生成される。観測ステップでは、現時点での観測ベクトルｙ_ｔが与えられると、観測された密度ｐ（ｙ_ｔ｜ｘ_ｔ＝ｓ_ｔζ）に基づいて各サンプルｓ_ｔ ^（ｉ）の尤度が評価され、尤度に比例する対応の重みπ_ｔ ^（ｉ）が計算される。最後に、現在の状態が、全てのサンプルを組合せることによって推定される。

A new sample s _t ⁽ⁱ⁾ is then generated from the kinetic model p (x _t | s _t−1 = s _t−1 ^ζ ). In the observation step, given the current observation vector y _t , the likelihood of each sample s _t ⁽ⁱ⁾ is evaluated based on the observed density p (y _t | x _t = s _t ζ). Corresponding weights π _t ⁽ⁱ⁾ proportional to degrees are calculated. Finally, the current state is estimated by combining all samples.

  Particle filters require more particles as the search space becomes larger. One strategy to address this problem is to limit the range of movement of the subject, for example by assuming that the subject is walking, thereby reducing the size of the shape space. In general, any such approach greatly limits the generality of the resulting tracker. For this reason, this approach is not preferred. Another strategy is to assume a linear relationship between the size of the shape space and the size of the search space by performing a decomposition, ie a hierarchical search. The disadvantage of such a method is that certain movements, such as rotation around the body axis, lose important information that can be obtained by observing all parts of the body simultaneously.

  A general and effective method for reducing the number of particles is the concept of simulated annealing presented in Non-Patent Documents 2 and 3. However, the system finally obtained uses three cameras at a fixed position in the corner of the room, and even a state-of-the-art processor operating with a 1 GHz clock signal takes an average of 15 seconds to process one frame. [Non-Patent Document 3].

  This embodiment relates to a human motion capture system with a highly optimized likelihood function, which achieves two to three times the speed of any conventional human motion capture system. To do. This embodiment is based on edge detection by a particle filter that contributes to high-speed capturing. This approach can be applied independently to any other optimization, such as the strategy described above.

  Furthermore, the algorithm employed in this embodiment can be used for any type of object that can be modeled with straight edges, and other basic elements such as ellipses can be incorporated with minor modifications. The only limitation of this approach is that it depends on a high frame rate of 60 Hz (or higher). However, as shown below, this is not a problem because real-time human motion capture requires high frame rates anyway.

2. Basic Algorithm Given the projected edge of the human body model shape s and the current input image z, the likelihood function p (z | s) for the cue of the human motion capture system edge is given by The likelihood that the shape giving the set is an appropriate shape, that is, the likelihood that best matches the edge image is calculated. Here, “projecting” the edge of the shape of the human body model means that the edge is projected onto a predetermined image plane, and the coordinates of the image of the projected edge on the image plane are calculated.

  Referring to FIG. 1, the basic technique is to determine a search point at a fixed distance Δ over the entire projected edge 20, and from each search point is orthogonal to the projected edge 20 ( Searching for high-contrast feature points 30 within a fixed search distance δ (in both directions), that is, finding edge pixels in the camera image [Non-Patent Document 4]. For this purpose, the camera image is typically pre-processed by an edge detector using a gradient of gradations to generate an image edge 22.

The likelihood is calculated based on a sum of squared errors (SSD). For convenience of description, all edges are divided into M = L / Δ ranges and included in one continuous spline. Where L represents the sum of all the lengths of the projected edges in the current image. a distance characteristic of an edge has been found and d _m for m-th point, mu denotes a constant maximum error to be applied when it is not possible to find a characteristic of the edge. Therefore, the likelihood function is given by the following equation.

この実施の形態では、わずかに修正した尤度関数を用いて、より良好な結果を得る。その尤度関数とは、エッジごとの平均誤差を計算し、すべての誤差の平均誤差を計算するというものである。この修正した尤度関数を以下の式で表す。

In this embodiment, a slightly modified likelihood function is used to obtain better results. The likelihood function is to calculate an average error for each edge and calculate an average error of all errors. This corrected likelihood function is expressed by the following equation.

ここでｅ_ｋは特定の投影されたエッジを表し、Ｅは投影されたエッジの総数を表す。さらに、

Where e _k represents a particular projected edge and E represents the total number of projected edges. further,

キャニーのエッジ検出器（Ｃａｎｎｙ Ｅｄｇｅ Ｄｅｔｅｃｔｏｒ）等の高レベルエッジ検出器は、一般に、１画素幅の線を生成するので、ある特定の画素がエッジの一部であるかどうかのテストを複雑にするか、又は不適当にする。ドイチャーは非特許文献２で、階調の勾配を用いたエッジ検出マスクを用い、この結果をしきい値処理してスプリアスエッジを除去し、これに続いてガウス平滑化マスクを適用して画素マップを作成することを提案しており、このマップでは各画素値はそのエッジにどの程度近接しているかに関連づけられている。こうすることによって、画素があるエッジの一部であるか否かのテストと、そのエッジへの近接度の計算とが１回の動作で解決できる。最大値を見出すためとループ管理のために必要とされるさらに３つの動作を考慮すると、基本的動作の数は以下の式で表される。

High level edge detectors, such as Canny Edge Detector, typically generate a one pixel wide line, complicating the test of whether a particular pixel is part of an edge. Or inappropriate. Deutscher is a non-patent document 2 that uses an edge detection mask that uses a gradient of gradation, thresholds this result to remove spurious edges, and then applies a Gaussian smoothing mask to apply a pixel map. This map maps each pixel value to how close it is to its edge. By doing so, the test of whether or not the pixel is a part of an edge and the calculation of the proximity to the edge can be solved in one operation. Considering the three more operations needed to find the maximum value and for loop management, the number of basic operations is given by:

３．新たなアルゴリズム
この実施の形態の戦略は、処理ステップをもう一歩進めて、対象エッジの幾何学的な表現を抽出することである。このために、この実施の形態では、オン−ザ−フライで（すぐさま）のエッジ検出という基本的な考え方を用いる。これは、人体モデルによって与えられる情報をエッジ検出アルゴリズムに組込むというものである。主な違いは、この実施の形態ではパーティクルの各々に対してアルゴリズムを行なうのではなく、これを画像の前処理に用いることである。その後このアルゴリズムは、人体モデルの投影されたエッジに対応する点の各組に当てはまる線分（回帰直線）を求めることで拡張される。

3. New Algorithm The strategy of this embodiment is to take the processing step one more step and extract the geometric representation of the target edge. To this end, this embodiment uses the basic concept of edge detection on the fly (immediately). This is to incorporate information given by the human body model into the edge detection algorithm. The main difference is that this embodiment does not apply an algorithm to each of the particles, but uses it for image preprocessing. The algorithm is then extended by finding line segments (regression lines) that apply to each set of points corresponding to the projected edges of the human body model.

  Assuming that images are acquired at a high frame rate of at least 30 Hz, preferably 60 Hz or higher, this approach is not only significantly faster, but also achieves better results than on-the-fly edge detection. At first glance, this seems surprising. Theoretically, on-the-fly edge detection is the strongest information infrastructure by using predictions to make observations using the predicted shape of the human model to detect edges. It is because it has. However, the drawback is that relatively large motion predictions can lead to edge identification errors. If the frame rate is not high enough for the new approach of this invention, this approach will not work. General low frame rate effects are discussed in Section 4.

3.1 Line fitting The main advantages of incorporating a human body model into edge detection are the following two.

  -The gradient of the tone can be calculated perpendicular to the predicted edge.

  A mapping between the detected edge pixels and the projected edges is obtained.

  Since the mapping of detected pixels to projected edges is known for each projected edge of the human body model, a regression line can be found for the set of pixels specified by the algorithm. After obtaining an optimal regression line in the sense of least squares for this set, iterate over all pixels in this set and compare their distance to the calculated line with a predefined threshold The outlier (abnormal value) is removed by filtering. The final result is calculated by determining a regression curve for this filtered set of pixels.

  In this embodiment, the gradient of the image gradation is calculated in a direction perpendicular to the predicted edge. However, this direction is not necessarily perpendicular to the predicted direction. The search for feature points with high contrast may be performed in a direction intersecting with the predicted edge.

3.2 Error measure After a set of straight line pairs is obtained, an error measure will be defined for the likelihood calculation. Theoretically, the distance between two straight lines can be defined in 2D only when the two straight lines are parallel. However, as shown in FIG. 2, the scale of the line E and the line segment / AB 40 or 42 (here, “/” represents a line segment and should be written on the character AB originally) is as follows. Can be defined as The error measure calculated by the basic algorithm is the average distance between the straight line E and the line segment / AB 40 or 42 calculated based on the observations at the discrete points. This average distance is equal to the total area divided by length / A'B 'as illustrated in FIG. Thus, the error measure is calculated as follows:

本発明者らは、この尺度について可能な組合せ２つを試みた。Ｅを画像から抽出された直線と定義し、／ＡＢを投影されたエッジとする組合せと、その逆とである。後者の場合、抽出された直線の各々について端点Ａ及びＢを定義しなければならない。これは図３に示すように、フィルタされた点の組のうち最初と最後の点を画像のエッジを表す直線に直交投影することでなされる。本発明者らは、このようにすることが最良の結果を達成することを見出した。なぜなら、これは画像エッジの長さの推定値を尤度関数に組込んでいるからである。長さの推定が悲観的であるため、結果として得られる誤差尺度は楽観的になる。実際、これはエッジの幾何学的表現に対して行なわれる式（３）で表される基本アルゴリズムの正確なエミュレーションである。式（２）で適用される新たな関数は最終的に以下のように定義される。

We tried two possible combinations for this scale. A combination where E is defined as a straight line extracted from an image and / AB is a projected edge, and vice versa. In the latter case, end points A and B must be defined for each of the extracted straight lines. This is done by orthogonally projecting the first and last points of the filtered set of points onto a straight line representing the edge of the image, as shown in FIG. The inventors have found that this achieves the best results. This is because the image edge length estimate is incorporated into the likelihood function. Since the length estimation is pessimistic, the resulting error measure is optimistic. In fact, this is an exact emulation of the basic algorithm expressed by equation (3) performed on the geometric representation of the edge. The new function applied in equation (2) is finally defined as follows:

別の可能な誤差尺度は、図２に示される線Ｅと線分／ＡＢとの間の面積であろう。

Another possible error measure would be the area between line E and line segment / AB shown in FIG.

FIG. 3 shows an example in which an error measure is applied to an incorrect shape. White points between points A ₁ and B ₁ and between points A ₂ and B ₂ identify detected edge pixels, lines 60 and 62 represent regression lines, and lines 50 and 52 are The edge projected from the human body model is shown. The input image is smoothed by a 3 × 3 smoothing filter using a Gaussian kernel.

  The edge detection described above can be extended to the edge detection of a blob (a clump-like image). When the blob model is represented by an ellipse or circle, the search point is determined as a point separated by a certain distance Δ on the elliptic line, and at each search point, the image edge is searched within a distance δ on both sides of the projected elliptic line. The Thereafter, an ellipse can be applied to the detected image edge points. In this case, the error can be measured by the distance between the centroids of the ellipse.

3.3 Effectiveness If the preprocessing step is successful and the edges are extracted correctly, the new error measure of the present embodiment is more accurate, so a more effective algorithm is obtained. In order to successfully extract an edge, the following two conditions must be satisfied:

  • The edges in the image must be almost straight.

  • The frame rate must be high enough.

  Assuming normal clothing, the inventors' tests have shown that the first condition is met. This assumption is appropriate. This is because even the basic algorithm degrades the tracker's performance if the clothes are too loose. For testing, a frame rate of 30 Hz is sufficient, and this captures realistic speed movements. Frame rate issues are discussed in detail in Section 4. The reason why the new algorithm adopted in this embodiment is more effective can be explained as follows.

  ・ Since straight lines are extracted, noise is suppressed.

  Since the error measure is calculated based on the straight line, an accurate likelihood is calculated even for a non-perfect edge.

  • By detecting only the speed proportional to the frame rate, false edge detection can be avoided.

  These considerations were verified to be correct in practice. In testing, the performance of the new algorithm employed in this embodiment was never inferior to that of the basic algorithm, and in fact achieved better results in many cases.

3.4 Efficiency This section theoretically compares the efficiency of the basic algorithm with that of the new algorithm. This consideration is verified by the test results presented in Section 6. Maximum resolution is achieved by selecting Δ = 1. In the following discussion, δ = 15 is selected. The sum of the lengths of all projected edges is L≈1500 (pixels) in the image sequence presented here.

In the basic algorithm, the calculations outlined in Section 2 must be performed for each particle in each frame at the frame rate f. This means that for N particles, NfT (1500) = 1.8 · 10 ⁵ Nf operations are performed every second. For the work required for calculation, image preprocessing is not taken into consideration. This is because image processing must be performed in the same way with a new algorithm. The newly required edge extraction work is negligible, as verified by the results of section 6. In the new algorithm, it is necessary to evaluate equation (5) for each particle. The number of operations per particle is about 30, most of which are floating point operations. Total calculation work is T '≒ 90 (7)
This corresponds to a basic operation, which means a work amount of 60 Nf per second. Compared to the number of basic operations required by the basic algorithm, this means a speed increase of T (1500) / T ′ = 2 · 10 ³ times in the studied example. However, the actual speedup is below this for the entire system. This is because in this optimized implementation, the calculation of the motion of the human body model and the resulting 2D contour must also be performed on each particle, which becomes a bottleneck. The calculation of the likelihood function and the actual speeding up of the system are shown in section 6.

4). Effect of low frame rate The low frame rate of the input image sequence is disadvantageous for any markerless human motion capture system. In the following, it is assumed that the same motion is captured at a _first frame rate f ₁ and a second frame rate f ₂ where f ₂ <f ₁ , resulting in image sequences V ₁ and V ₂ , respectively. . In this case, the angle change at each of the joint portions of the continuous image at V ₂ is larger by f ₁ / f ₂ times than V ₁ . Since the total search space increases exponentially with the number of DOFs d, the relationship between the search space size s (V ₁ ) and s (V ₂ ) is given by:

これは、このシステムにおいてフレームレートを半減すると２^２８倍のパーティクルが必要となる、という意味ではなく、定性的な結論として、２倍のフレームレートで動作させれば実際の探索空間を大いに減じることができる、という意味である。従って、パーティクルの数が同じでフレームレートが２倍ならば、人体のモーションキャプチャシステムの精度と解像度とはかなり高くなる。

This is because when halving the frame rate 2 ²⁸ times the particle is required in this system does not mean that, as a qualitative conclusion, greatly reduced it the actual search space be operated at twice the frame rate It means that you can. Therefore, if the number of particles is the same and the frame rate is doubled, the accuracy and resolution of the human motion capture system will be considerably higher.

  Another major advantage of high frame rate is that the risk of detecting false edges is naturally reduced. In general, in computer vision, a smaller search space has two advantages at the same time. That is, higher “efficiency” and higher “robustness”. For example, epipolar geometry not only significantly speeds up the correlation process in the case of stereoscopic viewing, but also reduces the probability of false correspondences, as well as the smaller results that result from high frame rates in human motion capture systems. The search space reduces the probability of incorrect shapes and results in a more robust system.

A good guideline for edge cues in the human body motion capture system is that the distance between successive images in a direction perpendicular to the principal axis of the body part is less than half the width of the body part. Otherwise, the probability of incorrect shape is relatively high. This is because one of the two edges of the body part is already easily associated with the wrong edge. The optimized algorithm used in this embodiment achieves a speed increase of 2 to 3 times, but the edges are extracted “independently” from the prediction, so that this condition is strictly met. Is required. In conclusion, a higher frame rate will result in a more efficient, more accurate and more robust system, the difference cannot be explained simply by the linear scale factor f ₁ / f ₂ .

5. Implementation 5.1 Structure FIG. 4 shows a human motion capture (HMC) system 124 according to one embodiment of the present invention. Referring to FIG. 4, the HMC system 124 receives two images 120 and 122 from two cameras mounted at a relatively short distance on the robot's head and receives the most probable human body model parameters 126. Is output. By using two cameras, that is, by processing a sequence of image pairs, it is possible to extract realistic 3D motion.

Referring to FIG. 4, the HMC system 124 includes a pair of 3 × 3 Gaussian smoothing modules 140 for smoothing the images 120 and 122 and removing noise, and edges (of lines that apply to the edges shown in FIG. 3). A pair of A and B) and a pair of preprocessing modules 142 for extracting the center of gravity of the skin color and calculating a clothing color map and a depth calculation map, and information extracted and calculated by the preprocessing module 142 A new shape set prediction module 144 for predicting the shape of a new human body model by adding noise to the particles of the previous probability density function using a dynamic model based on by comparing the information output from, for each of the respective per right and left cameras predicted shape s _i, the probability density function _{(S i,} π _i) calculating a}, and a pair of likelihood calculation module 146.

The HMC system 124 further includes a PD (probability density) storage unit 148 for storing the probability density function {(s _i , π _i )} calculated by the likelihood calculation module 146, and the average shape of the human body model

を、ＰＤ記憶部１４８に記憶された確率密度関数に基づいて計算し、計算された平均形状を人体モデルパラメータ１２６として出力するための平均形状計算モジュール１５０と、次のフレームの前処理のために、平均形状計算モジュール１５０によって計算された平均形状

Is calculated based on the probability density function stored in the PD storage unit 148, and the average shape calculation module 150 for outputting the calculated average shape as the human body model parameter 126, and for the preprocessing of the next frame The average shape calculated by the average shape calculation module 150

を記憶するための平均形状記憶部１５２とを含む。平均形状記憶部１５２は前処理モジュール１４２に接続され、前処理モジュール１４２はこの平均形状を利用して、次の画像１２０及び１２２を前処理する。同様に、新形状組予測モジュール１４４は、ＰＤ記憶部１４８に記憶された確率密度関数を利用して、次の画像フレームのための新たな形状の組を予測する。

And an average shape storage unit 152 for storing. The average shape storage unit 152 is connected to the preprocessing module 142, and the preprocessing module 142 uses the average shape to preprocess the next images 120 and 122. Similarly, the new shape set prediction module 144 uses the probability density function stored in the PD storage unit 148 to predict a new shape set for the next image frame.

FIG. 5 shows details of the preprocessing module 142. Referring to FIG. 5, the preprocessing module 142 finds edge pixels within the distance δ from the edge projected from the human body model in the camera images 120 and 122 for each of the shapes s _i , and sets the edge pixels to these edge pixels. An edge extraction module 160 for obtaining a line segment to be applied and outputting information about two end points of the line segment, and for extracting a center of gravity of a blob having a predetermined skin color in each image Based on the skin color centroid extraction module 162, the clothing color map calculation module 164 for calculating the color map of the user's clothing to capture the motion, and the two images 120 and 122, the image depth map is calculated. A depth map calculation module 168. All the outputs of these modules 160, 162, 164 and 168 are provided to the new shape set prediction module 144.

  FIG. 6 shows a control structure of a computer program for realizing the edge extraction module 160 shown in FIG. Referring to FIG. 6, in step 180, steps 182 to 190 are repeated for all edges projected from the average shape of the human body model. After these steps are repeated for all edges, control exits this routine.

  In step 182, search points are determined at a fixed distance Δ over the entire projection edge to be processed. At step 184, step 186 is repeated for all search points. In step 186, a high-contrast feature point is searched for within a certain search distance δ in the direction (both) orthogonal to the projected edge, starting from the search point. With this operation, an edge pixel in the camera image is found.

  When step 186 is repeated for all search points, control proceeds to step 188. In step 188, a line segment (regression line) that applies to the edge point found in step 186 is obtained. In step 190, two representative points A and B (see FIG. 3) of this line segment are determined.

5.2 Operation The HMC system 124 of this embodiment operates as follows. Referring to FIG. 4, given two images 120 and 122, a Gaussian smoothing module 140 smooths each image and removes noise. The image processed in this way is given to the preprocessing module 142.

  In the preprocessing module 142, referring to FIG. 5, the average shape of the human body model obtained in the previous frame cycle is obtained.

について、エッジ抽出モジュール１６０がこの形状から投影されたエッジを計算し、投影されたエッジの各々全体にわたり、一定の距離Δをあけて探索点を決定し、探索点を起点として、投影エッジに直行する方向で一定の探索距離δ内の高コントラストな特徴を持つ点を探索し、これらエッジ画素に当てはまる線分を求め、線分の２つの代表点を決定し、これらの点の座標を出力する。

, The edge extraction module 160 calculates projected edges from this shape, determines a search point at a fixed distance Δ over each of the projected edges, and goes straight to the projected edge starting from the search point Search for points with high-contrast features within a certain search distance δ in the direction to be detected, find line segments that apply to these edge pixels, determine two representative points of the line segments, and output the coordinates of these points .

  Similarly, the skin color centroid extraction module 162 outputs the centroid of the blob having the skin color in the image, the clothing color map calculation module 164 calculates a pixel map with a predetermined clothing color, and the depth map calculation module 168 calculates a depth map from the images of both cameras. All outputs of these modules are provided to the new shape set prediction module 144.

The new shape set prediction module 144 adds a noise to the particles of the last probability density function {(s _i , π _i )} stored in the PD storage unit 148, thereby using the dynamic model to create a new human body model. Predict a set of shapes. This set of new human body model shapes is provided to the likelihood calculation module 146.

For each predicted shape, the likelihood calculation module 146 compares the information output from the pre-processing module 142 with the image projected from the target model shape, and the edge, skin color centroid, clothing color map , And the depth map error, and then multiplying these probabilities to calculate the overall probability of the model shape of interest, and for each shape s _i , the probability density function {(s _i , Π _i )}.

  The PD storage unit 148 stores this probability density variable.

  The average shape calculation module 150 is an average shape

を、平均形状計算モジュール１５０に記憶された確率密度関数に基づいて計算し、この平均形状を人体モデルパラメータ１２６として出力する。平均形状記憶部１５２は平均形状計算モジュール１５０の出力を記憶して、次のフレームサイクルの動作に備える。

Is calculated based on the probability density function stored in the average shape calculation module 150, and this average shape is output as the human body model parameter 126. The average shape storage unit 152 stores the output of the average shape calculation module 150 to prepare for the next frame cycle operation.

6). Results The inventors compared the efficiency of the new algorithm of this example with a system utilizing a basic algorithm and an algorithm based on on-the-fly edge detection. The results are shown in Table 1.

表１は２．８ＧＨｚクロック信号で動作する最新のコンピュータでの効率を比較したものである。テストでは、１０００個のパーティクルを用いた。値は１フレームの処理時間である。表１を参照して、この実施の形態に係るアルゴリズムは、２０００倍以上の高速化を達成できる可能性がある。しかし、システム全体の現在の実現例では、人体モデルの運動及びその結果得られる輪郭の計算がボトルネックであり、このため、実質的な高速化は１３０倍となっている。

Table 1 compares the efficiency of a modern computer operating with a 2.8 GHz clock signal. In the test, 1000 particles were used. The value is the processing time for one frame. Referring to Table 1, there is a possibility that the algorithm according to this embodiment can achieve speedup of 2000 times or more. However, in the current implementation of the entire system, the motion of the human body model and the calculation of the resulting contour is a bottleneck, so the substantial speedup is 130 times.

  In testing video sequences captured at 60 Hz, the algorithm used in this embodiment achieved even better results than the system based on the basic algorithm and an approach based on on-the-fly edge detection. That is, the likelihood calculated in this embodiment appeared to be more appropriate. It is difficult to prove this by theory. However, the resulting video image containing a projection of the calculated average shape clearly shows this effectiveness. The sequence of 8 frames processed is shown in FIG.

  FIG. 7 illustrates a sequence of 8 images captured at 60 Hz. From left to right, the first column is image 1-4, and the second column is image 5-8. The projected edge of the calculated average shape of the human body model is displayed as a white edge. Video sequences captured at 30 Hz have also shown that the system works at such a low frame rate.

7). CONCLUSION In this document, the inventors have presented a human motion capture system with a highly optimized likelihood function for edge tracking using a particle filter. The algorithm used was described in detail, the efficiency and effectiveness were examined, theoretically compared with the usual approach, and the results were actually verified. The only additional requirement of the algorithm used in this embodiment, a high camera frame rate of at least 30 Hz, preferably 60 Hz or more, makes sense for any real-time human motion capture system rather than a limitation. It should be called selection.

  As shown in Section 6, the algorithm used in this embodiment computes the likelihood function 2000 times faster than the normal approach and 3000 times faster than the approach based on on-the-fly edge detection. To do. Here, it is stated that the effective speed-up of the entire system is about 130 times that of the normal approach. In the likelihood function used in this embodiment, the bottleneck for further speeding up is a human body model.

  As far as the present inventors know, only by the algorithm used in this embodiment, real-time human body motion capture can be realized without markers. This algorithm will play an important role in the human body motion capture system for application to the active head of humanoid robot.

  The embodiment disclosed herein is merely an example, and the present invention is not limited to the above-described embodiment. The scope of the present invention is indicated by each claim in the claims after taking into account the description of the detailed description of the invention, and all modifications within the meaning and scope equivalent to the wording described therein are intended. Including.

It is a figure which shows roughly how an image edge is calculated | required from the edge projected from the human body model. It is a figure which shows a line segment and the error scale of a line roughly. It is a figure which shows the result of the line segment applied to two edges of an image, and the two lines projected from the human body model. 1 is a block diagram of a human body motion capture system 124 according to one embodiment of the invention. FIG. FIG. 5 is a detailed view of the preprocessing module 142 shown in FIG. 4. FIG. 6 is a control flow diagram of a computer program that implements the edge extraction module 160 shown in FIG. 5. FIG. 6 shows a sequence of 8 frames processed according to an embodiment of the present invention.

Explanation of symbols

50 and 52 Projected edges 60 and 62 Regression lines 120 and 122 Image 124 HMC system 126 Human body model parameter 140 Gaussian smoothing module 142 Preprocessing module 144 New shape set prediction module 146 Likelihood calculation module 148 PD storage unit 150 Average shape Calculation module 152 Average shape storage unit 160 Edge extraction module 162 Skin color centroid extraction module 164 Clothing color map calculation module 168 Depth map calculation module

Claims (6)

A method of tracking edges in a series of images of an object,
Preparing a model describing the shape of the object;
Projecting an edge of the model of the object onto an image plane of the image;
Searching for a set of edge pixels of the image in a predetermined area around each of the edges projected onto the image plane;
Fitting a line segment for each set of edge pixels of the projected edge;
For each projected edge, representing the line segment with a set of predetermined parameters defining the line segment;
Updating an object model using the line segment. The searching step comprises:
Determining a set of search points for each of the projected edges;
For each of the search points for each of the projected edges, search for a high contrast point in the image that is within a predetermined distance in a direction intersecting the projected edge on both sides of the projected edge. The method of claim 1 comprising the steps of: The method of claim 2, wherein the direction intersecting the projected edge is a direction orthogonal to the projected edge. Said determining step comprises:
4. A method according to claim 2 or claim 3, comprising determining the set of search points for each of the projected edges at a certain distance. The model is described by a plurality of shapes that can be taken by the model and the probabilities associated with each of the shapes, and the updating step includes adding noise to particles of a selected probability distribution function of the model shape. Predicting a new set of model shapes;
Calculating a predetermined error measure between each edge set of the new set of shape of the model and the set of edge pixels;
Assigning a weight to each shape of the new set of shapes according to the associated error measure calculated in the calculating step;
Calculating a new model by calculating a sum of new shapes weighted with respective weights. A computer program that, when executed on a computer, causes the computer to execute all the steps according to any one of claims 1 to 5.

Images