• Title/Summary/Keyword: local feature

Search Result 939, Processing Time 0.031 seconds

Bottleneck-based Siam-CNN Algorithm for Object Tracking (객체 추적을 위한 보틀넥 기반 Siam-CNN 알고리즘)

  • Lim, Su-Chang;Kim, Jong-Chan
    • Journal of Korea Multimedia Society
    • /
    • v.25 no.1
    • /
    • pp.72-81
    • /
    • 2022
  • Visual Object Tracking is known as the most fundamental problem in the field of computer vision. Object tracking localize the region of target object with bounding box in the video. In this paper, a custom CNN is created to extract object feature that has strong and various information. This network was constructed as a Siamese network for use as a feature extractor. The input images are passed convolution block composed of a bottleneck layers, and features are emphasized. The feature map of the target object and the search area, extracted from the Siamese network, was input as a local proposal network. Estimate the object area using the feature map. The performance of the tracking algorithm was evaluated using the OTB2013 dataset. Success Plot and Precision Plot were used as evaluation matrix. As a result of the experiment, 0.611 in Success Plot and 0.831 in Precision Plot were achieved.

A Robust Algorithm for Tracking Feature Points with Incomplete Trajectories (불완전한 궤적을 고려한 강건한 특징점 추적 알고리즘)

  • Jeong, Jong-Myeon;Moon, Young-Shik
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.37 no.6
    • /
    • pp.25-37
    • /
    • 2000
  • The trajectories of feature points can be defined by the correspondences between points in consecutive frames. The correspondence problem is known to be difficult to solve because false positives and false negatives almost always exist in real image sequences. In this paper, we propose a robust feature tracking algorithm considering incomplete trajectories such as entering and/or vanishing trajectories. The trajectories of feature points are determined by calculating the matching measure, which is defined as the minimum weighted Euclidean distance between two feature points. The weights are automatically updated in order to properly reflect the motion characteristics. We solve the correspondence problem as an optimal graph search problem, considering that the existence of false feature points may have serious effect on the correspondence search. The proposed algorithm finds a local optimal correspondence so that the effect of false feature point can be minimized in the decision process. The time complexity of the proposed graph search algorithm is given by O(mn) in the best case and O($m^2n$) in the worst case, where m and n arc the number of feature points in two consecutive frames. By considering false feature points and by properly reflecting motion characteristics, the proposed algorithm can find trajectories correctly and robustly, which has been shown by experimental results.

  • PDF

MONITORING OF MOUNTAINOUS AREAS USING SIMULATED IMAGES TO KOMPSAT-II

  • Chang Eun-Mi;Shin Soo-Hyun
    • Proceedings of the KSRS Conference
    • /
    • 2005.10a
    • /
    • pp.653-655
    • /
    • 2005
  • More than 70 percent of terrestrial territory of Korea is mountainous areas where degradation becomes serious year by year due to illegal tombs, expanding golf courses and stone mine development. We elaborate the potential usage of high resolution image for the monitoring of the phenomena. We made the classification of tombs and the statistical radiometric characteristics of graves were identified from this project. The graves could be classified to 4 groups from the field survey. As compared with grouping data after clustering and discriminant analysis, the two results coincided with each other. Object-oriented classification algorithm for feature extraction was theoretically researched in this project. And we did a pilot project, which was performed with mixed methods. That is, the conventional methods such as unsupervised and supervised classification were mixed up with the new method for feature extraction, object-oriented classification method. This methodology showed about $60\%$ classification accuracy for extracting tombs from satellite imagery. The extraction of tombs' geographical coordinates and graves themselves from satellite image was performed in this project. The stone mines and golf courses are extracted by NDVI and GVI. The accuracy of classification was around 89 percent. The location accuracy showed extraction of tombs from one-meter resolution image is cheaper and quicker way than GPS method. Finally we interviewed local government officers and made analyses on the current situation of mountainous area management and potential usage of KOMPSAT-II images. Based on the requirement analysis, we developed software, which is to management and monitoring system for mountainous area for local government.

  • PDF

Multi-Radial Basis Function SVM Classifier: Design and Analysis

  • Wang, Zheng;Yang, Cheng;Oh, Sung-Kwun;Fu, Zunwei
    • Journal of Electrical Engineering and Technology
    • /
    • v.13 no.6
    • /
    • pp.2511-2520
    • /
    • 2018
  • In this study, Multi-Radial Basis Function Support Vector Machine (Multi-RBF SVM) classifier is introduced based on a composite kernel function. In the proposed multi-RBF support vector machine classifier, the input space is divided into several local subsets considered for extremely nonlinear classification tasks. Each local subset is expressed as nonlinear classification subspace and mapped into feature space by using kernel function. The composite kernel function employs the dual RBF structure. By capturing the nonlinear distribution knowledge of local subsets, the training data is mapped into higher feature space, then Multi-SVM classifier is realized by using the composite kernel function through optimization procedure similar to conventional SVM classifier. The original training data set is partitioned by using some unsupervised learning methods such as clustering methods. In this study, three types of clustering method are considered such as Affinity propagation (AP), Hard C-Mean (HCM) and Iterative Self-Organizing Data Analysis Technique Algorithm (ISODATA). Experimental results on benchmark machine learning datasets show that the proposed method improves the classification performance efficiently.

TELE-OPERATIVE SYSTEM FOR BIOPRODUCTION - REMOTE LOCAL IMAGE PROCESSING FOR OBJECT IDENTIFICATION -

  • Kim, S. C.;H. Hwang;J. E. Son;Park, D. Y.
    • Proceedings of the Korean Society for Agricultural Machinery Conference
    • /
    • 2000.11b
    • /
    • pp.300-306
    • /
    • 2000
  • This paper introduces a new concept of automation for bio-production with tele-operative system. The proposed system showed practical and feasible way of automation for the volatile bio-production process. Based on the proposition, recognition of the job environment with object identification was performed using computer vision system. A man-machine interactive hybrid decision-making, which utilized a concept of tele-operation was proposed to overcome limitations of the capability of computer in image processing and feature extraction from the complex environment image. Identifying watermelons from the outdoor scene of the cultivation field was selected to realize the proposed concept. Identifying watermelon from the camera image of the outdoor cultivation field is very difficult because of the ambiguity among stems, leaves, shades, and especially fruits covered partly by leaves or stems. The analog signal of the outdoor image was captured and transmitted wireless to the host computer by R.F module. The localized window was formed from the outdoor image by pointing to the touch screen. And then a sequence of algorithms to identify the location and size of the watermelon was performed with the local window image. The effect of the light reflectance of fruits, stems, ground, and leaves were also investigated.

  • PDF

Evaluation of Histograms Local Features and Dimensionality Reduction for 3D Face Verification

  • Ammar, Chouchane;Mebarka, Belahcene;Abdelmalik, Ouamane;Salah, Bourennane
    • Journal of Information Processing Systems
    • /
    • v.12 no.3
    • /
    • pp.468-488
    • /
    • 2016
  • The paper proposes a novel framework for 3D face verification using dimensionality reduction based on highly distinctive local features in the presence of illumination and expression variations. The histograms of efficient local descriptors are used to represent distinctively the facial images. For this purpose, different local descriptors are evaluated, Local Binary Patterns (LBP), Three-Patch Local Binary Patterns (TPLBP), Four-Patch Local Binary Patterns (FPLBP), Binarized Statistical Image Features (BSIF) and Local Phase Quantization (LPQ). Furthermore, experiments on the combinations of the four local descriptors at feature level using simply histograms concatenation are provided. The performance of the proposed approach is evaluated with different dimensionality reduction algorithms: Principal Component Analysis (PCA), Orthogonal Locality Preserving Projection (OLPP) and the combined PCA+EFM (Enhanced Fisher linear discriminate Model). Finally, multi-class Support Vector Machine (SVM) is used as a classifier to carry out the verification between imposters and customers. The proposed method has been tested on CASIA-3D face database and the experimental results show that our method achieves a high verification performance.

A Comparative Study on Object Recognition about Performance and Speed (물체 인식의 성능 및 속도 개선 방향에 대한 비교 연구)

  • Kim, Jun-Chul;Kim, Hak-Il
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.1055-1056
    • /
    • 2008
  • In this paper, we survey various Robust Object Recognition Algorithms. One of the core technologies for local feature detector is Scale Invariant Feature Transform. And we compared several algorithms with SIFT based on IPP technology. As a result, the conversion of source codes using IPP is sped up. And this will be more improved recognition speed using SIMD Instructions.

  • PDF

An Effective Intention Reading from User Face for Human-Friendly Interface (인간친화형 인터페이스를 위한 사용자 얼굴에서의 효과적인 의도 파악)

  • 김대진;송원경;김종성;변증남
    • Proceedings of the IEEK Conference
    • /
    • 2000.11c
    • /
    • pp.25-28
    • /
    • 2000
  • In this paper, an effective intention reading scheme is proposed for human-friendly interface. Soft computing techniques such as fuzzy logic and artificial neural networks are used for this. And Gabor filter based feature(GG feature) is also proposed to deal with local activity in the human face. It is based on human visual system and Gabor filter based approach is very popular in these days. The proposed scheme is adopted for human-friendly interface for rehabilitation service robotic system KARES II.

  • PDF

Recognition of Profile Contours of Human Face by Approximation - Recognition

  • Yang, Yun-Mo
    • Proceedings of the KIEE Conference
    • /
    • 1988.07a
    • /
    • pp.683-686
    • /
    • 1988
  • In the recognition of similar patterns like profile contours of human faces, feature measure plays important role. We extracted effective and general feature by B-spline approximation. The nodes and vertices of the approximated curve are normalized and used as features. Since the features have both local property of curvature extrema and global property by B-spline approximation, they are superior to those of curvature extrema of the profile contour. For the image data of six sets of 56 persons, some of which are ill-made, averaged accuracy rate of 97.6 % is obtained in recognizing combinational 333 test samples.

  • PDF