In order to solve the problems of poor stability and multiple mismatching points in image registration, most scholars have used Random Sample Consensus (RANSAC) algorithm to optimize the matching algorithm. However, because of the randomness of the RANSAC algorithm itself, the matching algorithm has poor stability, low registration efficiency and poor robustness. To solve this problem, an improved SIFT (Scale-invariant feature transform) image registration optimization algorithm based on PROSAC (Progressive Sampling Consensus) was proposed. The experimental results showed that the proposed image registration optimization algorithm could effectively solve the problems of error matching and low efficiency in the process of image matching. Using the same image to test, the average correct registration rate of the traditional RANSAC improved SIFT algorithm was 82%, and the average running time was 36 seconds. The average correct registration rate of the SIFT image registration algorithm based on PROSAC improved SIFT image registration algorithm was 86.67%, the average running time was 26.51 seconds, and the running efficiency was increased by 36%. Therefore, the improved SIFT image registration algorithm based on PROSAC has higher robustness, can meet the needs of fast image mosaic, and has broad application prospects.In order to solve the problems of poor stability and multiple mismatching points in image registration, most scholars have used Random Sample Consensus (RANSAC) algorithm to optimize the matching algorithm. However, because of the randomness of the RANSAC algorithm itself, the matching algorithm has poor stability, low registration efficiency and poor robustness. To solve this problem, an improved SIFT (Scale-invariant feature transform) image registration optimization algorithm based on PROSAC (Progressive Sampling Consensus) was proposed. The experimental results showed that the proposed image registration optimization algorithm could effectively solve the problems of error matching and low efficiency in the process of image matching. Using the same image to test, the average correct registration rate of the traditional RANSAC improved SIFT algorithm was 82%, and the average running time was 36 seconds. The average correct registration rate of the SIFT image registration algorithm based on PROSAC improved SIFT image registration algorithm was 86.67%, the average running time was 26.51 seconds, and the running efficiency was increased by 36%. Therefore, the improved SIFT image registration algorithm based on PROSAC has higher robustness, can meet the needs of fast image mosaic, and has broad application prospects.
As the development of surveillance in public, person re-identification becomes more and more important. The largescale databases call for efficient computation and storage, hashing technique is one of the most important methods. In this paper, we proposed a new deep classification hashing network by introducing a new binary appropriation layer in the traditional ImageNet pre-trained CNN models. It outputs binary appropriate features, which can be easily quantized into binary hash-codes for hamming similarity comparison. Experiments show that our deep hashing method can outperform the state-of-the-art methods on the public CUHK03 and Market1501 datasets.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.