Applications for tracking multiple objects in an image sequence are frequently challenged by various uncertainties, such as occlusion, misdetection, and abrupt camera motion. In practical environments, these uncertainties may occur simultaneously and with no pattern so that they must be jointly considered to achieve reliable tracking. We propose a two-step online multi-object tracking framework that incorporates a confidence-aided relative motion network (RMN) to jointly consider various difficulties. Because of the framework’s two-step data association process and the similarity function using RMNs, the proposed method achieves robust performance in the presence of most kinds of uncertainties. In our experiments, the proposed method exhibits a very robust and efficient performance compared with other state-of-the-art algorithms.
We propose a real-time line matching method for stereo systems. To achieve real-time performance while retaining a high level of matching precision, we first propose a nonparametric transform to represent the spatial relations between neighboring lines and nearby textures as a binary stream. Since the length of a line can vary across images, the matching costs between lines are computed within an overlap area (OA) based on the binary stream. The OA is determined for each line pair by employing the properties of a rectified image pair. Finally, the line correspondence is determined using a winner-takes-all method with a left-right consistency check. To reduce the computational time requirements further, we filter out unreliable matching candidates in advance based on their rectification properties. The performance of the proposed method was compared with state-of-the-art methods in terms of the computational time, matching precision, and recall. The proposed method required 47 ms to match lines from an image pair in the KITTI dataset with an average precision of 95%. We also verified the proposed method under image blur, illumination variation, and viewpoint changes.
For the fast and accurate self-localization of mobile robots, landmarks can be used very efficiently in the complex workspace. In this paper, we propose a simple color landmark model for self-localization and a fast landmark detection and tracking algorithm based on the proposed landmark model. We develop a color landmark with a symmetric and repetitive structure, which shows invariant color histogram characteristics under some geometric distortions. Detection and tracking of the model are accomplished by a factored sampling technique in which color similarity is estimated by the color histogram intersection. We also use the color similarity to update the color histogram model of the landmark model for robust tracking under illumination change. We demonstrate the feasibility of the proposed technique through experiments in cluttered indoor environments. Experimental results show that proposed landmark is enough to be used in cluttered environment and proposed detects and tracks the landmark in cluttered scene in near real-time robustly.
Color image segmentation plays an important role in the computer vision and image processing area. In this paper, we propose a novel color image segmentation algorithm in consideration of human visual sensitivity for color pattern variations by generalizing K-means clustering. Human visual system has different color perception sensitivity according to the spatial color pattern variation. To reflect this effect, we define the CCM (Color Complexity Measure) by calculating the absolute deviation with Gaussian weighting within the local mask and assign weight value to each color vector using the CCM values.