• Journal of Satellite, Information and Communications
• /
• v.8 no.2
• /
• pp.29-35
• /
• 2013

In this paper, we investigate the type and detection methode of spoofing attack, and then analyze the performance of spoofing detection algorithm in GPS L1 signal through the simulation. Generally spoofer is different from the jammer, because the receiver can be operated and not. In case of spoofing the GPS receiver is hard to recognize the spoofing attack and can be operated normally without stopping because the spoofing signal is the mimic GPS signal. To evaluate the performance of spoofing detection algorithm, both the software based spoofing and GPS signal generator and the software based GPS receiver are implemented. In paper, we can check that spoofing signal can affect to the DLL and PLL tracking loop because code delay and doppler frequency of spoofing. The spoofing detection algorithm has been implemented using the pseudorange, signal strength and navigation solution of GPS receiver and proposed algorithm can effectively detect the spoofing signal.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06b
• /
• pp.474-477
• /
• 2011

본 논문은 평면상에 주어진 자료점의 집합 P로부터 질의 집합 Q에 대해 skyline을 성질을 만족하는 P의 부분집합을 찾는 알고리즘을 제시한다. 이 때 P의 점들 간의 우위는 Q의 점에서의 거리를 이용하여 판단하는데 이 논문에서는 두 점간의 거리를 $L_1$거리로 정의한다. 이와 같은 환경 하에서 |P|$\geq$|Q|라고 가정할 때 우리는 O(|P|log|P|) 시간에 모든 skyline을 찾는 알고리즘을 제시하였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.106-108
• /
• 2014

본 논문에서는 노드의 로드밸런싱 속성을 이용하여 분산경로를 설정하는 L.T(Load Tolerance)알고리즘을 제안한다. 모바일 애드 혹 네트워크(Mobile Ad hoc Network)는 유동성을 가진 노드들로 구성된 네트워크로 토폴로지의 변화가 빈번하여, 기존 알고리즘에서는 라우팅 경로를 유지하기 위한 계층적 네트워크연구가 진행되어 왔다. 하지만 계층적 네트워크에서 특정 클러스터 헤드노드에게 로드밸런싱이 집중될 경우, 클러스터 헤드노드의 제한된 로드밸런싱을 초과되어 통신이 단절된다. 본 논문에서 제안한 알고리즘은 유효한 통신 반경 안에 존재하는 클러스터 헤드노드들의 로드밸런싱을 측정한다. 클러스터 헤드노드의 로드밸런싱이 높을 경우, 소속된 클러스터 멤버노드는 클러스터 헤드노들의 로드밸런싱과 동적속성을 분석하여 L.T 속성을 계산하며, 계산된 L.T 속성을 이용하여, 노드의 분산경로를 설정한다. 모의실험을 통해 클러스터 헤드노드의 로드 밸런싱이 높을 경우, 로드밸런싱이 낮은 분산 경로를 제공함에 따라 향상된 패킷 전송률을 보일 것으로 기대된다.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.37 no.5
• /
• pp.609-617
• /
• 2013

This paper presents a near-minimum time path planning algorithm for autonomous driving. The problem of near-minimum time path planning is an optimization problem in which it is necessary to take into account not only the geometry of the circuit but also the dynamics of the vehicle. The path planning algorithm consists of a candidate path generation and a velocity optimization algorithm. The candidate path generation algorithm calculates the compromises between the shortest path and the path that allows the highest speeds to be achieved. The velocity optimization algorithm calculates the lap time of each candidate considering the vehicle driving performance and tire friction limit. By using the calculated path and velocity of each candidate, we calculate the lap times and search for a near-minimum time path. The proposed algorithm was evaluated via computer simulation using CarSim and Matlab/Simulink.

• Journal of Broadcast Engineering
• /
• v.21 no.1
• /
• pp.60-65
• /
• 2016

This paper introduces the non-local means (NLM) algorithm for image denoising, and also introduces an improved algorithm which is based on the principal component analysis (PCA). To do the PCA, a covariance matrix of a given image should be evaluated first. If we let the size of neighborhood patches of the NLM S × S², and let the number of pixels Q, a matrix multiplication of the size S² × Q is required to compute a covariance matrix. According to the characteristic of images, such computation is inefficient. Therefore, this paper proposes an efficient method to compute the covariance matrix by sampling the pixels. After sampling, the covariance matrix can be computed with matrices of the size S² × floor (Width/l) × (Height/l).

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.99-109
• /
• 2007

IEEE 802.lie is being proposed to improve QoS by IEEE 802.11 working group. HCCA (HCF Controlled Channel Access) a centralized polling based mechanism of IEEE 802.11e, needs a scheduling algorithm that decides on how the available radio resources are allocated to the polled STAs. In IEEE 802.l1e standard Reference Scheduler is presented. Reference Scheduler Polls all STAs in a polling list by the same interval that causes ineffectively frequent polling. It increases not only the overhead but it decreases the TXOP (Transmission Opportunity) utilization. In this paper, we propose the scheduling and admission control algorithm that poll stations depending on the MSI (Maximum Service Interval)o( stations to solve these shortcomings. In our proposed algorithm a station is polled by an interval close to its MSI, so polling overhead decrease and TXOP utilization increases than Reference Scheduler. Simulation results show that our algorithm outperforms Reference Scheduler. Our algorithm maintains higher aggregate throughput and services mere stations than Reference Scheduler.

• The Journal of the Korea Contents Association
• /
• v.8 no.5
• /
• pp.52-60
• /
• 2008

A simple Time Division Multiplex(TDM) switching system which has been widely in satellite networks provides any size of bandwidth for a number of low bandwidth subscribers by allocating proper number of time slots in a frame. In this paper, we propose a new approach based on graph coloring model for efficient time slot assignment algorithm in contrast to network flow model in previous works. When the frame length of an initial matrix of time slot requests is 2's power, this matrix is divided into two matrices of time slot requests using binary divide and conquer method based on the graph coloring model. This process is continued until resulting matrices of time slot requests are of length one. While the most efficient algorithm proposed in the literature has time complexity of $O(N^{4.5})$, the time complexity of the proposed algorithm is $O(NLlog_2L)$, where N is the number of input/output links and L is the number of time slot alloted to each link in the frame.

• The KIPS Transactions:PartB
• /
• v.15B no.6
• /
• pp.507-516
• /
• 2008

Cardiac disease is the leading cause of death in the world. Quantification of cardiac function is performed by manually calculating blood volume and ejection fraction in routine clinical practice, but it requires high computational costs. In this study, an automatic left ventricle (LV) segmentation algorithm using short-axis cine cardiac MRI is presented. We compensate coil sensitivity of magnitude images depending on coil location, classify edge information after extracting edges, and segment LV by applying region-growing segmentation. We design a weighting function for intensity signal and calculate a blood volume of LV considering partial voxel effects. Using cardiac cine SSFP of 38 subjects with Cornell University IRB approval, we compared our algorithm to manual contour tracing and MASS software. Without partial volume effects, we achieved segmentation accuracy of $3.3mL{\pm}5.8$ (standard deviation) and $3.2mL{\pm}4.3$ in diastolic and systolic phases, respectively. With partial volume effects, the accuracy was $19.1mL{\pm}8.8$ and $10.3mL{\pm}6.1$ in diastolic and systolic phases, respectively. Also in ejection fraction, the accuracy was $-1.3%{\pm}2.6$ and $-2.1%{\pm}2.4$ without and with partial volume effects, respectively. Results support that the proposed algorithm is exact and useful for clinical practice.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.1
• /
• pp.162-172
• /
• 2015

In this paper, we propose an adaptive detection algorithm of footstep and a classification algorithm for activities of the detected footstep. The proposed algorithm can detect and classify whole movement as well as individual and irregular activities, since it does not use continuous footstep signals which are used by most previous research. For classifying movement, we use feature vectors obtained from frequency spectrum from FFT, CWT, AR model and image of AR spectrogram. With SVM classifier, we obtain classification accuracy of single footstep activities over 90% when feature vectors using AR spectrogram image are used.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.721-723
• /
• 2005

본 논문에서는 영상 기반 항해를 위하여 최적의 영상 샘플링을 획득하기 위한 영상 샘플링 알고리즘을 제안한다. 이를 위해 초기 과다 샘플링 된 영상열의 입력으로부터 장면 전역에 걸쳐 적절한 렌더링 품질을 보장하는 최소의 샘플링을 선택하는 감소 샘플링(decremental sampling)의 접근 방법을 기반으로 본 문제를 Set Covering 문제로 공식화한다. 각 시점으로부터 최상의 영상 품질을 보장하는 영역을 3D 와핑 알고리즘을 사용하여 포함 영역으로 표현하여, 이렇게 표현된 Set Covering 문제는 유전 알고리즘을 사용하여 최적화 문제로 설계한다. 실험 결과 본 논문에서 제안한 방법을 통해 최적 해를 구함으로서 만족할 만한 영상 기반 항해의 결과를 얻을 수 있었다.