• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.2
• /
• pp.93-100
• /
• 2014

3D object recognition using only 2D images is a difficult work because each images are generated different to according to the view direction of cameras. Because SIFT algorithm defines the local features of the projected images, recognition result is particularly limited in case of input images with strong perspective transformation. In this paper, we propose the object recognition method that improves SIFT algorithm by using several sequential images captured from rotating 3D object around a rotation axis. We use the geometric relationship between adjacent images and merge several images into a generated feature space during recognizing object. To clarify effectiveness of the proposed algorithm, we keep constantly the camera position and illumination conditions. This method can recognize the appearance of 3D objects that previous approach can not recognize with usually SIFT algorithm.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06a
• /
• pp.250-251
• /
• 2010

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.6
• /
• pp.49-59
• /
• 2008

SIFT(Scale Invariant Feature Transform) is an algorithm to extract vectors at pixels around keypoints, in which the pixel colors are very different from neighbors, such as vortices and edges of an object. The SIFT algorithm is being actively researched for various image processing applications including 3-D image constructions, and its most computation-intensive stage is a keypoint localization. In this paper, we develope a fixed-point model of the keypoint localization and propose its efficient hardware architecture for embedded applications. The bit-length of key variables are determined based on two performance measures: localization accuracy and error rate. Comparing with the original algorithm (implemented in Matlab), the accuracy and error rate of the proposed fixed point model are 93.57% and 2.72% respectively. In addition, we found that most of missing keypoints appeared at the edges of an object which are not very important in the case of keypoints matching. We estimate that the hardware implementation will give processing speed of $10{\sim}15\;frame/sec$, while its fixed point implementation on Pentium Core2Duo (2.13 GHz) and ARM9 (400 MHz) takes 10 seconds and one hour each to process a frame.

• Journal of the Korea institute for structural maintenance and inspection
• /
• v.26 no.5
• /
• pp.30-42
• /
• 2022

Due to the increase in construction of tunnels, the burdens of maintenance works for tunnel structures have been increasing in Korea. In addition, the increase of traffic volume and aging of materials also threatens the safety of tunnel facilities, therefore, maintenance costs are expected to increase significantly in the future. Accordingly, automated condition assessment technologies like image-based tunnel scanning system for inspection and diagnosis of tunnel facilities have been proposed. For image-based tunnel scanning system, it is key to create a planar image through stitching of multiple images captured by tunnel scanning system. In this study, performance of feature-based stitching algorithms suitable for stitching tunnel scanning images was evaluated. In order to find a suitable algorithm SIFT, ORB, and BRISK are compared. The performance of the proposed algorithm was determined by the number of feature extraction, calculation speed, accuracy of feature matching, and image stitching result. As for stitching performance, SIFT algorithm was the best in all parts of tunnel image. ORB and BRISK also showed satisfactory performance and short calculation time. SIFT can be used to generate precise planar images. ORB and BRISK also showed satisfactory stitching results, confirming the possibility of being used when real-time stitching is required.

• Journal of information and communication convergence engineering
• /
• v.12 no.4
• /
• pp.263-270
• /
• 2014

Corner detection and feature extraction are essential aspects of computer vision problems such as object recognition and tracking. Feature detectors such as Scale Invariant Feature Transform (SIFT) yields high quality features but computationally intensive for use in real-time applications. The Features from Accelerated Segment Test (FAST) detector provides faster feature computation by extracting only corner information in recognising an object. In this paper we have analyzed the efficient object detection algorithms with respect to efficiency, quality and robustness by comparing characteristics of image detectors for corner detector and feature extractors. The simulated result shows that compared to conventional SIFT algorithm, the object recognition system based on the FAST corner detector yields increased speed and low performance degradation. The average time to find keypoints in SIFT method is about 0.116 seconds for extracting 2169 keypoints. Similarly the average time to find corner points was 0.651 seconds for detecting 1714 keypoints in FAST methods at threshold 30. Thus the FAST method detects corner points faster with better quality images for object recognition.

• International Journal of Contents
• /
• v.13 no.4
• /
• pp.70-79
• /
• 2017

Images are an important element in patents and many experts use images to analyze a patent or to check differences between patents. However, there is little research on image analysis for patents partly because image processing is an advanced technology and typically patent images consist of visual parts as well as of text and numbers. This study suggests two methods for using image processing; the Scale Invariant Feature Transform(SIFT) algorithm and Optical Character Recognition(OCR). The first method which works with SIFT uses image feature points. Through feature matching, it can be applied to calculate the similarity between documents containing these images. And in the second method, OCR is used to extract text from the images. By using numbers which are extracted from an image, it is possible to extract the corresponding related text within the text passages. Subsequently, document similarity can be calculated based on the extracted text. Through comparing the suggested methods and an existing method based only on text for calculating the similarity, the feasibility is achieved. Additionally, the correlation between both the similarity measures is low which shows that they capture different aspects of the patent content.

• Journal of Wellbeing Management and Applied Psychology
• /
• v.5 no.1
• /
• pp.37-46
• /
• 2022

Purpose: This study examines the history of the evolution of MS analysis and intends to consider the future direction of technological development through the difference from the latest technology, SIFT-MS. Research design, data and methodology: A method of analysis will be described in detail at the below by SIFT-MS (Selected Ion Flow Mass Spectrometry), which is a technology developed by a company called SIFT Technologies. Results: The initial concept of mass spectrometry was begun in the late 1890s, and it continues to evolve even after the 21st century through the ripening stage of the 20th century. The development process of mass spectrometry by year has been described in detail in the Main text. Conclusions: Mass spectrometry, qualitative and quantitative analysis of substances plays a very important role in the research and medical fields. The development of these analytical methods is expected to continue in the future, and faster and more accurate qualitative analysis and mass spectrometry will be developed than the level currently reached. In addition, it is expected that hardware and software will be configured so that non-analysis experts can handle it easily, and it will be used as a technology that is more closely related to our lives.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.4
• /
• pp.1066-1079
• /
• 2023

Multi-target tracking based on the detector is a very hot and important research topic in target tracking. It mainly includes two closely related processes, namely target detection and target tracking. Where target detection is responsible for detecting the exact position of the target, while target tracking monitors the temporal and spatial changes of the target. With the improvement of the detector, the tracking performance has reached a new level. The problem that always exists in the research of target tracking is the problem that occurs again after the target is occluded during tracking. Based on this question, this paper proposes a DeepSORT model based on SIFT features to improve ship tracking. Unlike previous feature extraction networks, SIFT algorithm does not require the characteristics of pre-training learning objectives and can be used in ship tracking quickly. At the same time, we improve and test the matching method of our model to find a balance between tracking accuracy and tracking speed. Experiments show that the model can get more ideal results.

• Journal of Korean Society for Geospatial Information Science
• /
• v.21 no.4
• /
• pp.101-107
• /
• 2013

Generally the commercial high-resolution images have their coordinates, but the locations are locally different according to the pose of sensors at the acquisition time and relief displacement of terrain. Therefore, a process of image co-registration has to be applied to use the multi-temporal images together. However, co-registration is interrupted especially when images include the cloud-covered regions because of the difficulties of extracting matching points and lots of false-matched points. This paper proposes an automatic co-registration method for the cloud-covered high-resolution images. A scale-invariant feature transform (SIFT), which is one of the representative feature-based matching method, is used, and only features of the target (cloud-covered) images within a circular buffer from each feature of reference image are used for the candidate of the matching process. Study sites composed of multi-temporal KOMPSAT-2 images including cloud-covered regions were employed to apply the proposed algorithm. The result showed that the proposed method presented a higher correct-match rate than original SIFT method and acceptable registration accuracies in all sites.

• Journal of KIISE
• /
• v.42 no.6
• /
• pp.699-706
• /
• 2015

In recent years, as near-duplicate image has been increasing explosively by the spread of Internet and image-editing technology that allows easy access to image contents, related research has been done briskly. However, BoF (Bag-of-Feature), the most frequently used method for near-duplicate image detection, can cause problems that distinguish the same features from different features or the different features from same features in the quantization process of approximating a high-level local features to low-level. Therefore, a post-verification method for BoF is required to overcome the limitation of vector quantization. In this paper, we proposed and analyzed the performance of a post-verification method for BoF, which converts SIFT (Scale Invariant Feature Transform) descriptors into 128 bits binary codes and compares binary distance regarding of a short ranked list by BoF using the codes. Through an experiment using 1500 original images, it was shown that the near-duplicate detection accuracy was improved by approximately 4% over the previous BoF method.