• Title/Summary/Keyword: 5-이웃

Search Result 297, Processing Time 0.026 seconds

A Vehicle Communication Routing Algorithm Considering Road Characteristics and 2-Hop Neighbors in Urban Areas (도심 환경에서 도로의 특성과 2-홉 이웃 노드를 고려한 차량 통신 라우팅 알고리즘)

  • Ryu, Min-Woo;Cha, Si-Ho;Cho, Kuk-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.5B
    • /
    • pp.464-470
    • /
    • 2011
  • V2V (Vehicle-to-Vehicle) is a special kind of VANET (Vehicular Ad-hoc Network), which has high mobility and frequent topology changes and causes the link breakage problem. To resolve this problem, geographic routing protocols such as greedy forwarding are proposed. However, the greedy forwarding approach selects the node closest to the destination node as the transfer node within the transmission range so that it may cause many problems owing to many intersections and many changes in vehicular traffic in urban areas. The paper proposes a greedy perimeter urban routing (GPUR) algorithm considering the presence of 2-hop neighbor nodes and the road characteristics. Simulation results using ns-2 reveal that the proposed GPUR algorithm significantly reduces the routing error problem and the probability of local maximum than the existing routing protocols.

Local Information-based Betweenness Centrality to Identify Important Nodes in Social Networks (사회관계망에서 중요 노드 식별을 위한 지역정보 기반 매개 중심도)

  • Shon, Jin Gon;Kim, Yong-Hwan;Han, Youn-Hee
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.2 no.5
    • /
    • pp.209-216
    • /
    • 2013
  • In traditional social network analysis, the betweenness centrality measure has been heavily used to identify the relative importance of nodes in terms of message delivery. Since the time complexity to calculate the betweenness centrality is very high, however, it is difficult to get it of each node in large-scale social network where there are so many nodes and edges. In this paper, we define a new type of network, called the expanded ego network, which is built only with each node's local information, i.e., neighbor information of the node's neighbor nodes, and also define a new measure, called the expended ego betweenness centrality. Through the intensive experiment with Barab$\acute{a}$si-Albert network model to generate the scale-free networks which most social networks have as their embedded feature, we also show that the nodes' importance rank based on the expanded ego betweenness centrality has high similarity with that based on the traditional betweenness centrality.

Texture Descriptor for Texture-Based Image Retrieval and Its Application in Computer-Aided Diagnosis System (질감 기반 이미지 검색을 위한 질감 서술자 및 컴퓨터 조력 진단 시스템의 적용)

  • Saipullah, Khairul Muzzammil;Peng, Shao-Hu;Kim, Deok-Hwan
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.47 no.4
    • /
    • pp.34-43
    • /
    • 2010
  • Texture information plays an important role in object recognition and classification. To perform an accurate classification, the texture feature used in the classification must be highly discriminative. This paper presents a novel texture descriptor for texture-based image retrieval and its application in Computer-Aided Diagnosis (CAD) system for Emphysema classification. The texture descriptor is based on the combination of local surrounding neighborhood difference and centralized neighborhood difference and is named as Combined Neighborhood Difference (CND). The local differences of surrounding neighborhood difference and centralized neighborhood difference between pixels are compared and converted into binary codewords. Then binomial factor is assigned to the codewords in order to convert them into high discriminative unique values. The distribution of these unique values is computed and used as the texture feature vectors. The texture classification accuracies using Outex and Brodatz dataset show that CND achieves an average of 92.5%, whereas LBP, LND and Gabor filter achieve 89.3%, 90.7% and 83.6%, respectively. The implementations of CND in the computer-aided diagnosis of Emphysema is also presented in this paper.

Jeju Jong-Nang Channel Code III (제주 정낭(錠木) 채널 Code III)

  • Park, Ju-Yong;Kim, Jeong-Su;Lee, Moon-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.5
    • /
    • pp.91-103
    • /
    • 2015
  • This paper presents "The 3-User NOR switching channel based on interference decoding with receiver cooperation" in succession to "Jeju Jong Nang channel code I, II". The Jeju Jong Nang code is considered as one of the earliest human binary coded communication (HBCC) in the world with a definite "1" or "0" binary symbolic analysis of switching circuits. In this paper, we introduce a practical example of interference decoding with receiver cooperation based on the three user Jong Nang NOR switching channel. The proposed system models are the three user Jong Nang (TUJN) NOR logic switching on-off, three-user injective deterministic NOR switching channel and Gaussian interference channel (GIC) with receiver cooperation. Therefore, this model is well matched to Shannon binary symmetric and erasure channel capacity. We show the applications of three-user Gaussian interference decoding to obtain deterministic channels which means each receiver cooperation helps to adjacent others in order to increase degree of freedom. Thus, the optimal sum rate of interference mitigation through adjacent receiver cooperation achieves 7 bits.

Development of an Evaluation Index for Identifying Freeway Traffic Safety Based on Integrating RWIS and VDS Data (기상 및 교통 자료를 이용한 교통류 안전성 판단 지표 개발)

  • Park, Hyunjin;Joo, Shinhye;Oh, Cheol
    • Journal of Korean Society of Transportation
    • /
    • v.32 no.5
    • /
    • pp.441-451
    • /
    • 2014
  • This study proposes a novel performance measure, which is referred to as Hazardous Spacing Index (HSI), to be used for evaluating safety of traffic stream on freeways. The basic principle of the proposed methodology is to investigate whether drivers would have sufficient stopping sight distance (SSD) under limited visibility conditions to eliminate rear-end crash potentials at every time step. Both Road Weather Information Systems (RWIS) and Vehicle Detection Systems (VDS) data were used to derive visibility distance (VD) and SSD, respectively. Moreover, the K-Nearest Neighbors (KNN) method was adopted to predict both VD and SSD in estimating predictive HSIs, which would be used to trigger advanced warning information to encourage safer driving. The outcome of this study is also expected to be used for monitoring freeway traffic stream in terms of safety.

Machine Learning Methods to Predict Vehicle Fuel Consumption

  • Ko, Kwangho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.27 no.9
    • /
    • pp.13-20
    • /
    • 2022
  • It's proposed and analyzed ML(Machine Learning) models to predict vehicle FC(Fuel Consumption) in real-time. The test driving was done for a car to measure vehicle speed, acceleration, road gradient and FC for training dataset. The various ML models were trained with feature data of speed, acceleration and road-gradient for target FC. There are two kind of ML models and one is regression type of linear regression and k-nearest neighbors regression and the other is classification type of k-nearest neighbors classifier, logistic regression, decision tree, random forest and gradient boosting in the study. The prediction accuracy is low in range of 0.5 ~ 0.6 for real-time FC and the classification type is more accurate than the regression ones. The prediction error for total FC has very low value of about 0.2 ~ 2.0% and regression models are more accurate than classification ones. It's for the coefficient of determination (R2) of accuracy score distributing predicted values along mean of targets as the coefficient decreases. Therefore regression models are good for total FC and classification ones are proper for real-time FC prediction.

Gesture Classification Based on k-Nearest Neighbors Algorithm for Game Interface (게임 인터페이스를 위한 최근접 이웃알고리즘 기반의 제스처 분류)

  • Chae, Ji Hun;Lim, Jong Heon;Lee, Joon Jae
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.5
    • /
    • pp.874-880
    • /
    • 2016
  • The gesture classification has been applied to many fields. But it is not efficient in the environment for game interface with low specification devices such as mobile and tablet, In this paper, we propose a effective way for realistic game interface using k-nearest neighbors algorithm for gesture classification. It is time consuming by realtime rendering process in game interface. To reduce the process time while preserving the accuracy, a reconstruction method to minimize error between training and test data sets is also proposed. The experimental results show that the proposed method is better than the conventional methods in both accuracy and time.

Truncation Error Problem of Error Diffusion Method (오차 확산 방법의 절삭 오차 문제)

  • Jho, Cheung-Woon
    • Journal of Advanced Navigation Technology
    • /
    • v.15 no.5
    • /
    • pp.850-856
    • /
    • 2011
  • The error diffusion method is one of the digital halftoning methods that diffuses quantization errors of current processing pixel to neighboring pixels and get a high-quality black-white image. This method has the problematic case which partially increase or decrease summation of diffused errors in the process of diffusing the quantization error. In this paper, we analyze Floyd-Steinberg method, Jarvis-Judice-Ninke method, Stucki method, and Shiau-Fan method as a representative case of error diffusion methods and propose a solution method of this problem.

Efficient Flooding in Link-State Routing Protocols (링크상태 라우팅 프로토콜의 효율적인 플러딩)

  • Park, Moosung;Rhee, Seung-Hyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.5
    • /
    • pp.326-328
    • /
    • 2014
  • In this paper we propose an efficient algorithm for LSA(Link State Advertisements) flooding. Link state routing protocols have been widely adopted in wired networks. When link state change occurs, a LSA is flooded into the whole network. The overhead of LSA flooding may be a big problem in wireless networks because their link states can be changed frequently. We propose an efficient flooding method that optimizes the flooding processes in wireless networks.

Resolving High-Order Harmonics into Components (고차조화파의 구성 요소별 분해)

  • 김정훈;신현준;이동근;남창희
    • Proceedings of the Optical Society of Korea Conference
    • /
    • 2000.08a
    • /
    • pp.242-243
    • /
    • 2000
  • 매우 짧고 결맞는 극자외선 광원의 개발에 대한 기대로 강력한 레이저 장과 상호작용하는 원자에서 일어나는 비선형 다광자 현상에 대한 연구가 최근에 활발하게 전개되고 있다. 이 상호작용 과정에서 발생하는 빛은 매우 넓은 파장 영역에 걸쳐있으며, 입사 레이저의 홀수 배에 해당하는 매우 높은 차수의 조화파들을 포함하고 있다고 알려져 있다$^{(1,2)}$ . 최근의 이론 및 실험에 의하면, 강력하고 짧은 레이저 펄스를 사용하면 고차조화파의 파장에 청색변이를 일으킬 수 있다$^{(3.4.5)}$ . 실제 관측된 청색변이는 이웃하는 홀수 조화파의 간격보다 더 크다$^{(5)}$ . 따라서, 원리적으로는 매우 넓은 가변 폭을 갖고 연속적으로 파장을 조정할 수 있는 파장가변 극자외선 광원의 개발이 가능하다. (중략)

  • PDF