• Title/Summary/Keyword: simple map

Search Result 493, Processing Time 0.027 seconds

Object Recognition using Smart Tag and Stereo Vision System on Pan-Tilt Mechanism

  • Kim, Jin-Young;Im, Chang-Jun;Lee, Sang-Won;Lee, Ho-Gil
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.2379-2384
    • /
    • 2005
  • We propose a novel method for object recognition using the smart tag system with a stereo vision on a pan-tilt mechanism. We developed a smart tag which included IRED device. The smart tag is attached onto the object. We also developed a stereo vision system which pans and tilts for the object image to be the centered on each whole image view. A Stereo vision system on the pan-tilt mechanism can map the position of IRED to the robot coordinate system by using pan-tilt angles. And then, to map the size and pose of the object for the robot to coordinate the system, we used a simple model-based vision algorithm. To increase the possibility of tag-based object recognition, we implemented our approach by using as easy and simple techniques as possible.

  • PDF

Blackbox and Scenario-Based Testing of Online Games Using Game Description Language

  • Cho, Chang-Sik;Lee, Dong-Chun;Sohn, Kang-Min;Park, Chang-Joon;Kang, Ji-Hoon
    • ETRI Journal
    • /
    • v.33 no.3
    • /
    • pp.470-473
    • /
    • 2011
  • In this letter, we propose blackbox and scenario-based testing of multiplayer online games as well as simple load testing. Game testing is done from outside the source code, and the access to the source code is not required to testers because the game logic is described with a game description language and virtual game map. Instead of using a subset of the main game client for the test client, only game packet protocols and the sequence of packets are analyzed for new game testing. In addition, complex and various scenarios can be tested through combining defined actions. Scenario-based testing helps testers mimic real testing environments instead of doing simple load testing and improves the productivity of game testing.

A Simple Random Signal Generator Employing Current Mode Switched Capacitor Circuit

  • Yamakawa, Takeshi;Suetake, Noriaki;Miki, Tsutomu;Uchino, Eiji;Eguchi, Akihiro
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1993.06a
    • /
    • pp.865-868
    • /
    • 1993
  • This paper describes a simple random signal generator employing by CMOS analog technology in current mode. The system is a nonlinear dynamical system described by a difference equation, such as x(t+1) = f(x(t)) , t = 0,1,2, ... , where f($.$) is a nonlinear function of x(f). The tent map is used as a nonlinear function to produce the random signals with the uniform distribution. The prototype is implemented by using transistor array devices fabricated in a mass product line. It can be easily realized on a chip. Uniform randomness of the signal is examined by the serial correlation test and the $\chi$2 test.

  • PDF

A new approach to the minimization of switching functions by the simple table method (Simple table 방법에 의한 논리함수 최소화의 신방법)

  • 황희융
    • 전기의세계
    • /
    • v.28 no.6
    • /
    • pp.61-77
    • /
    • 1979
  • This paper is concerned with minimization process of the binary logic function. This paper describes an algorithm called the SIMPLE TABLE METHOD that well suited to minimization a switching function of any number of variables. For the Simple Table construction, a theorem based upon the numerical properties of the logic function is derived from the relationships governing minterms of the given function. Finally the minimal sum of products can be obtained in terms of the Direct Method or the Indirect Method from the table and table characteristics derived from the Simple Table. The properties and table characteristics used in this paper are described. All the minterms of a switching function are manipulated only by decimal numbers, not binary numbers. Some examples are used as a vehicle to guide the readers who are familiar with the Karnaugh map and Quine-McCluskey tabular method to this New method. These examples not only treat how to handle Don't Care miterms but also show the multiple output functions.

  • PDF

Head Pose Estimation by using Morphological Property of Disparity Map

  • Jun, Se-Woong;Park, Sung-Kee;Lee, Moon-Key
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.735-739
    • /
    • 2005
  • This paper presents a new system to estimate the head pose of human in interactive indoor environment that has dynamic illumination change and large working space. The main idea of this system is to suggest a new morphological feature for estimating head angle from stereo disparity map. When a disparity map is obtained from stereo camera, the matching confidence value can be derived by measurements of correlation of the stereo images. Applying a threshold to the confidence value, we also obtain the specific morphology of the disparity map. Therefore, we can obtain the morphological shape of disparity map. Through the analysis of this morphological property, the head pose can be estimated. It is simple and fast algorithm in comparison with other algorithm which apply facial template, 2D, 3D models and optical flow method. Our system can automatically segment and estimate head pose in a wide range of head motion without manual initialization like other optical flow system. As the result of experiments, we obtained the reliable head orientation data under the real-time performance.

  • PDF

EXISTENCE OF HOMOTOPIC HARMONIC MAPS INTO METRIC SPACE OF NONPOSITIVE CURVATURE

  • Jeon, Myung-Jin
    • Communications of the Korean Mathematical Society
    • /
    • v.10 no.4
    • /
    • pp.931-941
    • /
    • 1995
  • The definitions and techniques, which deals with homotopic harmonic maps from a compact Riemannian manifold into a compact metric space, developed by N. J. Korevaar and R. M. Schoen [7] can be applied to more general situations. In this paper, we prove that for a complicated domain, possibly noncompact Riemannian manifold with infinitely generated fundamental group, the existence of homotopic harmonic maps can be proved if the initial map is simple in some sense.

  • PDF

Analysis for Scalar Mixing Characteristics using Linear Eddy Model (Linear Eddy Model을 이용한 스칼라의 혼합특성 해석)

  • Kim, Hoo-Joong;Kim, Yong-Mo;Ahn, Kook-Young
    • 한국연소학회:학술대회논문집
    • /
    • 2004.06a
    • /
    • pp.133-137
    • /
    • 2004
  • The present study is focused on the small scale turbulent mixing processes in the scalar field. In order to deal with molecular mixing in turbulent flow, the linear eddy model is addressed. In each realization, the molecular mixing term is implemented deterministically, and turbulent stirring is represented by a sequence of instantaneous, statistically independent rearrangement event called by triplet map. The LEM approach is applied with relatively simple conditions. The characteristics of scalar mixing and PDF profiles are addressed in detail.

  • PDF

MAP/G/1/K QUEUE WITH MULTIPLE THRESHOLDS ON BUFFER

  • Choi, Doo-Il
    • Communications of the Korean Mathematical Society
    • /
    • v.14 no.3
    • /
    • pp.611-625
    • /
    • 1999
  • We consider ΜΑΡ/G/ 1 finite capacity queue with mul-tiple thresholds on buffer. The arrival of customers follows a Markov-ian arrival process(MAP). The service time of a customer depends on the queue length at service initiation of the customer. By using the embeded Markov chain method and the supplementary variable method, we obtain the queue length distribution ar departure epochs and at arbitrary epochs. This gives the loss probability and the mean waiting time by Little's law. We also give a simple numerical examples to apply the overload control in packetized networks.

  • PDF

Analyses of Computation Time on Snakes and Gradient Vector Flow

  • Kwak, Young-Tae
    • Journal of the Korean Data and Information Science Society
    • /
    • v.18 no.2
    • /
    • pp.439-445
    • /
    • 2007
  • GVF can solve two difficulties with Snakes that are on setting initial contour and have a hard time processing into boundary concavities. But GVF takes much longer computation time than the existing Snakes because of their edge map and partial derivatives. Therefore this paper analyzed the computation time between GVF and Snakes. As a simulation result, both algorithms took almost similar computation time in simple image. In real images, GVF took about two times computation than Snakes.

  • PDF

Automatic classification of failure patterns in semiconductor EDS Test using pattern recognition (반도체 EDS공정에서의 패턴인식기법을 이용한 불량 유형 자동 분류 방법 연구)

  • 한영신;황미영;이칠기
    • Proceedings of the IEEK Conference
    • /
    • 2003.07b
    • /
    • pp.703-706
    • /
    • 2003
  • Yield enhancement in semiconductor fabrication is important. It is ideal to prevent all the failures. However, when a failure occurs, it is important to quickly specify the cause stage and take countermeasure. The automatic method of failure pattern extraction from fail bit map provides reduced time to analysis and facilitates yield enhancement. This paper describes the techniques to automatically classifies a failure pattern using a fail bit map, a new simple schema which facilitates the failure analysis.

  • PDF