http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-104657986-A
Outgoing Links
| Predicate | Object |
|---|---|
| assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_1fefd66fdbc3870bbaa8e5a4f87bdb0a |
| classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06T7-00 |
| filingDate | 2015-02-02-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_eebcb85f63f710fe8c9e37aada34bf94 http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_013242e8873eda02762ae89caaffa628 |
| publicationDate | 2015-05-27-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationNumber | CN-104657986-A |
| titleOfInvention | Quasi-dense matching extension method based on subspace fusion and consistency constraint |
| abstract | The invention discloses a quasi-dense matching extension method based on subspace fusion and consistency constraint. The quasi-dense matching extension method comprises the following steps: firstly, acquiring reliable seed matching, and selecting a region to be extended around the seed matching; secondly, performing dense SIFT characteristic extraction on all pixel points to be extended in the region, and through subspace learning, fusing characteristic information and position information of the pixel points to be extended. During matching seeking, a local non-rigid transformation is learned through the consistency constraint, and compared with an affine transformation model and other models, the local non-rigid transformation can better describe nonplanar complex scenes; after each extension, an extension result is optimized to get rid of bad matching points; an extension process is repeated constantly until new matching cannot be found; the quasi-dense matching extension method has relatively good robustness for a scene with a complex surface structure; by the quasi-dense matching extension method, under the condition of less image, accurate and dense reconstruction of a target scene becomes possible. |
| isCitedBy | http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-110057359-A http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-110634149-A http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-106570823-B http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-106570823-A http://rdf.ncbi.nlm.nih.gov/pubchem/patent/WO-2020259365-A1 http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-105427310-B http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-105427310-A http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-109829502-A http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-108510465-A http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-109829502-B http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-108510465-B http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-110634149-B http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-109886293-A http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-109886293-B |
| priorityDate | 2015-02-02-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
Total number of triples: 29.