• Title/Summary/Keyword: SIFT

Search Result 347, Processing Time 0.025 seconds

Action recognition by SIFT and particle feature trajectories (SIFT와 Particle 특징 궤적 기반 행동인식)

  • Yu, Jeong-Min;Yang, E-hwa;Jeon, Moon-Gu
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2013.05a
    • /
    • pp.201-203
    • /
    • 2013
  • 본 논문에서는 SIFT 와 particle 특징 궤적을 이용한 새로운 행동 인식 시스템을 제안한다. 먼저, 영상에서 중요한 지역적 특징 정보를 얻기 위하여 SIFT 특징 점들을 탐지하고, 탐지한 특징 점들을 SIFT descriptor matching 기법을 이용하여 그 궤적을 추출한다. 또한, SIFT 특징 궤적들의 수량이 적은점과 영상내의 조명변화, 부분적 가려짐 등의 변화로 인해 SIFT 특징 궤적이 종종 없어지는 단점을 보완하기 위하여, SIFT 특징 궤적 주위에 particle 점들을 탐지하고, dense optical flow 기법을 기반으로 그 특징 궤적을 추출한다. 그리고 SIFT 와 particle 궤적의 중요도를 조절하기 위해 가중치를 부여한다. 제안한 행동 인식 시스템의 효율성을 범용 데이터 셋을 이용한 실험을 통해 증명하였다.

Medicine-Bottle Classification Algorithm Based on SIFT (SIFT 기반의 약통 분류 시스템)

  • Park, Kil Houm;Cho, Woong Ho
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.19 no.1
    • /
    • pp.77-85
    • /
    • 2014
  • Medicine-bottle classification algorithm to avoid medicine accidents must be robust to a geometric change such as rotation, size variation, location movement of the medicine bottles. In this paper, we propose an algorithm to classify the medicine bottles exactly in real-time by using SIFT(Scale Invariant Feature Transform) which is robust to the geometric change. In first, we classify medicine bottles by size using minimum boundary rectangle(MBR) of medicine bottles as a striking feature in order to classify the medicine bottles. We extract label region in the MBR and the region of interest(ROI) considering rotation. Then, we classify medicine bottles using SIFT for the extracted ROI. We also simplify the number of octave of SIFT in order to improve a process speed of SIFT. We confirm to classify all the medicine bottles exactly as a result of performance evaluation of the proposed algorithm about images of 250 medicine bottles. We also confirm to improve the process time more than twice the processing time by simplifying the number of octave of SIFT.

Facial Expression Recognition Using SIFT Descriptor (SIFT 기술자를 이용한 얼굴 표정인식)

  • Kim, Dong-Ju;Lee, Sang-Heon;Sohn, Myoung-Kyu
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.5 no.2
    • /
    • pp.89-94
    • /
    • 2016
  • This paper proposed a facial expression recognition approach using SIFT feature and SVM classifier. The SIFT was generally employed as feature descriptor at key-points in object recognition fields. However, this paper applied the SIFT descriptor as feature vector for facial expression recognition. In this paper, the facial feature was extracted by applying SIFT descriptor at each sub-block image without key-point detection procedure, and the facial expression recognition was performed using SVM classifier. The performance evaluation was carried out through comparison with binary pattern feature-based approaches such as LBP and LDP, and the CK facial expression database and the JAFFE facial expression database were used in the experiments. From the experimental results, the proposed method using SIFT descriptor showed performance improvements of 6.06% and 3.87% compared to previous approaches for CK database and JAFFE database, respectively.

Image-based Image Retrieval System Using Duplicated Point of PCA-SIFT (PCA-SIFT의 차원 중복점을 이용한 이미지 기반 이미지 검색 시스템)

  • Choi, GiRyong;Jung, Hye-Wuk;Lee, Jee-Hyoung
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.23 no.3
    • /
    • pp.275-279
    • /
    • 2013
  • Recently, as multimedia information becomes popular, there are many studies to retrieve images based on images in the web. However, it is hard to find the matching images which users want to find because of various patterns in images. In this paper, we suggest an efficient images retrieval system based on images for finding products in internet shopping malls. We extract features for image retrieval by using SIFT (Scale Invariant Feature Transform) algorithm, repeat keypoint matching in various dimension by using PCA-SIFT, and find the image which users search for by combining them. To verify efficiency of the proposed method, we compare the performance of our approach with that of SIFT and PCA-SIFT by using images with various patterns. We verify that the proposed method shows the best distinction in the case that product labels are not included in images.

Implementation of sin/cos Processor for Descriptor on SIFT (SIFT의 descriptor를 위한 sin/cos 프로세서의 구현)

  • Kim, Young-Jin;Lee, Hyon Soo
    • The Journal of the Korea Contents Association
    • /
    • v.13 no.4
    • /
    • pp.44-52
    • /
    • 2013
  • The SIFT algorithm is being actively researched for various image processing applications including video surveillance and autonomous vehicle navigation. The computation of sin/cos function is the most cost part needed in whole computational complexity and time for SIFT descriptor. In this paper, we implement a hardware to sin/cos function of descriptor on sift feature detection algorithm. The proposed Sin/Cosine processor is coded in Verilog and synthesized and simulated using Xilinx ISE 9.2i. The processor is mapped onto the device Spartan 2E (XC2S200E-PQ208-6). It consumes 149 slices, 233 LUTs and attains a maximum operation frequency of 60.01 MHz. As compared with the software realization, our FPGA circuit can achieve the speed improvement by 40 times in average.

SIFT based Image Similarity Search using an Edge Image Pyramid and an Interesting Region Detection (윤곽선 이미지 피라미드와 관심영역 검출을 이용한 SIFT 기반 이미지 유사성 검색)

  • Yu, Seung-Hoon;Kim, Deok-Hwan;Lee, Seok-Lyong;Chung, Chin-Wan;Kim, Sang-Hee
    • Journal of KIISE:Databases
    • /
    • v.35 no.4
    • /
    • pp.345-355
    • /
    • 2008
  • SIFT is popularly used in computer vision application such as object recognition, motion tracking, and 3D reconstruction among various shape descriptors. However, it is not easy to apply SIFT into the image similarity search as it is since it uses many high dimensional keypoint vectors. In this paper, we present a SIFT based image similarity search method using an edge image pyramid and an interesting region detection. The proposed method extracts keypoints, which is invariant to contrast, scale, and rotation of image, by using the edge image pyramid and removes many unnecessary keypoints from the image by using the hough transform. The proposed hough transform can detect objects of ellipse type so that it can be used to find interesting regions. Experimental results demonstrate that the retrieval performance of the proposed method is about 20% better than that of traditional SIFT in average recall.

SIFT Image Feature Extraction based on Deep Learning (딥 러닝 기반의 SIFT 이미지 특징 추출)

  • Lee, Jae-Eun;Moon, Won-Jun;Seo, Young-Ho;Kim, Dong-Wook
    • Journal of Broadcast Engineering
    • /
    • v.24 no.2
    • /
    • pp.234-242
    • /
    • 2019
  • In this paper, we propose a deep neural network which extracts SIFT feature points by determining whether the center pixel of a cropped image is a SIFT feature point. The data set of this network consists of a DIV2K dataset cut into $33{\times}33$ size and uses RGB image unlike SIFT which uses black and white image. The ground truth consists of the RobHess SIFT features extracted by setting the octave (scale) to 0, the sigma to 1.6, and the intervals to 3. Based on the VGG-16, we construct an increasingly deep network of 13 to 23 and 33 convolution layers, and experiment with changing the method of increasing the image scale. The result of using the sigmoid function as the activation function of the output layer is compared with the result using the softmax function. Experimental results show that the proposed network not only has more than 99% extraction accuracy but also has high extraction repeatability for distorted images.

F-Hessian SIFT-Based Railroad Level-Crossing Vision System (F-Hessian SIFT기반의 철도건널목 영상 감시 시스템)

  • Lim, Hyung-Sup;Yoon, Hak-Sun;Kim, Chel-Huan;Ryu, Deung-Ryeol;Cho, Hwang;Lee, Key-Seo
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.5 no.2
    • /
    • pp.138-144
    • /
    • 2010
  • This paper presents the experimental analysis of a F-Hessian SIFT-Based Railroad Level-Crossing Safety Vision System. Region of surveillance, region of interests, data matching based on extracting feature points has been examined under the laboratory condition by the model rig on a small scale. Real-time system were observed by using SIFT based on F-Hessian feature tracking method and other common algorithm.

Affine Local Descriptors for Viewpoint Invariant Face Recognition

  • Gao, Yongbin;Lee, Hyo Jong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2014.04a
    • /
    • pp.781-784
    • /
    • 2014
  • Face recognition under controlled settings, such as limited viewpoint and illumination change, can achieve good performance nowadays. However, real world application for face recognition is still challenging. In this paper, we use Affine SIFT to detect affine invariant local descriptors for face recognition under large viewpoint change. Affine SIFT is an extension of SIFT algorithm. SIFT algorithm is scale and rotation invariant, which is powerful for small viewpoint changes in face recognition, but it fails when large viewpoint change exists. In our scheme, Affine SIFT is used for both gallery face and probe face, which generates a series of different viewpoints using affine transformation. Therefore, Affine SIFT allows viewpoint difference between gallery face and probe face. Experiment results show our framework achieves better recognition accuracy than SIFT algorithm on FERET database.

Face Recognition using SIFT and Subspace Analysis (SIFT와 부분공간분석법을 활용한 얼굴인식)

  • Kim, Dong-Hyun;Park, Hye-Young
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2010.06c
    • /
    • pp.390-394
    • /
    • 2010
  • 본 논문에서는 영상인식에서 널리 사용되는 지역적 특징인 SIFT와 부분공간분석에 의한 차원축소방법의 결합을 통하여 얼굴을 인식하는 방법을 제안한다. 기존의 SIFT기반 영상인식 방법에서는 추출된 키 포인트 각각에 대하여 계산된 특징기술자들을 개별적으로 비교하여 얻어지는 유사도를 바탕으로 인식을 수행하는데 반해, 본 논문에서 제안하는 접근법은 SIFT의 특징기술자를 명도 값으로 표현된 얼굴 영상을 여려 변형에 강건한 형태로 표현되도록 변환하는 표현방식으로 본다. SIFT기반의 특징기술자에 의해 표현된 얼굴 영상을 부분공간분석법에 의해 저차원의 특징벡터로 다시 표현되고, 이 특징벡터를 이용하여 얼굴인식을 수행한다. 잘 알려진 벤치마크 데이터인 AR 데이터베이스에 대한 실험을 통해 제안한 방법이 조명 변화와 가려짐에 강인한 인식 결과를 보여줄 뿐 아니라, 기존의 SIFT 기반의 얼굴 인식 방법에 비하여 우수한 처리 속도를 보임을 확인하였다.

  • PDF