Successive Convex Matching for Action Detection

We propose human action detection based on a successive convex matching scheme. Human actions are represented as sequences of postures and specific actions are detected in video by matching the time-coupled posture sequences to video frames. The template sequence to video registration is formulated as an optimal matching problem. Instead of directly solving the highly non-convex problem, our method convexifies the matching problem into linear programs and refines the matching result by successively shrinking the trust region. The proposed scheme represents the target point space with small sets of basis points and therefore allows efficient searching. This matching scheme is applied to robustly matching a sequence of coupled binary templates simultaneously in a video sequence with cluttered backgrounds.

• Type: Conference
• Year: 2006
• Where: CVPR
• Authors: Hao Jiang, Mark S. Drew, Ze-Nian Li
• Keywords: Computer Vision, Convex Matching Scheme, CVPR 2006, Non-convex Problem, Optimal Matching Problem, Time-coupled Posture Sequences, Video Sequence