• Title/Summary/Keyword: Local feature

Search Result 932, Processing Time 0.026 seconds

Multi-feature local sparse representation for infrared pedestrian tracking

  • Wang, Xin;Xu, Lingling;Ning, Chen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.3
    • /
    • pp.1464-1480
    • /
    • 2019
  • Robust tracking of infrared (IR) pedestrian targets with various backgrounds, e.g. appearance changes, illumination variations, and background disturbances, is a great challenge in the infrared image processing field. In the paper, we address a new tracking method for IR pedestrian targets via multi-feature local sparse representation (SR), which consists of three important modules. In the first module, a multi-feature local SR model is constructed. Considering the characterization of infrared pedestrian targets, the gray and edge features are first extracted from all target templates, and then fused into the model learning process. In the second module, an effective tracker is proposed via the learned model. To improve the computational efficiency, a sliding window mechanism with multiple scales is first used to scan the current frame to sample the target candidates. Then, the candidates are recognized via sparse reconstruction residual analysis. In the third module, an adaptive dictionary update approach is designed to further improve the tracking performance. The results demonstrate that our method outperforms several classical methods for infrared pedestrian tracking.

Image Feature Extraction Using Energy field Analysis (에너지장 해석을 통한 영상 특징량 추출 방법 개발)

  • 김면희;이태영;이상룡
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2002.10a
    • /
    • pp.404-406
    • /
    • 2002
  • In this paper, the method of image feature extraction is proposed. This method employ the energy field analysis, outlier removal algorithm and ring projection. Using this algorithm, we achieve rotation-translation-scale invariant feature extraction. The force field are exploited to automatically locate the extrema of a small number of potential energy wells and associated potential channels. The image feature is acquired from relationship of local extrema using the ring projection method.

  • PDF

Feature Selection via Embedded Learning Based on Tangent Space Alignment for Microarray Data

  • Ye, Xiucai;Sakurai, Tetsuya
    • Journal of Computing Science and Engineering
    • /
    • v.11 no.4
    • /
    • pp.121-129
    • /
    • 2017
  • Feature selection has been widely established as an efficient technique for microarray data analysis. Feature selection aims to search for the most important feature/gene subset of a given dataset according to its relevance to the current target. Unsupervised feature selection is considered to be challenging due to the lack of label information. In this paper, we propose a novel method for unsupervised feature selection, which incorporates embedded learning and $l_{2,1}-norm$ sparse regression into a framework to select genes in microarray data analysis. Local tangent space alignment is applied during embedded learning to preserve the local data structure. The $l_{2,1}-norm$ sparse regression acts as a constraint to aid in learning the gene weights correlatively, by which the proposed method optimizes for selecting the informative genes which better capture the interesting natural classes of samples. We provide an effective algorithm to solve the optimization problem in our method. Finally, to validate the efficacy of the proposed method, we evaluate the proposed method on real microarray gene expression datasets. The experimental results demonstrate that the proposed method obtains quite promising performance.

A Fractional Integration Analysis on Daily FX Implied Volatility: Long Memory Feature and Structural Changes

  • Han, Young-Wook
    • Asia-Pacific Journal of Business
    • /
    • v.13 no.2
    • /
    • pp.23-37
    • /
    • 2022
  • Purpose - The purpose of this paper is to analyze the dynamic factors of the daily FX implied volatility based on the fractional integration methods focusing on long memory feature and structural changes. Design/methodology/approach - This paper uses the daily FX implied volatility data of the EUR-USD and the JPY-USD exchange rates. For the fractional integration analysis, this paper first applies the basic ARFIMA-FIGARCH model and the Local Whittle method to explore the long memory feature in the implied volatility series. Then, this paper employs the Adaptive-ARFIMA-Adaptive-FIGARCH model with a flexible Fourier form to allow for the structural changes with the long memory feature in the implied volatility series. Findings - This paper finds statistical evidence of the long memory feature in the first two moments of the implied volatility series. And, this paper shows that the structural changes appear to be an important factor and that neglecting the structural changes may lead to an upward bias in the long memory feature of the implied volatility series. Research implications or Originality - The implied volatility has widely been believed to be the market's best forecast regarding the future volatility in FX markets, and modeling the evolution of the implied volatility is quite important as it has clear implications for the behavior of the exchange rates in FX markets. The Adaptive-ARFIMA-Adaptive-FIGARCH model could be an excellent description for the FX implied volatility series

3D Face Recognition using Local Depth Information

  • 이영학;심재창;이태홍
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.11
    • /
    • pp.818-825
    • /
    • 2002
  • Depth information is one of the most important factor for the recognition of a digital face image. Range images are very useful, when comparing one face with other faces, because of implicating depth information. As the processing for the whole fare produces a lot of calculations and data, face images ran be represented in terms of a vector of feature descriptors for a local area. In this paper, depth areas of a 3 dimensional(3D) face image were extracted by the contour line from some depth value. These were resampled and stored in consecutive location in feature vector using multiple feature method. A comparison between two faces was made based on their distance in the feature space, using Euclidian distance. This paper reduced the number of index data in the database and used fewer feature vectors than other methods. Proposed algorithm can be highly recognized for using local depth information and less feature vectors or the face.

Face Representation and Face Recognition using Optimized Local Ternary Patterns (OLTP)

  • Raja, G. Madasamy;Sadasivam, V.
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.1
    • /
    • pp.402-410
    • /
    • 2017
  • For many years, researchers in face description area have been representing and recognizing faces based on different methods that include subspace discriminant analysis, statistical learning and non-statistics based approach etc. But still automatic face recognition remains an interesting but challenging problem. This paper presents a novel and efficient face image representation method based on Optimized Local Ternary Pattern (OLTP) texture features. The face image is divided into several regions from which the OLTP texture feature distributions are extracted and concatenated into a feature vector that can act as face descriptor. The recognition is performed using nearest neighbor classification method with Chi-square distance as a similarity measure. Extensive experimental results on Yale B, ORL and AR face databases show that OLTP consistently performs much better than other well recognized texture models for face recognition.

Classifier Selection using Feature Space Attributes in Local Region (국부적 영역에서의 특징 공간 속성을 이용한 다중 인식기 선택)

  • Shin Dong-Kuk;Song Hye-Jeong;Kim Baeksop
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.12
    • /
    • pp.1684-1690
    • /
    • 2004
  • This paper presents a method for classifier selection that uses distribution information of the training samples in a small region surrounding a sample. The conventional DCS-LA(Dynamic Classifier Selection - Local Accuracy) selects a classifier dynamically by comparing the local accuracy of each classifier at the test time, which inevitably requires long classification time. On the other hand, in the proposed approach, the best classifier in a local region is stored in the FSA(Feature Space Attribute) table during the training time, and the test is done by just referring to the table. Therefore, this approach enables fast classification because classification is not needed during test. Two feature space attributes are used entropy and density of k training samples around each sample. Each sample in the feature space is mapped into a point in the attribute space made by two attributes. The attribute space is divided into regular rectangular cells in which the local accuracy of each classifier is appended. The cells with associated local accuracy comprise the FSA table. During test, when a test sample is applied, the cell to which the test sample belongs is determined first by calculating the two attributes, and then, the most accurate classifier is chosen from the FSA table. To show the effectiveness of the proposed algorithm, it is compared with the conventional DCS -LA using the Elena database. The experiments show that the accuracy of the proposed algorithm is almost same as DCS-LA, but the classification time is about four times faster than that.

Robust Facial Expression Recognition Based on Local Directional Pattern

  • Jabid, Taskeed;Kabir, Md. Hasanul;Chae, Oksam
    • ETRI Journal
    • /
    • v.32 no.5
    • /
    • pp.784-794
    • /
    • 2010
  • Automatic facial expression recognition has many potential applications in different areas of human computer interaction. However, they are not yet fully realized due to the lack of an effective facial feature descriptor. In this paper, we present a new appearance-based feature descriptor, the local directional pattern (LDP), to represent facial geometry and analyze its performance in expression recognition. An LDP feature is obtained by computing the edge response values in 8 directions at each pixel and encoding them into an 8 bit binary number using the relative strength of these edge responses. The LDP descriptor, a distribution of LDP codes within an image or image patch, is used to describe each expression image. The effectiveness of dimensionality reduction techniques, such as principal component analysis and AdaBoost, is also analyzed in terms of computational cost saving and classification accuracy. Two well-known machine learning methods, template matching and support vector machine, are used for classification using the Cohn-Kanade and Japanese female facial expression databases. Better classification accuracy shows the superiority of LDP descriptor against other appearance-based feature descriptors.

Planning and Evaluating Public House with Symbolic Representation Of Regional Feature (지역고유의 상징성을 표현한 공동주택 계획 및 평가 - 경북 김천시를 중심으로 -)

  • Park, Young-Mi;Choi, Jung-Min
    • Proceeding of Spring/Autumn Annual Conference of KHA
    • /
    • 2008.11a
    • /
    • pp.385-390
    • /
    • 2008
  • The residence plan of Korea has been formed with bias for quantitative growth and uniformity failing at obtaining human value. Also, rapid growth brought about severe problems of deteriorated human life and destruction of environment. The solution for these problems is pursued in many directions, but there is short of active plan yet. The residence shall develop into new direction to satisfy the demand by reflecting society and culture as well as residents. This study examines external design with symbolic representation of regional feature as an alternative for uniform residence environment problem. This study will be a basic data upon suggesting the direction for planning high quality residence environment. This study examined the elements which form external space of residence complex, designed plan for external space of residence complex, and examined how to reflect regional feature which is important element of local community and culture on the space plan for residence complex based on the evaluation by local residents centered on Gimcheon-si, Gyeongbuk which just started local specialty by fostering. 'Special Area for Grape Industry.'

  • PDF

Finger-Knuckle-Print Verification Using Vector Similarity Matching of Keypoints (특징점간의 벡터 유사도 정합을 이용한 손가락 관절문 인증)

  • Kim, Min-Ki
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.9
    • /
    • pp.1057-1066
    • /
    • 2013
  • Personal verification using finger-knuckle-print(FKP) uses lines and creases at the finger-knuckle area, so the orientation information of texture is an important feature. In this paper, we propose an effective FKP verification method which extracts keypoints using SIFT algorithm and matches the keypoints by vector similarity. The vector is defined as a direction vector which connects a keypoint extracted from a query image and a corresponding keypoint extracted from a reference image. Since the direction vector is created by a pair of local keypoints, the direction vector itself represents only a local feature. However, it has an advantage of expanding a local feature to a global feature by comparing the vector similarity among vectors in two images. The experimental results show that the proposed method is superior to the previous methods based on orientation codes.