• Title/Summary/Keyword: Split map

Search Result 35, Processing Time 0.025 seconds

SPLIT MAP AND IDEMPOTENT SEPARATING CONGRUENCE

  • CHANDRASEKARAN V. M.;LOGANATHAN M.
    • Journal of applied mathematics & informatics
    • /
    • v.18 no.1_2
    • /
    • pp.351-360
    • /
    • 2005
  • Let T be a regular semigroup and let S be a regular subsemigroup of T. In this paper we study the relationship between the idempotent separating congruence on S and the idempotent separating congruence on T, when T and S are connected by a splitmap ${\theta} : T {\to} S$.

A Study on Lane Detection Based on Split-Attention Backbone Network (Split-Attention 백본 네트워크를 활용한 차선 인식에 관한 연구)

  • Song, In seo;Lee, Seon woo;Kwon, Jang woo;Won, Jong hoon
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.19 no.5
    • /
    • pp.178-188
    • /
    • 2020
  • This paper proposes a lane recognition CNN network using split-attention network as a backbone to extract feature. Split-attention is a method of assigning weight to each channel of a feature map in the CNN feature extraction process; it can reliably extract the features of an image during the rapidly changing driving environment of a vehicle. The proposed deep neural networks in this paper were trained and evaluated using the Tusimple data set. The change in performance according to the number of layers of the backbone network was compared and analyzed. A result comparable to the latest research was obtained with an accuracy of up to 96.26, and FN showed the best result. Therefore, even in the driving environment of an actual vehicle, stable lane recognition is possible without misrecognition using the model proposed in this study.

Regression Neural Networks for Improving the Learning Performance of Single Feature Split Regression Trees (단일특징 분할 회귀트리의 학습성능 개선을 위한 회귀신경망)

  • Lim, Sook;Kim, Sung-Chun
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.1
    • /
    • pp.187-194
    • /
    • 1996
  • In this paper, we propose regression neural networks based on regression trees. We map regression trees into three layered feedforward networks. We put multi feature split functions in the first layer so that the networks have a better chance to get optimal partitions of input space. We suggest two supervised learning algorithms for the network training and test both in single feature split and multifeature split functions. In experiments, the proposed regression neural networks is proved to have the better learning performance than those of the single feature split regression trees and the single feature split regression networks. Furthermore, we shows that the proposed learning schemes have an effect to prune an over-grown tree without degrading the learning performance.

  • PDF

Analysis of Cloud Types and Low-Level Water Vapor Using Infrared Split-Window Data of NOAA/AVHRR (NOAA/AVHRR 적외 SPLIT WINDOW 자료를 이용한 운형과 하층수증기 분석)

  • 이미선;이희훈;서애숙
    • Korean Journal of Remote Sensing
    • /
    • v.11 no.1
    • /
    • pp.31-45
    • /
    • 1995
  • The values of brightness temperature difference (BTD) between 11um and 12um infrared channels may reflect amounts of low-level water vapor and cloud types due to the different absorptivity for water vapor between two channels. A simple method of classifying cloud types at night was proposed. Two-dimensional histograms of brightness temperature of the 11um channel and the BTD between the split window data over subareas around characteristic clouds such as Cb(cumulonimbus), Ci(cirrus), and Sc(stratocumulus) was constructed. Cb, Ci and Sc can be classified by seleting appropriate thresholds in the two-dimensional histograms. And we can see amounts of low-level water vapor in clear area as well as cloud types in cloudy area in the BTD image. The map of cloud types and low-level water vapor generated by this method was compared with 850hPa and 1000hPa relative humidity(%) of numerical analysis data and nephanalysis chart. The comparisons showed reasonable agreement.

Dispersion-managed Optical Link Configured Antipodalsymmetric Dispersion Maps with Respect to Midway Optical Phase Conjugator

  • Jae-Pil Chung;Seong-Real Lee
    • Journal of information and communication convergence engineering
    • /
    • v.21 no.2
    • /
    • pp.103-109
    • /
    • 2023
  • We investigated the antipodal-symmetric dispersion maps of a dispersion-managed link with a midway optical phase conjugator to compensate for the distorted 960 Gb/s wavelength division multiplexed (WDM) signal caused by these effects. The proposed antipodal-symmetric dispersion map has various shapes depending on the detailed design scheme. We confirmed that the dispersion-managed link designed with the dispersion map of the antipodal-symmetric structure is more advantageous than the conventional uniform dispersion map for compensating WDM channels. It was also confirmed that among the antipodal-symmetric structures, the dispersion map configured with the S-1-profile, in which S is inverted up and down, was more effective for distortion compensation than the dispersion map configured with the S-profile. In particular, we confirmed that the S-1-profile can broaden the optical pulse width intensively at a short transmission distance, more effectively compensating for the distorted WDM channel. Because this structure makes the intensity of the optical pulse relatively weak, it can decrease the nonlinear Kerr effect.

Sketch Map System using Clustering Method of XML Documents (XML 문서의 클러스터링 기법을 이용한 스케치맵 시스템)

  • Kim, Jung-Sook;Lee, Ya-Ri;Hong, Kyung-Pyo
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.12
    • /
    • pp.19-30
    • /
    • 2009
  • The service that has recently come into the spotlight utilizes the map to first approach the map and then provide various mash-up formed results through the interface. This service can provide precise information to the users but the map is barely reusable. The sketch-map system of this paper, unlike the existing large map system, uses the method of presenting the specific spot and route in XML document and then clustering among sketch-maps. The map service system is designed to show the optimum route to the destination in a simple outline map. It is done by renovating the spot presented by the map into optimum contents. This service system, through the process of analyzing, splitting and clustering of the sketch-map's XML document input, creates a valid form of a sketch-map. It uses the LCS(Longest Common Subsequence) algorithm for splitting and merging sketch-map in the process of query. In addition, the simulation of this system's expected effects is provided. It shows how the maps that share information and knowledge assemble to form a large map and thus presents the system's ability and role as a new research portal.

Detecting Road Intersections using Partially Similar Trajectories of Moving Objects (이동 객체의 부분 유사궤적 탐색을 활용한 교차로 검출 기법)

  • Park, Bokuk;Park, Jinkwan;Kim, Taeyong;Cho, Hwan-Gue
    • Journal of KIISE
    • /
    • v.43 no.4
    • /
    • pp.404-410
    • /
    • 2016
  • Automated road map generation poses significant research challenges since GPS-based navigation systems prevail in most general vehicles. This paper proposes an automated detecting method for intersection points using GPS vehicle trajectory data without any background digital map information. The proposed method exploits the fact that the trajectories are generally split into several branches at an intersection point. One problem in previous work on this intersection detecting is that those approaches require stopping points and direction changes for every testing vehicle. However our approach does not require such complex auxiliary information for intersection detecting. Our method is based on partial trajectory matching among trajectories since a set of incoming trajectories split other trajectory cluster branches at the intersection point. We tested our method on a real GPS data set with 1266 vehicles in Gangnam District, Seoul. Our experiment showed that the proposed method works well at some bigger intersection points in Gangnam. Our system scored 75% sensitivity and 78% specificity according to the test data. We believe that more GPS trajectory data would make our system more reliable and applicable in a practice.

Initialness of Sentence-final Particles in Mandarin Chinese

  • Huang, Xiao You Kevin
    • Proceedings of the Korean Society for Language and Information Conference
    • /
    • 2007.11a
    • /
    • pp.182-191
    • /
    • 2007
  • This paper gives a thorough investigation into Mandarin sentence-final particles (henceforth SFPs). First I induce core grammatical functions and semantic interpretations of SFPs. Based on Rizzi's (1997) Split CP hypothesis, I make some modifications to accommodate Mandarin SFPs and map them onto separate functional heads within a proper hierarchy. I also examine some empirical evidence of head directionality and tentatively assume Mandarin C is head-initial. To explain the surface head-final order, in light of Chomsky's (2001) Phase Theory and Hsieh's (2005) revised Spell-out hypothesis, I pose a CP complement to Spec movement. Following Moro's (2000) idea, I further claim the motivation behind is to seek for antisymetry.

  • PDF

THE KERNELS OF THE LINEAR MAPS OF FINITE GROUP ALGEBRAS

  • Dan Yan
    • Bulletin of the Korean Mathematical Society
    • /
    • v.61 no.1
    • /
    • pp.45-64
    • /
    • 2024
  • Let G be a finite group, K a split field for G, and L a linear map from K[G] to K. In our paper, we first give sufficient and necessary conditions for Ker L and Ker L ∩ Z(K[G]), respectively, to be Mathieu-Zhao spaces for some linear maps L. Then we give equivalent conditions for Ker L to be Mathieu-Zhao spaces of K[G] in term of the degrees of irreducible representations of G over K if G is a finite Abelian group or G has a normal Sylow p-subgroup H and L are class functions of G/H. In particular, we classify all Mathieu-Zhao spaces of the finite Abelian group algebras if K is a split field for G.