Motion Tracking with Normalized Cut and Minimum Spanning Tree
نویسندگان
چکیده
We propose using the Normalized Cut method for motion tracking (J. Shi and J. Malik . “Motion Segmentation and Tracking Using Normalized Cuts”. In IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8), pages 888 905, 2000) on regions in frames that were identified by a Minimum Spanning Tree (MST) method in a pre-proccessing step. The purpose of the pre-proccessing step is to reduce the spatial resolution without losing important image information. An energy function, based on some selected properties of regions, is then calculated for each pair of regions in a fixed number of consecutive frames. This energy function represents the similarity of two regions. Based on this similarity, the Normalized Cut method is used to identify salient groups of regions. Finally, corresponding salient groups of regions of neighbouring sets of consecutive frames are found. We show on different experiments, how pre-segmentation can help to reduce computation time by reducing the spatial resolution of the input frames. We tested different methods to reduce temporal resolution to gain an additional speedup.
منابع مشابه
Motion Segmentation Using Spanning Trees and Graph Cuts
Motion segmentation in videos involves identifying regions in the frames of the video that correspond to independently moving objects. This is one of the key techniques that help solve various problems encountered when dealing with image sequences, such as redundancy elimination in digital video and tracking of moving objects. Graph theoretic approaches have been widely used for performing segm...
متن کاملComparing Hierarchies of Segmentations: Humans, Nomalized Cut, and Minimum Spanning Tree
Minimum spanning tree and normalized cut based segmentation method are evaluated with respect to segmentations made by humans. The segmentation error is determined by two discrepancy measures, as a sum of miss-counted segmented pixels. Gray value images are used for the evaluation. This benchmarking is well suited in finding the class of images best suited for a particular method.
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملHuman Action Recognition algorithm based on Minimum Spanning Tree of CPA Models
Human pose recognition algorithm for monocular video was proposed to model human part parameters using video features combination with 3D motion capture data. Firstly Constant Part Appearance (CPA) Models and threedimensional motion data projection constraint graph structure was defined. To simplify the reasoning process, a constraint graph of the spanning tree construction algorithm and the ba...
متن کاملA Stock Market Filtering Model Based on Minimum Spanning Tree in Financial Networks
There have been several efforts in the literature to extract as much information as possible from the financial networks. Most of the research has been concerned about the hierarchical structures, clustering, topology and also the behavior of the market network; but not a notable work on the network filtration exists. This paper proposes a stock market filtering model using the correlation - ba...
متن کامل