• Title/Summary/Keyword: Extraction of feature line

Search Result 176, Processing Time 0.027 seconds

Handwritten Numerals Recognition Using an Ant-Miner Algorithm

  • Phokharatkul, Pisit;Phaiboon, Supachai
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.1031-1033
    • /
    • 2005
  • This paper presents a system of handwritten numerals recognition, which is based on Ant-miner algorithm (data mining based on Ant colony optimization). At the beginning, three distinct fractures (also called attributes) of each numeral are extracted. The attributes are Loop zones, End points, and Feature codes. After these data are extracted, the attributes are in the form of attribute = value (eg. End point10 = true). The extraction is started by dividing the numeral into 12 zones. The numbers 1-12 are referenced for each zone. The possible values of Loop zone attribute in each zone are "true" and "false". The meaning of "true" is that the zone contains the loop of the numeral. The Endpoint attribute being "true" means that this zone contains the end point of the numeral. There are 24 attributes now. The Feature code attribute tells us how many lines of a numeral are passed by the referenced line. There are 7 referenced lines used in this experiment. The total attributes are 31. All attributes are used for construction of the classification rules by the Ant-miner algorithm in order to classify 10 numerals. The Ant-miner algorithm is adapted with a little change in this experiment for a better recognition rate. The results showed the system can recognize all of the training set (a thousand items of data from 50 people). When the unseen data is tested from 10 people, the recognition rate is 98 %.

  • PDF

Facial Feature Extraction in Reduced Image using Generalized Symmetry Transform (일반화 대칭 변환을 이용한 축소 영상에서의 얼굴특징추출)

  • Paeng, Young-Hye;Jung, Sung-Hwan
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.2
    • /
    • pp.569-576
    • /
    • 2000
  • The GST can extract the position of facial features without a prior information in an image. However, this method requires a plenty of the processing time because the mask size to process GST must be larger than the size of object such as eye, mouth and nose in an image. In addition, it has the complexity for the computation of middle line to decide facial features. In this paper, we proposed two methods to overcome these disadvantage of the conventional method. First, we used the reduced image having enough information instead of an original image to decrease the processing time. Second, we used the extracted peak positions instead of the complex statistical processing to get the middle lines. To analyze the performance of the proposed method, we tested 200 images including, the front, rotated, spectacled, and mustached facial images. In result, the proposed method shows 85% in the performance of feature extraction and can reduce the processing time over 53 times, compared with existing method.

  • PDF

Development of a Characteristic Point Detection Algorithm for the Calculation of Pulse Wave Velocity (맥파전달속도 계산을 위한 특징점 검출 알고리즘 개발)

  • Lee, Lark-Beom;Im, Jae-Joong
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.5
    • /
    • pp.902-907
    • /
    • 2008
  • Shape of the pulse waveform is affected by the visco-elasticity characteristics of the arterial wall and the reflection waves generated at the bifurcations of arterial branches. This study was designed to improve the accuracy for the extraction of pulse wave features, then proved the superiority of the developed algorithm by clinical evaluation. Upstroke point of the pulse wave was used as an extraction feature since it is minimally affected by the waveform variation. R-peak of the ECG was used as a reference to decide the minimum level, then intersection of the least squares of regression line was used as an upstroke point. Developed algorithm was compared with the existing minimum value detection algorithm and tangent-intersection algorithm using data obtained from 102 subjects. Developed algorithm showed the least standard deviation of $0.29{\sim}0.44\;m/s$ compared with that of the existing algorithms, $0.91{\sim}3.66\;m/s$. Moreover, the rate of standard deviation of more than 1.00m/s for the PWV values reduced with the range of $29.0{\sim}42.4%$, which proved the superiority of the newly developed algorithm.

Automatic Target Recognition by selecting similarity-transform-invariant local and global features (유사변환에 불변인 국부적 특징과 광역적 특징 선택에 의한 자동 표적인식)

  • Sun, Sun-Gu;Park, Hyun-Wook
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.4
    • /
    • pp.370-380
    • /
    • 2002
  • This paper proposes an ATR (Automatic Target Recognition) algorithm for identifying non-occluded and occluded military vehicles in natural FLIR (Forward Looking InfraRed) images. After segmenting a target, a radial function is defined from the target boundary to extract global shape features. Also, to extract local shape features of upper region of a target, a distance function is defined from boundary points and a line between two extreme points. From two functions and target contour, four global and four local shape features are proposed. They are much more invariant to translation, rotation and scale transform than traditional feature sets. In the experiments, we show that the proposed feature set is superior to the traditional feature sets with respect to the similarity-transform invariance and recognition performance.

Online Handwritten Digit Recognition by Smith-Waterman Alignment (Smith-Waterman 정렬 알고리즘을 이용한 온라인 필기체 숫자인식)

  • Mun, Won-Ho;Choi, Yeon-Seok;Lee, Sang-Geol;Cha, Eui-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.9
    • /
    • pp.27-33
    • /
    • 2011
  • In this paper, we propose an efficient on-line handwritten digit recognition base on Convex-Concave curves feature which is extracted by a chain code sequence using Smith-Waterman alignment algorithm. The time sequential signal from mouse movement on the writing pad is described as a sequence of consecutive points on the x-y plane. So, we can create data-set which are successive and time-sequential pixel position data by preprocessing. Data preprocessed is used for Convex-Concave curves feature extraction. This feature is scale-, translation-, and rotation-invariant. The extracted specific feature is fed to a Smith-Waterman alignment algorithm, which in turn classifies it as one of the nine digits. In comparison with backpropagation neural network, Smith-Waterman alignment has the more outstanding performance.

A Generalized Method for Extracting Characters and Video Captions (일반화된 문자 및 비디오 자막 영역 추출 방법)

  • Chun, Byung-Tae;Bae, Young-Lae;Kim, Tai-Yun
    • Journal of KIISE:Software and Applications
    • /
    • v.27 no.6
    • /
    • pp.632-641
    • /
    • 2000
  • Conventional character extraction methods extract character regions using methods such as color reduction, region split and merge and texture analysis from the whole image. Because these methods use many heuristic variables and thresholding values derived from a priori knowledge, it is difficult to generalize them algorithmically. In this paper, we propose a method that can extract character regions using a topographical feature extraction method and a point-line-region extension method. The proposed method can also solve the problems of conventional methods by reducing heuristic variables and generalizing thresholding values. We see that character regions can be extracted by generalized variables and thresolding values without using a priori knowledge of character region. Experimental results show that the candidate region extraction rate is 100%, and the character region extraction rate is over 98%.

  • PDF

Corroded and loosened bolt detection of steel bolted joints based on improved you only look once network and line segment detector

  • Youhao Ni;Jianxiao Mao;Hao Wang;Yuguang Fu;Zhuo Xi
    • Smart Structures and Systems
    • /
    • v.32 no.1
    • /
    • pp.23-35
    • /
    • 2023
  • Steel bolted joint is an important part of steel structure, and its damage directly affects the bearing capacity and durability of steel structure. Currently, the existing research mainly focuses on the identification of corroded bolts and corroded bolts respectively, and there are few studies on multiple states. A detection framework of corroded and loosened bolts is proposed in this study, and the innovations can be summarized as follows: (i) Vision Transformer (ViT) is introduced to replace the third and fourth C3 module of you-only-look-once version 5s (YOLOv5s) algorithm, which increases the attention weights of feature channels and the feature extraction capability. (ii) Three states of the steel bolts are considered, including corroded bolt, bolt missing and clean bolt. (iii) Line segment detector (LSD) is introduced for bolt rotation angle calculation, which realizes bolt looseness detection. The improved YOLOv5s model was validated on the dataset, and the mean average precision (mAP) was increased from 0.902 to 0.952. In terms of a lab-scale joint, the performance of the LSD algorithm and the Hough transform was compared from different perspective angles. The error value of bolt loosening angle of the LSD algorithm is controlled within 1.09%, less than 8.91% of the Hough transform. Furthermore, the proposed framework was applied to fullscale joints of a steel bridge in China. Synthetic images of loosened bolts were successfully identified and the multiple states were well detected. Therefore, the proposed framework can be alternative of monitoring steel bolted joints for management department.

A Fast Recognition System of Gothic-Hangul using the Contour Tracing (윤곽선 추적에 의한 고딕체 한글의 신속인식에 관한 연구)

  • 정주성;김춘석;박충규
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.37 no.8
    • /
    • pp.579-587
    • /
    • 1988
  • Conventional methods of automatic recognition of Korean characters consist of the thinning processing, the segmentation of connected fundamental phonemes and the recognition of each fundamental character. These methods, however require the thinning processing which is complex and time consuming. Also several noise components make worse effects on the recognition of characters than in the case of no thinning. This paper describes the extraction method of the feature components of Korean fundamental characters of the Gothic Korean letter without the thinning. We regard line-components of the contour which describes the character's external boundary as the feature-components. The line-component includes the directional code, the length and the start point in the image. Each fundamental character is represented by the string of directional codes. Therefore the recognition process is only the string pattern matching. We use the Gothic-hangul in the experiment. The ecognition rate is 92%.

Analysis of the Chip Waveforms for LPI Communication

  • Maing, Jun-Ho;Ryu, Heung-Gyoon;Lee, Dae-Il
    • Journal of electromagnetic engineering and science
    • /
    • v.4 no.2
    • /
    • pp.63-67
    • /
    • 2004
  • DAM(Delay-And-Multiplier) intercept receiver usually detects the symbol rate of the transmitted DS spread spectrum signal for the feature extraction. It is important for secure communication to reduce the normalized output signal-to-noise ratio that is generated at the DAM intercept receiver as a measure of detectability. In this paper, several kinds of chip waveforms are novelly analyzed for LPI(Low-Probability of Intercept) communication against DAM intercept receiver. Consequently, it is shown that the rectangular chip waveform shows the best LPI performance in the bandwidth of 2/$T_c$TEX>, 4/$T_c$TEX>, and 6/$T_c$TEX>/. Except the rectangular waveform, kaiser chip waveform show better LPI performance than the other waveforms in the bandwidth of 4/$T_c$TEX> and 6/$T_c$TEX>.

Implementation of User Interface and Web Server for Dynamic Signature Verification

  • Kim, Jin-Whan;Cho, Hyuk-Gyu;Cha, Eui-Young
    • Proceedings of the CALSEC Conference
    • /
    • 2005.03a
    • /
    • pp.299-304
    • /
    • 2005
  • This paper is a research on the dynamic signature verification of error rate which are false rejection rate and false acceptance rate, the size of signature verification engine, the size of the characteristic vectors of a signature, the ability to distinguish similar signatures, and so on. We suggest feature extraction and comparison method of the signature verification. Also, we have implemented our system with Java technology for more efficient user interfaces and various OS Platforms.

  • PDF