• 자동차안전학회지
• /
• 제14권3호
• /
• pp.65-70
• /
• 2022

Lane change in urban environments is a challenge for both human-driving and automated driving due to their complexity and non-linearity. With the recent development of deep-learning, the use of the RNN network, which uses time series data, has become the mainstream in this field. Many researches using RNN show high accuracy in highway environments, but still do not for urban environments where the surrounding situation is complex and rapidly changing. Therefore, this paper proposes a lane change possibility decision network by adopting Attention layer, which is an SOTA in the field of seq2seq. By weighting each time step within a given time horizon, the context of the road situation is more human-like. A total 7D vectors of x, y distances and longitudinal relative speed of side front and rear vehicles, and longitudinal speed of ego vehicle were used as input. A total 5,614 expert data of 4,098 yield cases and 1,516 non-yield cases were used for training, and the performance of this network was tested through 1,817 data. Our network achieves 99.641% of test accuracy, which is about 4% higher than a network using only LSTM in an urban environment. Furthermore, it shows robust behavior to false-positive or true-negative objects.

• 제어로봇시스템학회논문지
• /
• 제19권2호
• /
• pp.131-139
• /
• 2013

In recent years alternative navigation system such as a DBRN (Data-Base Referenced Navigation) system using geophysical information is getting attention in the military navigation systems in advanced countries. Specifically TRN (Terrain Referenced Navigation) algorithm research is important because TRN system is a practical DBRN application in South Korea at present time. This paper presents an integrated navigation algorithm that combines a linear profile-based TRN and INS (Inertial Navigation System). We propose a correlation analysis method between TRN performance and terrain roughness index. Then we propose a conditional position update scheme that utilizes the position output of the conventional linear profile type TRN depending on the terrain roughness index. Performance of the proposed algorithm is verified through Monte Carlo computer simulations using the actual terrain database. The results show that the TRN/INS integrated algorithm, even when the initial INS error is present, overcomes the shortcomings of linear profile-based TRN and improves navigation performance.

• Journal of Information Processing Systems
• /
• 제13권3호
• /
• pp.546-558
• /
• 2017

The amount of multimedia traffic over the Internet has been increasing because of the development of networks and mobile devices. Accordingly, studies on multicast, which is used to provide efficient multimedia and video services, have been conducted. In particular, studies on centralized multicast tree construction have attracted attention with the advent of software-defined networking. Among the centralized multicast tree construction algorithms, the group Takahashi and Matsuyama (GTM) algorithm is the most commonly used in multiple multicast tree construction. However, the GTM algorithm considers only the network-cost overhead when constructing multicast trees; it does not consider the temporary service disruption that arises from a link change for users receiving an existing service. Therefore, in this study, we propose a multiple multicast tree construction algorithm that can reduce network cost while avoiding considerable degradation of service quality to users. This is accomplished by considering both network-cost and link-change overhead of users. Experimental results reveal that, compared to the GTM algorithm, the proposed algorithm significantly improves the user-experienced quality of service by substantially reducing the number of linkchanged users while only slightly adding to the network-cost overhead.

• 한국통신학회논문지
• /
• 제34권12B호
• /
• pp.1426-1434
• /
• 2009

RFID/USN 융합 기술은 향후 유비쿼터스 네트워크 구축의 핵심 기술로 인식되고 있다. 특히 RFID/USN 융합기술을 지원하기 위한 무선 센서 네트워크에서는 네트워크 수명 증대를 위해 전력 절감 기술에 대한 중요성이 부각되고 있다. 이에 본 논문에서는 불필요한 활성 구간의 발생으로 인해 전력을 낭비하는 기존 무선 센서 네트워크의 구조의 문제점을 분석하고, 이를 해결하기 위한 새로운 전력 절감 알고리즘을 제안한다. 본 논문에서 제안하는 전력 절감 알고리즘은 장기간 수면의 개념을 도입하여, 불필요한 활성 구간의 반복을 차단하고 긴 시간 수면구간을 적용할 노드를 노드 간 연결성과 잔여 전력량을 통해 선정하는 것을 특징으로 한다. 이를 위해 수학적 분석을 통한 전력 절감 이득과 모의실험을 통한 성능 분석을 수행하였고, 그 결과 센서 노드의 전력 소모를 획기적으로 줄일 수 있음을 입증하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권2호
• /
• pp.574-592
• /
• 2016

Range-free localization algorithm computes a normal node's position by estimating the distance to anchors which know their actual position. In recent years, reliable anchor selection research has been gained a lot of attention because this approach improves localization accuracy by selecting the only subset of anchors called reliable anchor. The distance estimation accuracy and the geometric shape formed by anchors are the two important factors which need to be considered when selecting the reliable anchors. In this paper, we study the relationship between a relative position of three anchors and localization error. From this study, under ideal condition, which is with zero localization error, we find two conditions for anchor selection, thereby proposing a novel anchor selection algorithm that selects three anchors matched most closely to the two conditions, and the validities of the conditions are proved using two theorems. By further employing the conditions, we finally propose a novel range-free localization algorithm. Simulation results show that the proposed algorithm shows considerably improved performance as compared to other existing works.

• 한국게임학회 논문지
• /
• 제1권1호
• /
• pp.55-60
• /
• 2001

With rapid development of graphic hardware, researches on Virtual Reality and 3D Games have received more attention than before. For more realistic 3D graphic scene, objects were to be presented with lots of polygons and the number of objects shown in a scene was remarkably increased. Therefore, for effective visualization of large polygon models like this, view-frustum culling method, that visualizes only objects shown in the screen, has been widely used. In general, the bounding boxes that include objects are generated firstly, and the boxes are intersected with view-frustum to check whether object is in the visible area or not. Recently, an algorithm that can check in-out test of objects using OpenGL's selection mode, which is originally used to select the objects in the screen, is suggested. This algorithm is fast because it can use hardware acceleration. In this study, by implementing and applying this algorithm to large polygon models, we showed the efficiency of OpenGL assisted View-Frustum Culling algorithm. If this algorithm is applied to 3D games that have to process more complicated characters and landscapes, performance improvement can be expected.

• Current Optics and Photonics
• /
• 제1권4호
• /
• pp.315-324
• /
• 2017

In recent years, multicast services such as high-definition television (HDTV), video conferencing, interactive distance learning, and distributed games have increased exponentially, and wavelength-division multiplexing (WDM) networks are considered to be a promising technology due to their support for multicast applications. Multicast survivability in WDM networks has been the focus of extensive attention since a single-link failure in an optical network may result in a massive loss of data. But the improvement of network survivability increases energy consumption due to more resource allocation for protection. In this paper, an energy-efficient multicast algorithm (EEMA) is proposed to reduce energy consumption in WDM networks. Two cost functions are defined based on the link state to determine both working and protection paths for a multicast request in WDM networks. To increase the number of sleeping links, the link cost function of the working path aims to integrate new working path into the links with more working paths. Sleeping links indicate the links in sleep mode, which do not have any working path. To increase bandwidth utilization by sharing spare capacity, the cost function of the protection path is defined to use sleeping fibers for establishing new protection paths. Finally, the performance of the proposed algorithm is evaluated in terms of energy consumption, and also the blocking probability is evaluated under various traffic environments through OPNET. Simulation results show that our algorithm reduces energy consumption while maintaining the quality of service.

• 전기학회논문지
• /
• 제64권11호
• /
• pp.1578-1586
• /
• 2015

Personal rapid transit (PRT) is getting attention as a new form of transportation. It is energy efficient and provides the high level of passenger service. In this study, the dynamic PRT dispatching and routing problem is dealt with. Passengers request transportation service on a complex network, and an operating system monitors passenger arrivals and coordinates vehicles in real time. A new online dispatching and routing algorithm is proposed, which minimizes the total travel distance of vehicles and the waiting time of passengers. The algorithm dispatches vehicles by considering multiple vehicles' state and multiple passengers at the same time. In particular, finding the shortest-time path is attempted by taking into account the future congestion on lanes. Discrete-event simulation is employed to validate the performance of the proposed algorithm. The results show the algorithm in this study outperforms others.

• International Journal of Computer Science & Network Security
• /
• 제21권12호
• /
• pp.65-74
• /
• 2021

Digital image processing and retrieving have increasingly become very popular on the Internet and getting more attention from various multimedia fields. That results in additional privacy requirements placed on efficient image matching techniques in various applications. Hence, several searching methods have been developed when confidential images are used in image matching between pairs of security agencies, most of these search methods either limited by its cost or precision. This study proposes a secure and efficient method that preserves image privacy and confidentially between two communicating parties. To retrieve an image, feature vector is extracted from the given query image, and then the similarities with the stored database images features vector are calculated to retrieve the matched images based on an indexing scheme and matching strategy. We used a secure content-based image retrieval features detector algorithm called Speeded-Up Robust Features (SURF) algorithm over public cloud to extract the features and the Honey Encryption algorithm. The purpose of using the encrypted images database is to provide an accurate searching through encrypted documents without needing decryption. Progress in this area helps protect the privacy of sensitive data stored on the cloud. The experimental results (conducted on a well-known image-set) show that the performance of the proposed methodology achieved a noticeable enhancement level in terms of precision, recall, F-Measure, and execution time.

• 문화기술의 융합
• /
• 제5권3호
• /
• pp.257-262
• /
• 2019

최근 드론 같은 무인 이동체에 대한 관심과 일상생활에 활용이 늘어나면서 많은 다양한 분야에서 이를 이용하는 응용 사례가 급속도로 확산되고 있다. 하지만 이러한 무인 이동체는 쉽게 외부 환경 요인으로 인한 균형 이탈이나 추락 등의 사고로 이어질 수 있는 많은 위험 요인을 내포하고 있다. 이러한 무인 이동체의 안전한 운용을 위하여 안정적인 자세 제어 알고리즘은 매우 중요한 부분을 차지하고 있으며 현재 널리 사용되고 있는 PID 제어 알고리즘은 거의 완벽한 단계의 자세 제어 기술을 선보이고 있다. 본 연구에서는 기존의 자세 제어 방법과는 달리 보다 외부 환경적인 요인으로 부터 안정적이고 지속적인 자세 제어를 할 수 있는 퍼지 로직을 기반으로 하는 스마트 자세 제어 알고리즘을 제안하고 모의실험을 통하여 기존의 방법과 그 성능을 비교 분석하고자 한다.