Method for Data Segmentation using Laplacian Graphs
AssigneeMitsubishi Electric Research Laboratories, Inc.
InventorsFatih Porikli, Feng Li
Life of this patent
Estimating the term…
Abstract
A method segments n-dimensional by first determining prior information from the data. A fidelity term is determined from the prior information, and the data are represented as a graph. A graph Laplacian is determined from the graph from the graph, and a Laplacian spectrum constraint is determined from the graph Laplacian. Then, an objective function is minimized according to the fidelity term and the Laplacian spectrum constraint to identify a segment of target points in the data.
Claims20
A method for segmenting data, wherein the data are n-dimensional, comprising the steps of:
- determining prior information from the data;
- determining a fidelity term from the prior information;
- representing the data as a graph;
- determining a graph Laplacian from the graph;
- determining a Laplacian spectrum constraint from the graph Laplacian;
- and
- minimizing an objective function according to the fidelity term and the Laplacian spectrum constraint to identify a segment of target points in the data, wherein the steps are performed in a processor.
The method of claim wherein the objective function uses a sparse decomposition.
Dependencies are inferred from the claim text.