• Title/Summary/Keyword: feature target

Search Result 629, Processing Time 0.028 seconds

Underwater Target Analysis Using Canonical Correlation Analysis (정준상관분석을 이용한 수중표적 분석)

  • Seok, Jong-Won;Kim, Tae-Hwan;Bae, Keun-Sung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.9
    • /
    • pp.1878-1883
    • /
    • 2012
  • Generally, in the underwater target recognition, feature vectors are extracted from the target signal utilizing spatial information according to target shape/material characteristics. And, various signal processing techniques have been studied to extract feature vectors which is less sensitive to the location of the receiver. In this paper, we analyzed the characteristics of synthesized underwater objects using canonical correlation analysis method which is relatively less sensitive to the location of receiver. Canonical correlation analysis is applied to two consecutive backscattered sonar returns at different aspect angles to analyze the correlation characteristics in multi-aspect environment.

Design of a SIFT based Target Classification Algorithm robust to Geometric Transformation of Target (표적의 기하학적 변환에 강인한 SIFT 기반의 표적 분류 알고리즘 설계)

  • Lee, Hee-Yul;Kim, Jong-Hwan;Kim, Se-Yun;Choi, Byung-Jae;Moon, Sang-Ho;Park, Kil-Houm
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.20 no.1
    • /
    • pp.116-122
    • /
    • 2010
  • This paper proposes a method for classifying targets robust to geometric transformations of targets such as rotation, scale change, translation, and pose change. Targets which have rotation, scale change, and shift is firstly classified based on CM(Confidence Map) which is generated by similarity, scale ratio, and range of orientation for SIFT(Scale-Invariant Feature Transform) feature vectors. On the other hand, DB(DataBase) which is acquired in various angles is used to deal with pose variation of targets. Range of the angle is determined by comparing and analyzing the execution time and performance for sampling intervals. We experiment on various images which is geometrically changed to evaluate performance of proposed target classification method. Experimental results show that the proposed algorithm has a good classification performance.

Comparative Study on Feature Extraction Schemes for Feature-based Structural Displacement Measurement (특징점 추출 기법에 따른 구조물 동적 변위 측정 성능에 관한 연구)

  • Junho Gong
    • Journal of the Korea institute for structural maintenance and inspection
    • /
    • v.28 no.3
    • /
    • pp.74-82
    • /
    • 2024
  • In this study, feature point detection and displacement measurement performance depending on feature extraction algorithms were compared and analyzed according to environmental changes and target types in the feature point-based displacement measurement algorithm. A three-story frame structure was designed for performance evaluation, and the displacement response of the structure was digitized into FHD (1920×1080) resolution. For performance analysis, the initial measurement distance was set to 10m, and increased up to 40m with an increment of 10m. During the experiments, illuminance was fixed to 450lux or 120lux. The artificial and natural targets mounted on the structure were set as regions of interest and used for feature point detection. Various feature detection algorithms were implemented for performance comparisons. As a result of the feature point detection performance analysis, the Shi-Tomasi corner and KAZE algorithm were found that they were robust to the target type, illuminance change, and increase in measurement distance. The displacement measurement accuracy using those two algorithms was also the highest. However, when using natural targets, the displacement measurement accuracy is lower than that of artificial targets. This indicated the limitation in extracting feature points as the resolution of the natural target decreased as the measurement distance increased.

Cluster-based Linear Projection and %ixture of Experts Model for ATR System (자동 목표물 인식 시스템을 위한 클러스터 기반 투영기법과 혼합 전문가 구조)

  • 신호철;최재철;이진성;조주현;김성대
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.40 no.3
    • /
    • pp.203-216
    • /
    • 2003
  • In this paper a new feature extraction and target classification method is proposed for the recognition part of FLIR(Forwar Looking Infrared)-image-based ATR system. Proposed feature extraction method is "cluster(=set of classes)-based"version of previous fisherfaces method that is known by its robustness to illumination changes in face recognition. Expecially introduced class clustering and cluster-based projection method maximizes the performance of fisherfaces method. Proposed target image classification method is based on the mixture of experts model which consists of RBF-type experts and MLP-type gating networks. Mixture of experts model is well-suited with ATR system because it should recognizee various targets in complexed feature space by variously mixed conditions. In proposed classification method, one expert takes charge of one cluster and the separated structure with experts reduces the complexity of feature space and achieves more accurate local discrimination between classes. Proposed feature extraction and classification method showed distinguished performances in recognition test with customized. FLIR-vehicle-image database. Expecially robustness to pixelwise sensor noise and un-wanted intensity variations was verified by simulation.

Motion Derivatives based Entropy Feature Extraction Using High-Range Resolution Profiles for Estimating the Number of Targets and Seduction Chaff Detection (표적 개수 추정 및 근접 채프 탐지를 위한 고해상도 거리 프로파일을 이용한 움직임 미분 기반 엔트로피 특징 추출 기법)

  • Lee, Jung-Won;Choi, Gak-Gyu;Na, Kyoungil
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.22 no.2
    • /
    • pp.207-214
    • /
    • 2019
  • This paper proposes a new feature extraction method for automatically estimating the number of target and detecting the chaff using high range resolution profile(HRRP). Feature of one-dimensional range profile is expected to be limited or missing due to lack of information according to the time. The proposed method considers the dynamic movements of targets depending on the radial velocity. The observed HRRP sequence is used to construct a time-range distribution matrix, then assuming diverse radial velocities reflect the number of target and seduction chaff launch, the proposed method utilizes the characteristic of the gradient distribution on the time-range distribution matrix image, which is validated by electromagnetic computation data and dynamic simulation.

Dual Detection-Guided Newborn Target Intensity Based on Probability Hypothesis Density for Multiple Target Tracking

  • Gao, Li;Ma, Yongjie
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.10
    • /
    • pp.5095-5111
    • /
    • 2016
  • The Probability Hypothesis Density (PHD) filter is a suboptimal approximation and tractable alternative to the multi-target Bayesian filter based on random finite sets. However, the PHD filter fails to track newborn targets when the target birth intensity is unknown prior to tracking. In this paper, a dual detection-guided newborn target intensity PHD algorithm is developed to solve the problem, where two schemes, namely, a newborn target intensity estimation scheme and improved measurement-driven scheme, are proposed. First, the newborn target intensity estimation scheme, consisting of the Dirichlet distribution with the negative exponent parameter and target velocity feature, is used to recursively estimate the target birth intensity. Then, an improved measurement-driven scheme is introduced to reduce the errors of the estimated number of targets and computational load. Simulation results demonstrate that the proposed algorithm can achieve good performance in terms of target states, target number and computational load when the newborn target intensity is not predefined in multi-target tracking systems.

Study on the Performance Enhancement of Radar Target Recognition Using Combining of Feature Vectors (특성 벡터 융합을 이용한 레이더 표적 인식 성능 향상에 관한 연구)

  • Lee, Seung-Jae;Choi, In-Sik;Chae, Dae-Young
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.24 no.9
    • /
    • pp.928-935
    • /
    • 2013
  • This paper proposed a combining technique of feature vectors which improves the performance of radar target recognition. The proposed method obtains more information than monostatic or bistatic case by combining extracted feature vectors from two receivers. For verifying the performance of the proposed method, we calculated monostatic and bistatic RCS(BRCS) of three full-scale fighters by changing the receiver position. Then, the scattering centers are extracted using 1-D FFT-based CLEAN from the calculated RCS data. Scattering centers are used as feature vectors for neural network classifier. The results show that our method has the better performance than the monostatic or bistatic case.

A Sparse Target Matrix Generation Based Unsupervised Feature Learning Algorithm for Image Classification

  • Zhao, Dan;Guo, Baolong;Yan, Yunyi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.6
    • /
    • pp.2806-2825
    • /
    • 2018
  • Unsupervised learning has shown good performance on image, video and audio classification tasks, and much progress has been made so far. It studies how systems can learn to represent particular input patterns in a way that reflects the statistical structure of the overall collection of input patterns. Many promising deep learning systems are commonly trained by the greedy layerwise unsupervised learning manner. The performance of these deep learning architectures benefits from the unsupervised learning ability to disentangling the abstractions and picking out the useful features. However, the existing unsupervised learning algorithms are often difficult to train partly because of the requirement of extensive hyperparameters. The tuning of these hyperparameters is a laborious task that requires expert knowledge, rules of thumb or extensive search. In this paper, we propose a simple and effective unsupervised feature learning algorithm for image classification, which exploits an explicit optimizing way for population and lifetime sparsity. Firstly, a sparse target matrix is built by the competitive rules. Then, the sparse features are optimized by means of minimizing the Euclidean norm ($L_2$) error between the sparse target and the competitive layer outputs. Finally, a classifier is trained using the obtained sparse features. Experimental results show that the proposed method achieves good performance for image classification, and provides discriminative features that generalize well.

Anomaly Intrusion Detection Based on Hyper-ellipsoid in the Kernel Feature Space

  • Lee, Hansung;Moon, Daesung;Kim, Ikkyun;Jung, Hoseok;Park, Daihee
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.3
    • /
    • pp.1173-1192
    • /
    • 2015
  • The Support Vector Data Description (SVDD) has achieved great success in anomaly detection, directly finding the optimal ball with a minimal radius and center, which contains most of the target data. The SVDD has some limited classification capability, because the hyper-sphere, even in feature space, can express only a limited region of the target class. This paper presents an anomaly detection algorithm for mitigating the limitations of the conventional SVDD by finding the minimum volume enclosing ellipsoid in the feature space. To evaluate the performance of the proposed approach, we tested it with intrusion detection applications. Experimental results show the prominence of the proposed approach for anomaly detection compared with the standard SVDD.

Optimization of 3D target feature-map using modular mART neural network (모듈구조 mART 신경망을 이용한 3차원 표적 피쳐맵의 최적화)

  • 차진우;류충상;서춘원;김은수
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.35C no.2
    • /
    • pp.71-79
    • /
    • 1998
  • In this paper, we propose a new mART(modified ART) neural network by combining the winner neuron definition method of SOM(self-organizing map) and the real-time adaptive clustering function of ART(adaptive resonance theory) and construct it in a modular structure, for the purpose of organizing the feature maps of three dimensional targets. Being constructed in a modular structure, the proposed modular mART can effectively prevent the clusters from representing multiple classes and can be trained to organze two dimensional distortion invariant feature maps so as to recognize targets with three dimensional distortion. We also present the recognition result and self-organization perfdormance of the proposed modular mART neural network after carried out some experiments with 14 tank and fighter target models.

  • PDF