• 정보기술과데이타베이스저널
• /
• 제3권1호
• /
• pp.97-108
• /
• 1996

In this paper we obtain several function defined on finite partially ordered sets(posets) which may indicate constraints of comparability on sets of teams(tasks, etc.) for which evaluation is computationally simple, a relatively rare condition in graph-based algorithms. Using these functions a set of numerical coefficients and associated distributions obtained from a computer simulation of certain families of random graphs is determined. From this information estimates may be made as to the actual linearity of complicated posets. Applications of these ideas is to all areas where obtaining rankings from partial information in rational ways is relevant as in, e.g., team_, scaling_, and scheduling theory as well as in theoretical computer science. Theoretical consideration of special and desirable properties of various functions is provided permitting judgment concerning sensitivity of these functions to changes in parameters describing (finite) posets.

• 제어로봇시스템학회논문지
• /
• 제22권9호
• /
• pp.773-777
• /
• 2016

In this paper, a novel multi-object tracking method to track an unknown number of objects is proposed. To handle multiple object states and uncertain observations efficiently, a probability hypothesis density (PHD) filter is adopted and modified. The PHD filter is capable of reducing false positives, managing object appearances and disappearances, and estimating the multiple object trajectories in a unified framework. Although the PHD filter is robust in cluttered environments, it is vulnerable to false negatives. For this reason, we propose to exploit local observations in an RFS of the observation model. Each local observation is generated by using an online trained object detector. The main purpose of the local observation is to deal with false negatives in the PHD filtering procedure. The experimental results demonstrated that the proposed method robustly tracked multiple objects under practical situations.