• Title/Summary/Keyword: self-mapping

Search Result 224, Processing Time 0.03 seconds

A 3-D Position Compensation Method of Industrial Robot Using Block Interpolation (블록 보간법을 이용한 산업용 로봇의 3차원 위치 보정기법)

  • Ryu, Hang-Ki;Woo, Kyung-Hang;Choi, Won-Ho;Lee, Jae-Kook
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.13 no.3
    • /
    • pp.235-241
    • /
    • 2007
  • This paper proposes a self-calibration method of robots those are used in industrial assembly lines. The proposed method is a position compensation using laser sensor and vision camera. Because the laser sensor is cross type laser sensor which can scan a horizontal and vertical line, it is efficient way to detect a feature of vehicle and winding shape of vehicle's body. For position compensation of 3-Dimensional axis, we applied block interpolation method. For selecting feature point, pattern matching method is used and 3-D position is selected by Euclidean distance mapping between 462 feature values and evaluated feature point. In order to evaluate the proposed algorithm, experiments are performed in real industrial vehicle assembly line. In results, robot's working point can be displayed 3-D points. These points are used to diagnosis error of position and reselecting working point.

A study On the Image Coding Based on the Segmented Fractal Coding (세그멘트기법을 이용한 프랙탈 영상 부호화에 대한 연구)

  • Seo, Ju-Ha;Choi, Hwang-Kyu;Cho, Churl-Hee
    • Journal of Industrial Technology
    • /
    • v.15
    • /
    • pp.93-101
    • /
    • 1995
  • Fractal coding is a promising method for image compression, but it has not lived up to its promise as low bit-rate image compression scheme. The existing algorithms for finding self-mapping contractive transforms are computationally expensive and offer a poor rate-quality tradeoff. In this paper, we propose a segment based fractal coding. We classify the range blocks into shade, midrange or edge blocks, and segment edge block along the edge. And we apply midrange coding scheme for each segment. Our experiments show that our method gives better rate-qualty trade of than current fractal block coding methods.

  • PDF

Design of Ultra-Wideband Klopfenstein Tapered Balun (클로펜스타인 테이퍼 구조의 초광대역 발룬 설계)

  • Lee, Ho Sang;Yoo, Tae Hoon;Nah, Wansoo
    • Proceedings of the KIEE Conference
    • /
    • 2015.07a
    • /
    • pp.1273-1274
    • /
    • 2015
  • 본 논문에서는 주파수 무관(frequency independence) 특성을 갖는 자기상보 구조(self-complementary structure)로 된 안테나의 급전선로(feed line)로 사용할 수 있는 초광대역 발룬(ultra-wideband balun)을 제안하였다. 발룬을 설계하기 위해 클로펜스타인 테이퍼(Klopfenstein taper)를 사용하여 임피던스 프로파일(impedance profile)을 구하고 이를 평행 스트립 선로(parallel strip line) 구조로 구현하기 위해 등각사상방법(conformal mapping method)을 이용했다. 설계한 발룬을 직접 제작하여 측정한 결과, 대역폭은 반사손실 -10 dB를 기준으로 할 때 0.45~10.53 GHz까지 10.08 GHz로 나타나, UHF(ultra high frequency) 통신대역에서 UWB(ultra-wideband) 통신대역에 이르기까지 매우 넓은 주파수 범위에서 자기상보형 안테나의 입력 임피던스 $188{\Omega}$$50{\Omega}$의 특성 임피던스에 정합시킬 수 있음을 확인하였다.

  • PDF

PROVING UNIFIED COMMON FIXED POINT THEOREMS VIA COMMON PROPERTY (E-A) IN SYMMETRIC SPACES

  • Soliman, Ahmed Hussein;Imdad, Mohammad;Hasan, Mohammad
    • Communications of the Korean Mathematical Society
    • /
    • v.25 no.4
    • /
    • pp.629-645
    • /
    • 2010
  • A metrical common fixed point theorem proved for a pair of self mappings due to Sastry and Murthy ([16]) is extended to symmetric spaces which in turn unifies certain fixed point theorems due to Pant ([13]) and Cho et al. ([4]) besides deriving some related results. Some illustrative examples to highlight the realized improvements are also furnished.

Human Face Recognition used Improved Back-Propagation (BP) Neural Network

  • Zhang, Ru-Yang;Lee, Eung-Joo
    • Journal of Korea Multimedia Society
    • /
    • v.21 no.4
    • /
    • pp.471-477
    • /
    • 2018
  • As an important key technology using on electronic devices, face recognition has become one of the hottest technology recently. The traditional BP Neural network has a strong ability of self-learning, adaptive and powerful non-linear mapping but it also has disadvantages such as slow convergence speed, easy to be traversed in the training process and easy to fall into local minimum points. So we come up with an algorithm based on BP neural network but also combined with the PCA algorithm and other methods such as the elastic gradient descent method which can improve the original network to try to improve the whole recognition efficiency and has the advantages of both PCA algorithm and BP neural network.

Categorical Analysis for Finite Cellular Automata Rule 15 (유한 셀룰러 오토마타 규칙 15에 대한 카테고리적 분석)

  • Park, Jung-Hee;Lee, Hyen-Yeal
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.8
    • /
    • pp.752-757
    • /
    • 2000
  • The recursive formulae, which can self-reproduce the state transition graphs, of one-dimensional cellular automata rule 15 with two states (0 and 1) and four different boundary conditions were founded by categorical access. The categorical access makes the evolution process for cellular automata be expressed easily since it enables the mapping of automata between different domains.

  • PDF

Land Cover Clustering of NDVI-drived Phenological Features

  • Kim, Dong-Keun;Suh, Myoung-Seok;Park, Kyoung-Yoon
    • Proceedings of the KSRS Conference
    • /
    • 1998.09a
    • /
    • pp.201-206
    • /
    • 1998
  • In this paper, we have considered the method for clustering land cover types over the East Asia from AVHRR data. The feature vectors such that maximum NDVI, amplitude of NDVI, mean NDVI, and NDVI threshold are extracted from the 10-day composite by maximum value composite(MVC) for reducing the effect of cloud contaninations. To find the land cover clusters given by the feature vectors, we are adapted the self-organizing feature map(SOFM) clustering which is the mapping of an input vector space of n-dimensions into a one - or two-dimensional grid of output layer. The approach is to find first the clusters by the first layer SOFM and then merge several clusters of the first layer to a large cluster by the second layer SOFM. In experiments, we were used the 8-km AVHRR data for two years(1992-1993) over the East Asia.

  • PDF

A Dynamically Reconfiguring Backpropagation Neural Network and Its Application to the Inverse Kinematic Solution of Robot Manipulators (동적 변화구조의 역전달 신경회로와 로보트의 역 기구학 해구현에의 응용)

  • 오세영;송재명
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.39 no.9
    • /
    • pp.985-996
    • /
    • 1990
  • An inverse kinematic solution of a robot manipulator using multilayer perceptrons is proposed. Neural networks allow the solution of some complex nonlinear equations such as the inverse kinematics of a robot manipulator without the need for its model. However, the back-propagation (BP) learning rule for multilayer perceptrons has the major limitation of being too slow in learning to be practical. In this paper, a new algorithm named Dynamically Reconfiguring BP is proposed to improve its learning speed. It uses a modified version of Kohonen's Self-Organizing Feature Map (SOFM) to partition the input space and for each input point, select a subset of the hidden processing elements or neurons. A subset of the original network results from these selected neuron which learns the desired mapping for this small input region. It is this selective property that accelerates convergence as well as enhances resolution. This network was used to learn the parity function and further, to solve the inverse kinematic problem of a robot manipulator. The results demonstrate faster learning than the BP network.

Robust Mobile-Robot Localization for Indoor SLAM (이동 로봇의 강인한 위치 추정을 통한 실내 SLAM)

  • Mo, Se-Hyun;Yu, Dong-Hyun;Park, Jong-Ho;Chong, Kil-To
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.22 no.4
    • /
    • pp.301-306
    • /
    • 2016
  • This paper presents the results of a study for robust self-localization and indoor slam using external cameras (such as a CCTV) and odometry of mobile robot. First, a position of mobile robot was estimated by using maker and odometry. This data was then fused with camera data and odometry data using an extended kalman filter. Finally, indoor slam was realized by applying the proposed method. This was demonstrated in the actual experiment.

Common fixed point theorem and example in intuitionistic fuzzy metric space (직관적 퍼지 거리공간에서 공통부동점 정리 및 예제)

  • Park, Jong-Seo;Kim, Seon-Yu
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.4
    • /
    • pp.524-529
    • /
    • 2008
  • Park et.al.[10] defined the intuitionistic fuzzy metric space in which it is a little revised in Park[4], and Park et.a1.[7] proved a fixed point theorem of Banach for the contractive mapping of a complete intuitionistic fuzzy metric space. In this paper, we will establish common fixed point theorem for four self maps in intuitionistic fuzzy metric space. These results have been used to obtain translation and generalization of Grabiec's contraction principle.