• Title/Summary/Keyword: feature points

Search Result 1,119, Processing Time 0.029 seconds

Feature information fusion using multiple neural networks and target identification application of FLIR image (다중 신경회로망을 이용한 특징정보 융합과 적외선영상에서의 표적식별에의 응용)

  • 선선구;박현욱
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.40 no.4
    • /
    • pp.266-274
    • /
    • 2003
  • Distance Fourier descriptors of local target boundary and feature information fusion using multiple MLPs (Multilayer perceptrons) are proposed. They are used to identify nonoccluded and partially occluded targets in natural FLIR (forward-looking infrared) images. After segmenting a target, radial Fourier descriptors as global shape features are defined from the target boundary. A target boundary is partitioned into four local boundaries to extract local shape features. In a local boundary, a distance function is defined from boundary points and a line between two extreme points. Distance Fourier descriptors as local shape features are defined by using distance function. One global feature vector and four local feature vectors are used as input data for multiple MLPs to determine final identification result of the target. In the experiments, we show that the proposed method is superior to the traditional feature sets with respect to the identification performance.

Parallelizing Feature Point Extraction in the Multi-Core Environment for Reducing Panorama Image Generation Time (파노라마 이미지 생성시간을 단축하기 위한 멀티코어 환경에서 특징점 추출 병렬화)

  • Kim, Geon-Ho;Choi, Tai-Ho;Chung, Hee-Jin;Kwon, Bom-Jun
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.3
    • /
    • pp.331-335
    • /
    • 2008
  • In this paper, we parallelized a feature point extraction algorithm to reduce panorama image generation time in multi-core environment. While we compose a panorama image with several images, the step to extract feature points of each picture is needed to find overlapped region of pictures. To perform rapidly feature extraction stage which requires much calculation, we developed a parallel algorithm to extract feature points and examined the performance using CBE(Cell Broadband Engine) which is asymmetric multi-core architecture. As a result of the exam, the algorithm we proposed has a property of linear scalability-the performance is increased in proportion the number of processors utilized. In this paper, we will suggest how Image processing operation can make high performance result in multi-core environment.

Extended SURF Algorithm with Color Invariant Feature and Global Feature (컬러 불변 특징과 광역 특징을 갖는 확장 SURF(Speeded Up Robust Features) 알고리즘)

  • Yoon, Hyun-Sup;Han, Young-Joon;Hahn, Hern-Soo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.6
    • /
    • pp.58-67
    • /
    • 2009
  • A correspondence matching is one of the important tasks in computer vision, and it is not easy to find corresponding points in variable environment where a scale, rotation, view point and illumination are changed. A SURF(Speeded Up Robust Features) algorithm have been widely used to solve the problem of the correspondence matching because it is faster than SIFT(Scale Invariant Feature Transform) with closely maintaining the matching performance. However, because SURF considers only gray image and local geometric information, it is difficult to match corresponding points on the image where similar local patterns are scattered. In order to solve this problem, this paper proposes an extended SURF algorithm that uses the invariant color and global geometric information. The proposed algorithm can improves the matching performance since the color information and global geometric information is used to discriminate similar patterns. In this paper, the superiority of the proposed algorithm is proved by experiments that it is compared with conventional methods on the image where an illumination and a view point are changed and similar patterns exist.

Comparative Performance Analysis of Feature Detection and Matching Methods for Lunar Terrain Images (달 지형 영상에서 특징점 검출 및 정합 기법의 성능 비교 분석)

  • Hong, Sungchul;Shin, Hyu-Soung
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.40 no.4
    • /
    • pp.437-444
    • /
    • 2020
  • A lunar rover's optical camera is used to provide navigation and terrain information in an exploration zone. However, due to the scant presence of atmosphere, the Moon has homogeneous terrain with dark soil. Also, in extreme environments, the rover has limited data storage with low computation capability. Thus, for successful exploration, it is required to examine feature detection and matching methods which are robust to lunar terrain and environmental characteristics. In this research, SIFT, SURF, BRISK, ORB, and AKAZE are comparatively analyzed with lunar terrain images from a lunar rover. Experimental results show that SIFT and AKAZE are most robust for lunar terrain characteristics. AKAZE detects less quantity of feature points than SIFT, but feature points are detected and matched with high precision and the least computational cost. AKAZE is adequate for fast and accurate navigation information. Although SIFT has the highest computational cost, the largest quantity of feature points are stably detected and matched. The rover periodically sends terrain images to Earth. Thus, SIFT is suitable for global 3D terrain map construction in that a large amount of terrain images can be processed on Earth. Study results are expected to provide a guideline to utilize feature detection and matching methods for future lunar exploration rovers.

Feature Voting for Object Localization via Density Ratio Estimation

  • Wang, Liantao;Deng, Dong;Chen, Chunlei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.12
    • /
    • pp.6009-6027
    • /
    • 2019
  • Support vector machine (SVM) classifiers have been widely used for object detection. These methods usually locate the object by finding the region with maximal score in an image. With bag-of-features representation, the SVM score of an image region can be written as the sum of its inside feature-weights. As a result, the searching process can be executed efficiently by using strategies such as branch-and-bound. However, the feature-weight derived by optimizing region classification cannot really reveal the category knowledge of a feature-point, which could cause bad localization. In this paper, we represent a region in an image by a collection of local feature-points and determine the object by the region with the maximum posterior probability of belonging to the object class. Based on the Bayes' theorem and Naive-Bayes assumptions, the posterior probability is reformulated as the sum of feature-scores. The feature-score is manifested in the form of the logarithm of a probability ratio. Instead of estimating the numerator and denominator probabilities separately, we readily employ the density ratio estimation techniques directly, and overcome the above limitation. Experiments on a car dataset and PASCAL VOC 2007 dataset validated the effectiveness of our method compared to the baselines. In addition, the performance can be further improved by taking advantage of the recently developed deep convolutional neural network features.

A feature based Computer Aided Inspection Planning system (형상기반의 CAIP 시스템 개발)

  • 윤길상;조명우;이홍희
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 2002.10a
    • /
    • pp.353-358
    • /
    • 2002
  • A feature-based inspection planning system is proposed in this research to develop more efficient measuring methodology for the OMM (On-machine measurement) for complicated workpiece having many primitive form features. This paper focuses on the development of the CAIP (computer-aided inspection system) methodologies. The optimum inspection sequences for the features are determined by analyzing the feature information such as the nested relations and the possible probe approaching directions of the features, and forming feature groups. A series of heuristic rules are developed to accomplish it. Also, each feature is decomposed into its constituent geometric elements, and then the number of sampling points, the locations of the measuring point, the optimum probing path are determined by applying the fuzzy logic, Hammersley's method, and the TSP algorithm. To verify the proposed methodologies, simulations are carried out and the results are analyzed.

  • PDF

A Study on Enhancing the Performance of Detecting Lip Feature Points for Facial Expression Recognition Based on AAM (AAM 기반 얼굴 표정 인식을 위한 입술 특징점 검출 성능 향상 연구)

  • Han, Eun-Jung;Kang, Byung-Jun;Park, Kang-Ryoung
    • The KIPS Transactions:PartB
    • /
    • v.16B no.4
    • /
    • pp.299-308
    • /
    • 2009
  • AAM(Active Appearance Model) is an algorithm to extract face feature points with statistical models of shape and texture information based on PCA(Principal Component Analysis). This method is widely used for face recognition, face modeling and expression recognition. However, the detection performance of AAM algorithm is sensitive to initial value and the AAM method has the problem that detection error is increased when an input image is quite different from training data. Especially, the algorithm shows high accuracy in case of closed lips but the detection error is increased in case of opened lips and deformed lips according to the facial expression of user. To solve these problems, we propose the improved AAM algorithm using lip feature points which is extracted based on a new lip detection algorithm. In this paper, we select a searching region based on the face feature points which are detected by AAM algorithm. And lip corner points are extracted by using Canny edge detection and histogram projection method in the selected searching region. Then, lip region is accurately detected by combining color and edge information of lip in the searching region which is adjusted based on the position of the detected lip corners. Based on that, the accuracy and processing speed of lip detection are improved. Experimental results showed that the RMS(Root Mean Square) error of the proposed method was reduced as much as 4.21 pixels compared to that only using AAM algorithm.

Spherical Panorama Image Generation Method using Homography and Tracking Algorithm (호모그래피와 추적 알고리즘을 이용한 구면 파노라마 영상 생성 방법)

  • Munkhjargal, Anar;Choi, Hyung-Il
    • The Journal of the Korea Contents Association
    • /
    • v.17 no.3
    • /
    • pp.42-52
    • /
    • 2017
  • Panorama image is a single image obtained by combining images taken at several viewpoints through matching of corresponding points. Existing panoramic image generation methods that find the corresponding points are extracting local invariant feature points in each image to create descriptors and using descriptor matching algorithm. In the case of video sequence, frames may be a lot, so therefore it may costs significant amount of time to generate a panoramic image by the existing method and it may has done unnecessary calculations. In this paper, we propose a method to quickly create a single panoramic image from a video sequence. By assuming that there is no significant changes between frames of the video such as in locally, we use the FAST algorithm that has good repeatability and high-speed calculation to extract feature points and the Lucas-Kanade algorithm as each feature point to track for find the corresponding points in surrounding neighborhood instead of existing descriptor matching algorithms. When homographies are calculated for all images, homography is changed around the center image of video sequence to warp images and obtain a planar panoramic image. Finally, the spherical panoramic image is obtained by performing inverse transformation of the spherical coordinate system. The proposed method was confirmed through the experiments generating panorama image efficiently and more faster than the existing methods.

Lane Detection Algorithm for Night-time Digital Image Based on Distribution Feature of Boundary Pixels

  • You, Feng;Zhang, Ronghui;Zhong, Lingshu;Wang, Haiwei;Xu, Jianmin
    • Journal of the Optical Society of Korea
    • /
    • v.17 no.2
    • /
    • pp.188-199
    • /
    • 2013
  • This paper presents a novel algorithm for nighttime detection of the lane markers painted on a road at night. First of all, the proposed algorithm uses neighborhood average filtering, 8-directional Sobel operator and thresholding segmentation based on OTSU's to handle raw lane images taken from a digital CCD camera. Secondly, combining intensity map and gradient map, we analyze the distribution features of pixels on boundaries of lanes in the nighttime and construct 4 feature sets for these points, which are helpful to supply with sufficient data related to lane boundaries to detect lane markers much more robustly. Then, the searching method in multiple directions- horizontal, vertical and diagonal directions, is conducted to eliminate the noise points on lane boundaries. Adapted Hough transformation is utilized to obtain the feature parameters related to the lane edge. The proposed algorithm can not only significantly improve detection performance for the lane marker, but it requires less computational power. Finally, the algorithm is proved to be reliable and robust in lane detection in a nighttime scenario.

Emotion Recognition by CCD Color Image (CCD 컬러영상에 의한 감성인식)

  • Lee, Sang-Yoon;Joo, Young-Hoon;Sim, Kwee-Bo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.12 no.2
    • /
    • pp.97-102
    • /
    • 2002
  • In this paper, we propose the technique for recognizing the human s emotion by using the CCD color image. To do this, we first get the face image by using skin-color from the original color image acquired by the CCD camera. And we propose the method for finding man s feature points(eyebrows, eye, nose, mouse) from the face image and the geometrical method for recognizing human s emotion (surprise, anger, happiness, sadness) from the structural correlation of man s feature feints. The proposed method in this paper recognize the human s emotion by learning the neural network. Finally, we have proven the effectiveness of the Proposed method through the experimentation.