• Title/Summary/Keyword: degree of a map

Search Result 355, Processing Time 0.022 seconds

DEGREE OF THE GAUSS MAP ON AN ODD DIMENSIONAL MANIFOLD

  • Byun, Yang-Hyun
    • East Asian mathematical journal
    • /
    • v.14 no.2
    • /
    • pp.269-279
    • /
    • 1998
  • For a codimension 1 submanifold in a Euclidean 2n-space, the degree of the gauss map mod 2 is the semi-characteristic of the manifold in $Z_2$ coefficient.

  • PDF

Research of method for making a map by a ultrasonic sensor on a wheel base robot system (단일 초음파 센서를 이용한 주행 지도 작성에 관한 연구)

  • Kim, Jee-Hong;Chae, Myung-Hoon;Lee, Chang-Goo
    • Proceedings of the KIEE Conference
    • /
    • 2006.10c
    • /
    • pp.567-569
    • /
    • 2006
  • This study proposes the method to make a map of moving environment area and passed area by sensor using for recognizing environment or avoiding obstacle. We win develop an efficient algorithm to use sensors and get the data by the user friendly system. Through this system, we win study the way to know of the driving environment of moving robot on the long distance point. To this, we use only one ultra-sonic sensor with a servo motor which rotates 180 degree and loads an ultra-sonic sensor. A sensor can measure 1m${\sim}$8m range and a servo motor can distinguish 15 degree by 12 divide of 180 degree. By this feature of operating system, the robot which has these sensor module detects around of area and moves another point. In this way, users gather the data of detecting distance and change the data to X-Y coordinates. And users derive a map from these accumulate data.

  • PDF

Hazy Particle Map-based Automated Fog Removal Method with Haziness Degree Evaluator Applied (Haziness Degree Evaluator를 적용한 Hazy Particle Map 기반 자동화 안개 제거 방법)

  • Sim, Hwi Bo;Kang, Bong Soon
    • Journal of Korea Multimedia Society
    • /
    • v.25 no.9
    • /
    • pp.1266-1272
    • /
    • 2022
  • With the recent development of computer vision technology, image processing-based mechanical devices are being developed to realize autonomous driving. The camera-taken images of image processing-based machines are invisible due to scattering and absorption of light in foggy conditions. This lowers the object recognition rate and causes malfunction. The safety of the technology is very important because the malfunction of autonomous driving leads to human casualties. In order to increase the stability of the technology, it is necessary to apply an efficient haze removal algorithm to the camera. In the conventional haze removal method, since the haze removal operation is performed regardless of the haze concentration of the input image, excessive haze is removed and the quality of the resulting image is deteriorated. In this paper, we propose an automatic haze removal method that removes haze according to the haze density of the input image by applying Ngo's Haziness Degree Evaluator (HDE) to Kim's haze removal algorithm using Hazy Particle Map. The proposed haze removal method removes the haze according to the haze concentration of the input image, thereby preventing the quality degradation of the input image that does not require haze removal and solving the problem of excessive haze removal. The superiority of the proposed haze removal method is verified through qualitative and quantitative evaluation.

THE MEASURE OF THE UNIFORMLY HYPERBOLIC INVARIANT SET OF EXACT SEPARATRIX MAP

  • Kim, Gwang-Il;Chi, Dong-Pyo
    • Communications of the Korean Mathematical Society
    • /
    • v.12 no.3
    • /
    • pp.779-788
    • /
    • 1997
  • In this work, using the exact separatrix map which provides an efficient way to describe dynamics near the separatrix, we study the stochastic layer near the separatrix of a one-degree-of-freedom Hamilitonian system with time periodic perturbation. Applying the twist map theory to the exact separatrix map, T. Ahn, G. I. Kim and S. Kim proved the existence of the uniformly hyperbolic invariant set(UHIS) near separatrix. Using the theorems of Bowen and Franks, we prove this UHIS has measure zero.

  • PDF

FINITENESS OF COMMUTABLE MAPS OF BOUNDED DEGREE

  • Lee, Chong Gyu;Ye, Hexi
    • Bulletin of the Korean Mathematical Society
    • /
    • v.52 no.1
    • /
    • pp.45-56
    • /
    • 2015
  • In this paper, we study the relation between two dynamical systems (V, f) and (V, g) with $f{\circ}g=g{\circ}f$. As an application, we show that an endomorphism (respectively a polynomial map with Zariski dense, of bounded Preper(f)) has only finitely many endomorphisms (respectively polynomial maps) of bounded degree which are commutable with f.

High-Resolution Map of Zodiacal Dust Bands by WIZARD

  • Yang, Hongu;Ishiguro, Masateru;Usui, Fumihiko;Ueno, Munetaka
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.37 no.1
    • /
    • pp.101.1-101.1
    • /
    • 2012
  • Interplanetary dust particles are observable as zodiacal light, which is the sunlight scattered by the interplanetary dust particles. The origins of interplanetary dust particles are still in question because they are eroded by Poynting-Robertson photon drag and mutual collisions among dust particles. The small-scale structures in the zodiacal light provided a clue to specify their origins. Asteroidal debris were detected as band-like structures (dust bands), and the cometary large particles were detected as narrow trails (dust trails). However, little is confirmative about their detailed origins and mineralogical compositions because of the lack of observational data particularly in the optical wavelength. We made a high-resolution optical zodiacal light map based on the CCD observations at Mauna Kea, Hawaii. We analyzed data taken on November 12, 2004. After the data reduction, such as flat fielding and subtraction of airglow emissions, we succeeded in the construction of the zodiacal light map with the spatial resolution of 3' in the solar elongation between 45 degree and 180 degree. This is the highest resolution map in the visible wavelength so far. In this map, we confirmed the dust bands structures near the ecliptic plane. We will discuss about the similarities and the differences between optical and infrared dust bands.

  • PDF

Function Approximation for Reinforcement Learning using Fuzzy Clustering (퍼지 클러스터링을 이용한 강화학습의 함수근사)

  • Lee, Young-Ah;Jung, Kyoung-Sook;Chung, Tae-Choong
    • The KIPS Transactions:PartB
    • /
    • v.10B no.6
    • /
    • pp.587-592
    • /
    • 2003
  • Many real world control problems have continuous states and actions. When the state space is continuous, the reinforcement learning problems involve very large state space and suffer from memory and time for learning all individual state-action values. These problems need function approximators that reason action about new state from previously experienced states. We introduce Fuzzy Q-Map that is a function approximators for 1 - step Q-learning and is based on fuzzy clustering. Fuzzy Q-Map groups similar states and chooses an action and refers Q value according to membership degree. The centroid and Q value of winner cluster is updated using membership degree and TD(Temporal Difference) error. We applied Fuzzy Q-Map to the mountain car problem and acquired accelerated learning speed.

Adaptive Noise Reduction Algorithm for an Image Based on a Bayesian Method

  • Kim, Yeong-Hwa;Nam, Ji-Ho
    • Communications for Statistical Applications and Methods
    • /
    • v.19 no.4
    • /
    • pp.619-628
    • /
    • 2012
  • Noise reduction is an important issue in the field of image processing because image noise lowers the quality of the original pure image. The basic difficulty is that the noise and the signal are not easily distinguished. Simple smoothing is the most basic and important procedure to effectively remove the noise; however, the weakness is that the feature area is simultaneously blurred. In this research, we use ways to measure the degree of noise with respect to the degree of image features and propose a Bayesian noise reduction method based on MAP (maximum a posteriori). Simulation results show that the proposed adaptive noise reduction algorithm using Bayesian MAP provides good performance regardless of the level of noise variance.

ON THE GAUSS MAP COMING FROM A FRAMING OF THE TANGENT BUNDLE OF A COMPACT MANIFOLD

  • Byun, Yanghyun;Cheong, Daewoong
    • Communications of the Korean Mathematical Society
    • /
    • v.28 no.1
    • /
    • pp.183-189
    • /
    • 2013
  • Let W be a parallelizable compact oriented manifold of dimension $n$ with boundary ${\partial}W=M$. We define the so-called Gauss map $f:M{\rightarrow}S^{n-1}$ using a framing of TW and show that the degree of $f$ is equal to Euler-Poincar$\acute{e}$ number ${\chi}(W)$, regardless of the specific framing. As a special case, we get a Hopf theorem.