Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

A Non-overlapping Viewshed Target Matching Method Based on Modified Weighted Bipartite Graph

A non-overlapping horizon and target matching technology, which is applied in the field of non-overlapping horizon target matching based on modified weighted bipartite graphs, can solve problems such as large posterior probability

Active Publication Date: 2019-08-13
SOUTHEAST UNIV
View PDF3 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Construct a weighted bipartite graph, and solve the maximum a posteriori probability problem by solving the maximum weight matching of the bipartite graph

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A Non-overlapping Viewshed Target Matching Method Based on Modified Weighted Bipartite Graph
  • A Non-overlapping Viewshed Target Matching Method Based on Modified Weighted Bipartite Graph
  • A Non-overlapping Viewshed Target Matching Method Based on Modified Weighted Bipartite Graph

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0023] figure 1 The system flow chart of the non-overlapping view-shed target matching method based on the modified weighted bipartite graph is given: the maximum a posteriori probability framework is used to describe the non-overlapping view-shed target matching problem, and the target Observation model and monitoring network spatio-temporal constraints. The invention extracts the main color feature and the space texture feature of the target, and constructs a target observation model with strong robustness to illumination differences and environmental changes. On the premise that the topology of the monitoring network is known, the invention obtains the space-time constraints of the monitoring network from the topology. According to the space-time constraints of the monitoring network, the monitoring network topology is divided into multiple minimum units according to the principle of independence and minimization. For any target that disappears in the minimum unit, its rea...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention provides a disjoint-view object matching method based on a corrected weighted bipartite graph. The method relates to the field of computer vision. The method expresses a disjoint-view object matching problem as a maximum posterior probability problem, so that an object observation model and time-space constraints of a surveillance network are combined, and the maximum posterior probability problem is resolved through solving the maximum weight matching of a weighted bipartite graph. To solve the problem that construction of a common weighted bipartite graph is liable to introduction of incorrect matching, the method provides a corrected weighted bipartite graph construction method based on an adaptive threshold, so that incorrect matching is prevented from being introduced during construction of the weighted bipartite graph as much as possible. Aimed at the defect of a conventional KM method that the amount of computation is too large during large-scale weighted bipartite graph matching problem solving, the method brings forward a MH sampling-based method for approximating and solving the maximum weight matching of the weighted bipartite graph, so that a disjoint-view object matching relationship is obtained.

Description

technical field [0001] The invention belongs to the field of computer vision, specifically relates to the field of intelligent monitoring, in particular to a non-overlapping view target matching method based on a modified weighted bipartite graph. Background technique [0002] With the development of camera monitoring technology, monitoring a large area has become an important means to ensure the safety of people's lives and property. However, for a monitoring situation with a large area, it is unrealistic to use cameras to cover all the monitoring areas. Therefore, the method of covering key areas is usually used to build a multi-camera surveillance system with non-overlapping fields of view. For non-overlapping viewshed monitoring networks, only by determining the matching relationship of targets in different viewsheds can we better understand the behavior of targets in the entire surveillance scene. However, interference factors such as illumination changes and scene ch...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): H04N7/18G06K9/62G06K9/46
Inventor 林国余杨彪张宇歆张为公戴栋
Owner SOUTHEAST UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com