CN107220932B - Panoramic image splicing method based on bag-of-words model - Google Patents

Panoramic image splicing method based on bag-of-words model Download PDF

Info

Publication number
CN107220932B
CN107220932B CN201710251608.5A CN201710251608A CN107220932B CN 107220932 B CN107220932 B CN 107220932B CN 201710251608 A CN201710251608 A CN 201710251608A CN 107220932 B CN107220932 B CN 107220932B
Authority
CN
China
Prior art keywords
image
key frame
images
bag
homography matrix
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201710251608.5A
Other languages
Chinese (zh)
Other versions
CN107220932A (en
Inventor
张国山
张玉龙
黄伟杰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tianjin University
Original Assignee
Tianjin University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Tianjin University filed Critical Tianjin University
Priority to CN201710251608.5A priority Critical patent/CN107220932B/en
Publication of CN107220932A publication Critical patent/CN107220932A/en
Application granted granted Critical
Publication of CN107220932B publication Critical patent/CN107220932B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T3/00Geometric image transformations in the plane of the image
    • G06T3/40Scaling of whole images or parts thereof, e.g. expanding or contracting
    • G06T3/4038Image mosaicing, e.g. composing plane images from plane sub-images
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T3/00Geometric image transformations in the plane of the image
    • G06T3/14Transformations for image registration, e.g. adjusting or mapping for alignment of images
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T7/00Image analysis
    • G06T7/30Determination of transform parameters for the alignment of images, i.e. image registration
    • G06T7/33Determination of transform parameters for the alignment of images, i.e. image registration using feature-based methods
    • G06T7/337Determination of transform parameters for the alignment of images, i.e. image registration using feature-based methods involving reference images or patches

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Processing Or Creating Images (AREA)

Abstract

The invention relates to a panoramic image splicing method based on a bag-of-words model, which comprises the following steps: preparing a trained ORB bag tree; carrying out ORB feature extraction on an image i in an image data set to be spliced, setting k as a key frame inserted into a splicing structure chart, carrying out feature search on two images through a forward index, and establishing correspondence between features so as to obtain correspondence between the features of the two images; obtaining a homography matrix between the two images; minimizing a secondary projection error and excluding outer points by utilizing a random sampling maximum likelihood estimation algorithm so as to obtain an inner point set of a corresponding image pair; calculating the overlapping percentage of the images through a boundary matrix; calculating the overlap between the corresponding image pairs, and when the image i is used as a key frame and added into the splicing structure chart, establishing a relation with the previous key frame through a homography matrix; detecting a loop; forming a loop; optimizing a homography matrix; and fusing the image splicing structure chart.

Description

Panoramic image splicing method based on bag-of-words model
Technical Field
The invention belongs to the field of computer vision and digital image processing.
Background
The image stitching technology is an important branch of the field of computer vision and digital image processing, and is a technology for seamlessly stitching more than two partially overlapped images to obtain a higher-resolution or wide-viewing-angle image. Two of the most critical links in image stitching are image registration and image fusion. For the image fusion technology, the current method is not very different in time consumption and fusion effect, and is mature. However, for image registration, since the registration time and effect directly affect the speed and success rate of image stitching, image registration is always a hotspot of current research in image stitching. Common image registration methods are based on SIFT or SURF feature description images, which have the advantages of rotation invariance, scale invariance and being not easily affected by illumination, and research in the present stage is focused on binary features such as BRIEF, ORB and BRISK, because they require less storage space and are fast in computation. However, most of the image stitching methods at the present stage are based on a frame-to-frame comparison method, which can achieve a good effect when the number of images is small, but with the increase of the number of images, the method is not suitable when the real-time requirement is high.
Disclosure of Invention
The invention aims to provide a bag-of-words model-based panoramic image stitching method which is suitable for high real-time requirements.
A panoramic image splicing method based on a bag-of-words model comprises the following steps:
1) preparing a trained ORB bag tree;
2) carrying out ORB feature extraction on an image i in an image data set to be spliced, gradually descending a feature descriptor extracted from the image i from a root node of an ORB bag-of-words tree to a leaf node according to a Hamming distance, after traversing all features, storing a forward index of all features of the image in the bag-of-words tree, setting k as a key frame inserted into a splicing structure chart last time, carrying out feature search on two images through the forward index, and establishing correspondence between the features so as to obtain correspondence between the features of the two images;
3) obtaining a homography matrix between the two images according to the obtained correspondence of the characteristics between the two imageskHi
4) Minimizing a secondary projection error and excluding outer points by utilizing a random sampling maximum likelihood estimation algorithm so as to obtain an inner point set of a corresponding image pair;
5) calculating a boundary matrix of the image according to the obtained inner point set, and calculating the overlapping percentage of the image through the boundary matrix;
6) calculating an overlap between corresponding pairs of images based on the calculated percentage of overlapkOi=min(Ok,Oi) If the number of interior points is greater than the threshold τinAnd overlapkOiGreater than a threshold τovThe image i is saved as a potential key frame if the data to be stitchedIf the number and the overlap of the inner points obtained by concentrating the next frame of image and the key frame k do not meet the two thresholds, adding the image i as the key frame into the splicing structure chart;
7) when the image i is added into the mosaic structure diagram as a key frame, the image i needs to be associated with the previous key frame through a homography matrix, namely the image i is the (k + 1) th key frame of the mosaic structure diagram, and then the image i is the key framekHiIs expressed askHk+1Then homography matrix for k +1 key frameMHk+1Expressed as:MHk+1MHk kHk+1wherein, in the step (A),MHka homography matrix representing the kth key frame, M being a generic key frame defined to ensure alignment between key frames;
8) and (3) detecting a loop, and retrieving and matching the newly added key frame image i with all key frame images before the splicing structure chart: entering ORB characteristics of the newly added key frame image into a bag-of-words model, gradually reaching leaf nodes from a root node of a bag-of-words tree downwards according to a Hamming distance, calculating the frequency tf of each leaf node, namely each word in the bag-of-words tree appearing in an image i, searching all characteristics of the newly added key frame image in the bag-of-words tree to obtain the value of each word, and forming the values into a description vector of the image; setting the description vectors of the newly added key frame image and the last key frame image matched with the newly added key frame image as v respectively1V and v2The similarity score calculation formula of the two key frame images is expressed as follows:
Figure BDA0001272239910000021
the higher the score is, the higher the similarity of the two key frame images is, so that the similarity of the newly added key frame image and the previous key frame image can be obtained, and a high-to-low key frame similarity list can be obtained, wherein the key frame images are the key frames which are likely to form a loop with the newly added key frame image.
9) Calculating homography matrixes of the key frames and newly added key frames according to the similarity list sequence of the key frames, wherein if the number of the inner points obtained through the homography matrixes is more than a fixed threshold value, the corresponding connection relation becomes a part of a splicing structure chart, namely a loop is formed;
10) and optimizing the homography matrix, reducing errors caused by the homography matrix by adopting beam adjustment, wherein an error function epsilon is as follows:
Figure BDA0001272239910000022
wherein
Figure BDA0001272239910000023
And
Figure BDA0001272239910000024
representing corresponding feature points in both images, R: (MHi) Is a homography matrixMHiTo reduce the influence of outliers, a Huber loss function h (ε) { | ε { (L) } is introduced2if | Epsilon | is less than or equal to 1; 2| epsilon | to 1if | epsilon | is more than 1}, solving the obtained system nonlinear equation by a nonlinear least square algorithm so as to adjust and optimize a homography matrix;
11) and fusing the image splicing structure chart.
The main advantages and the characteristics of the invention are embodied in the following aspects:
1. at present, image registration in an image stitching algorithm is based on SIFT or SURF feature description images, and is not easily influenced by illumination due to the scale, rotation invariance and the like of the features, but the extraction of the features needs too much time, so that the real-time performance of the algorithm cannot meet the requirement, and in addition, the image registration is based on frame-to-frame matching, and the registration time is also increased. The retrieval structure based on the bag-of-words model provided by the invention adopts ORB characteristic descriptors. Experiments show that the image registration method based on the bag-of-words model can remarkably reduce the algorithm time while obtaining the registration effect.
2. The image splicing algorithm is mostly based on a single-thread algorithm at present, all parts of the algorithm have obvious sequentiality and coupling, the algorithm can adopt a multi-thread architecture, the simultaneous execution of different parts of the algorithm is realized, and the algorithm time can be effectively shortened on the basis of ensuring the splicing effect.
Drawings
FIG. 1 is a flow chart of the present invention bag-of-words model based multi-threaded image stitching algorithm;
FIG. 2 is a graph of image stitching of a Valldemossa dataset;
FIG. 3 is a topological structure diagram of a Valldemossa data set;
FIG. 4 is an image mosaic of an Odemar dataset;
FIG. 5 is a topological structure diagram of an Odemar dataset.
Detailed Description
The invention provides a multi-thread panoramic image splicing technology based on a bag-of-words model, which is described in detail by combining an example and an attached drawing as follows:
the overall framework of the algorithm of the invention is shown in fig. 1, the system is divided into four parts and the four parts can run in parallel, and the parallel design can reduce the coupling among the parts, thereby reducing the running time of the algorithm. The four parts are connected through a structure called a splicing structure diagram, and the structure is used for estimating the topological structure of a splicing environment and coordinating the relation among the parts to ensure real-time performance.
The splicing structure chart part is an important component of the method, wherein the topological graph represents the topological structure of the splicing environment and unifies the running mechanism among different parts. The topology of the environment represents the images participating in the image stitching and the connections between them. In the present invention, the mathematical model of the topology is in the form of an undirected graph, where the nodes represent the images selected in the final stitching and the connecting lines represent the overlap between them, and in the present invention, the images selected are called key frames. In order to generate the final mosaic, the key frames are selected, i.e. the mosaic image frames.
The other parts of the system and the building of the splicing structure chart are synchronously carried out, the key frame part describes an input image, enters a bag-of-words retrieval structure to process the image and determines whether the image is a key frame or not and is a component of a final splicing structure image; the closed loop detection part can establish the relation between the current frame and the matched key frame after detecting the matched image pair to form a loop; the optimization part adjusts the homography matrix through the adjustment of the beam method to reduce errors caused by mismatching; and the optimized mosaic structure diagram enters a fusion part to generate a final mosaic. The specific embodiment is as follows:
7) the bag-of-words tree is constructed, the DBoW2 library utilizes a large image database, and the ORB library and the SIFT library are trained off line and are used by people. In the present invention, the ORB bag tree that has been trained in the DBoW2 library is used.
8) And performing ORB feature extraction on an image i in the image data set to be spliced, gradually descending feature descriptors extracted from the image i from a root node of an ORB bag-of-words tree to leaf nodes according to a Hamming distance, and storing forward indexes of all features of the image in the bag-of-words tree after all features are traversed. k is a key frame inserted into the splicing structure chart, feature search is carried out on the two images through a forward index, and the correspondence between the features is established, so that the correspondence between the features of the two images is obtained;
9) obtaining a homography matrix between the two images according to the obtained correspondence of the characteristics between the two imageskHi
10) Minimizing a secondary projection error and excluding outer points by utilizing a random sampling maximum likelihood estimation algorithm so as to obtain an inner point set of a corresponding image pair;
11) calculating a boundary matrix of the image according to the obtained inner point set, and calculating the overlapping percentage of the image through the boundary matrix;
12) calculating an overlap between corresponding pairs of images based on the calculated percentage of overlapkOi=min(Ok,Oi) If the number of interior points is greater than the threshold τinAnd overlapkOiGreater than a threshold τovThen the image i is stored as a potential key frame, if the next frame image in the data set to be spliced and the key frame k obtain the number and the weight of the interior pointsIf the superposition does not meet the two thresholds, adding the image i as a key frame into the splicing structure chart;
7) when the image i is added into the splicing structure chart as a key frame, the image i needs to be connected with the previous key frame through a homography matrix, and then the homography matrix of the (k + 1) th key frameMHk+1Expressed as:MHk+1MHk kHk+1wherein M is a general key frame defined for ensuring the alignment between key frames, and a homography matrix of each key frame in the splicing structure chartMHk+1MHkAre all established with the key frame M;
8) and (3) detecting a loop, and retrieving and matching the newly added key frame image i with all key frame images before the splicing structure chart: the ORB characteristics of the newly added key frame images enter a bag-of-words model, the ORB characteristics of the newly added key frame images gradually reach leaf nodes from a root node of a bag-of-words tree step by step according to the Hamming distance, the frequency tf of each leaf node, namely each word in the bag-of-words tree appearing in an image i is calculated, each leaf node in the bag-of-words tree stores a reverse index, namely an image ID (identity) of the leaf node and the value of the word in an image description vector are stored, all the characteristics of the newly added key frame images are searched in the bag-of-words tree to obtain the value of each word, and the values form the description vector of the image; setting the description vectors of the newly added key frame image and the last key frame image matched with the newly added key frame image as v respectively1V and v2The similarity score calculation formula of the two key frame images is expressed as follows:
Figure BDA0001272239910000041
the higher the score is, the higher the similarity of the two key frame images is, so that the newly added key frame image and the previous key frame image can be obtained
The similarity of the images can obtain a high-to-low key frame similarity list, and the key frame images are possible to be related to new joining
The key frame image forms a key frame of a loop.
9) Calculating homography matrixes of the key frames and newly added key frames according to the similarity list sequence of the key frames, wherein if the number of the inner points obtained through the homography matrixes is more than a fixed threshold value, the corresponding connection relation becomes a part of a splicing structure chart, namely a loop is formed;
10) optimizing a homography matrix, wherein key frame images are connected through the homography matrix, the homography matrix has errors, optimization is needed, the errors caused by the homography matrix are reduced by adopting a light beam method adjustment, and an error function epsilon is as follows:
Figure BDA0001272239910000042
wherein
Figure BDA0001272239910000043
And
Figure BDA0001272239910000044
representing corresponding feature points in both images, R: (MHi) Is a homography matrixMHiTo reduce the influence of outliers, a Huber loss function h (ε) { | ε { (L) } without phosphor is introduced2if | Epsilon | is less than or equal to 1; 2| ε | -1if | ε | > 1 }; the obtained system nonlinear equation is solved through a nonlinear least square algorithm, the homography matrix is used as an initial value, convergence can be obtained through iteration, and therefore the homography matrix is adjusted.
11) And fusing the image splicing structure chart.
The fusion is the last step of the stitching algorithm for generating the final seamless stitching map, which is the application of stitching in the OPENCV library, including the stitch and line technique and the exposure compensation.
In order to verify the effectiveness and real-time performance of the method, two sets of data sets are selected. A Valldemossa data set collected in the underwater environment of Valldemossa in a Port city of Spain, including 201 320 × 180 pictures taken by a camera looking down, the data set including a large closed loop; the Odemar dataset, which is an underwater environment collected by Miquel Massot-Campos, contains 64 480X 270 pictures taken from the camera looking down, and does not contain a large closed loop. The experimental results are as follows:
1. the resulting mosaic of the Valldemossa dataset is shown in FIG. 2, the topology estimate of the environment is shown in FIG. 3, and the topology map contains 76 key frames. The mosaic of the acquired Odemar data set is shown in FIG. 4, the topological structure of the environment is shown in FIG. 5, and the topological structure contains 22 key frames.
2. The set of experiments are comparative experiments, and the two sets of data sets are still selected by comparing the method disclosed by the invention with a single-thread splicing method adopting an ORB characteristic, and the obtained experimental data are shown in table 1.
Table 1 is a data comparison of the experimental data of the present invention with a single-threaded image stitching algorithm based on ORB features;
Figure BDA0001272239910000051
table 1.

Claims (1)

1. A panoramic image splicing method based on a bag-of-words model comprises the following steps:
1) preparing a trained ORB bag tree;
2) carrying out ORB feature extraction on an image i in an image data set to be spliced, gradually descending a feature descriptor extracted from the image i from a root node of an ORB bag-of-words tree to a leaf node according to a Hamming distance, after traversing all features, storing a forward index of all features of the image in the bag-of-words tree, setting k as a key frame inserted into a splicing structure chart last time, carrying out feature search on two images through the forward index, and establishing correspondence between the features so as to obtain correspondence between the features of the two images;
3) obtaining a homography matrix between the two images according to the obtained correspondence of the characteristics between the two imageskHi
4) Minimizing a secondary projection error and excluding outer points by utilizing a random sampling maximum likelihood estimation algorithm so as to obtain an inner point set of a corresponding image pair;
5) calculating a boundary matrix according to the obtained inner point set, and further obtaining the overlapping percentage of the boundary matrix in the image;
6) calculating an overlap between corresponding pairs of images based on the calculated percentage of overlapkOi=min(Ok,Oi) If the number of interior points is greater than the threshold τinAnd overlapkOiGreater than a threshold τovIf the number and the overlap of the inner points obtained by the next frame of image in the data set to be spliced and the key frame k do not meet the two thresholds, adding the image i as the key frame into the splicing structure chart;
7) when the image i is added into the mosaic structure diagram as a key frame, the image i needs to be associated with the previous key frame through a homography matrix, namely the image i is the (k + 1) th key frame of the mosaic structure diagram, and then the image i is the key framekHiIs expressed askHk+1Then homography matrix for k +1 key frameMHk+1Expressed as:MHk+1MHk kHk+1wherein, in the step (A),MHka homography matrix representing the kth key frame, M being a generic key frame defined to ensure alignment between key frames;
8) and (3) detecting a loop, and retrieving and matching the newly added key frame image i with all key frame images before the splicing structure chart: entering ORB characteristics of newly added key frame images into a bag-of-words model, gradually reaching leaf nodes from a root node of a bag-of-words tree according to a Hamming distance, calculating the frequency tf of each leaf node, namely each word in the bag-of-words tree appearing in an image i, searching all characteristics of the newly added key frame images in the bag-of-words tree to obtain the value of each word, and forming the description direction of the image by the valuesAn amount; setting the description vectors of the newly added key frame image and the last key frame image matched with the newly added key frame image as v respectively1V and v2The similarity score calculation formula of the two key frame images is expressed as follows:
Figure FDA0002172465440000011
the higher the score is, the higher the similarity of the two key frame images is, so that the similarity of the newly added key frame image and the previous key frame image can be obtained, and a high-to-low key frame similarity list can be obtained, wherein the key frame images are the key frames which are possibly looped with the newly added key frame image;
9) calculating homography matrixes of the key frames and newly added key frames according to the similarity list sequence of the key frames, wherein if the number of the inner points obtained through the homography matrixes is more than a fixed threshold value, the corresponding connection relation becomes a part of a splicing structure chart, namely a loop is formed;
10) and optimizing the homography matrix, reducing errors caused by the homography matrix by adopting beam adjustment, wherein an error function epsilon is as follows:
Figure FDA0002172465440000012
wherein
Figure FDA0002172465440000021
And
Figure FDA0002172465440000022
representing corresponding feature points in both images, R: (MHi) Is a homography matrixMHiTo reduce the influence of outliers, a Huber loss function h (ε) { | ε { (L) } is introduced2If | epsilon | is less than or equal to 1; 2| epsilon | minus 1, if | epsilon | is more than 1, and the obtained system nonlinear equation is solved by a nonlinear least square algorithm, so that the optimization homography matrix is adjusted;
11) and fusing the image splicing structure chart.
CN201710251608.5A 2017-04-18 2017-04-18 Panoramic image splicing method based on bag-of-words model Active CN107220932B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710251608.5A CN107220932B (en) 2017-04-18 2017-04-18 Panoramic image splicing method based on bag-of-words model

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710251608.5A CN107220932B (en) 2017-04-18 2017-04-18 Panoramic image splicing method based on bag-of-words model

Publications (2)

Publication Number Publication Date
CN107220932A CN107220932A (en) 2017-09-29
CN107220932B true CN107220932B (en) 2020-03-20

Family

ID=59927589

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710251608.5A Active CN107220932B (en) 2017-04-18 2017-04-18 Panoramic image splicing method based on bag-of-words model

Country Status (1)

Country Link
CN (1) CN107220932B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109101981B (en) * 2018-07-19 2021-08-24 东南大学 Loop detection method based on global image stripe code in streetscape scene
CN109376631B (en) * 2018-10-12 2020-12-29 中国人民公安大学 Loop detection method and device based on neural network
CN109579844B (en) * 2018-12-04 2023-11-21 电子科技大学 Positioning method and system
CN116934591A (en) * 2023-06-28 2023-10-24 深圳市碧云祥电子有限公司 Image stitching method, device and equipment for multi-scale feature extraction and storage medium

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105856230A (en) * 2016-05-06 2016-08-17 简燕梅 ORB key frame closed-loop detection SLAM method capable of improving consistency of position and pose of robot
CN106529583A (en) * 2016-11-01 2017-03-22 哈尔滨工程大学 Bag-of-visual-word-model-based indoor scene cognitive method

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105856230A (en) * 2016-05-06 2016-08-17 简燕梅 ORB key frame closed-loop detection SLAM method capable of improving consistency of position and pose of robot
CN106529583A (en) * 2016-11-01 2017-03-22 哈尔滨工程大学 Bag-of-visual-word-model-based indoor scene cognitive method

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
Image Mosaic using ORB descriptor and improved blending algorithm;Fang Tian等;《2014 7th International Congress on Image and Signal Processing》;20150108;第693 - 698页 *
基于ORB关键帧闭环检测算法的SLAM方法研究;余杰;《中国学位论文全文数据库》;20170414;全文 *
基于ORB特征的视频图像拼接技术研究;姜鹏飞;《《中国优秀硕士学位论文全文数据库信息科技辑》》;20170215;第2017年卷(第2期);I138-2969 *

Also Published As

Publication number Publication date
CN107220932A (en) 2017-09-29

Similar Documents

Publication Publication Date Title
CN107220932B (en) Panoramic image splicing method based on bag-of-words model
Xiu et al. Pose Flow: Efficient online pose tracking
Lee et al. Loosely-coupled semi-direct monocular slam
WO2022160772A1 (en) Person re-identification method based on view angle guidance multi-adversarial attention
CN113205595B (en) Construction method and application of 3D human body posture estimation model
Li et al. Skeleton boxes: Solving skeleton based action detection with a single deep convolutional neural network
CN111768354A (en) Face image restoration system based on multi-scale face part feature dictionary
Ma et al. CapsuleRRT: Relationships-aware regression tracking via capsules
WO2023036157A1 (en) Self-supervised spatiotemporal representation learning by exploring video continuity
CN116342953A (en) Dual-mode target detection model and method based on residual shrinkage attention network
Liu et al. A task-guided, implicitly-searched and metainitialized deep model for image fusion
Fu et al. Learning heavily-degraded prior for underwater object detection
Huang et al. Life: Lighting invariant flow estimation
Chen et al. Learning meta-adversarial features via multi-stage adaptation network for robust visual object tracking
Yan et al. ASNet: Adaptive Semantic Network Based on Transformer-CNN for Salient Object Detection in Optical Remote Sensing Images
Wang et al. SPGNet: Spatial projection guided 3D human pose estimation in low dimensional space
Li et al. Pedestrian gender detection based on mask R-CNN
WO2021223747A1 (en) Video processing method and apparatus, electronic device, storage medium, and program product
Wang et al. Pixel-wise video stabilization
Cai et al. Explicit invariant feature induced cross-domain crowd counting
Lu et al. Deep Homography Estimation for Visual Place Recognition
Ming et al. Global-local dynamic feature alignment network for person re-identification
CN110189254B (en) Distortion parameter set bundle adjustment method for image data set and image splicing method
CN113222016A (en) Change detection method and device based on cross enhancement of high-level and low-level features
Jeune et al. A unified framework for attention-based few-shot object detection

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant