• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5C
• /
• pp.487-495
• /
• 2007

When error occurs during the network transmission of the image, the quality of the restored image is very serious. Therefore to maintain the received image quality, the error concealment technique is necessary. This paper presents an efficient spatial error concealment method using adaptive edge-oriented interpolation. It deals with errors on slice level. The proposed method uses boundary matching method having 2-step processes. We divide error block into external and internal region, adaptively restore each region. Because this method use overall as well as local edge characteristics, it preserves edge continuity and texture feature. The proposed technique reduces the complexity and provide better reconstruction quality for damaged images than the previous methods.

• Journal of the Korean association of regional geographers
• /
• v.19 no.2
• /
• pp.203-222
• /
• 2013

This study has been implemented under the two purposes. One is to critically explore how married immigrant women had experienced or experience conflicts, differentiation and so on occurred in their relations to family, neighbor, friend, organization and nation. The other is to understand married immigrant women and family through a new perspective based on a relational space of interacting trans-nation, local and nation. The results of the study are summarized as the followings. Firstly, transnational space is produced by international marriage between Korean man and foreign woman and kept (or activated ) by (non) everyday activities of married immigrant women and family. There are remittance, children's rearing and education, visits to mother's house, emotional interactions by phone and computer and so on. Secondly, multi-layered and relational local spaces have been (re)produced by married immigrant women's various activities related to family, neighbor, friend, nation and so on. Thirdly, married immigrant women's relations to nation state or government has been specifically presented (or expressed) through the acquiring of Korean nationality and government's activities of supporting multicultural family. Married immigrant women feel that their national identity between mother's nation and Korea is ambiguous and undecided.

• Journal of KIISE:Software and Applications
• /
• v.31 no.6
• /
• pp.829-839
• /
• 2004

Methods based on integer programming have been shown to be very effective in solving various crew pairing optimization problems. However, their applicability is limited to problems with linear constraints and objective functions. Also, those methods often require an unacceptable amount of time and/or memory resources given problems of larger scale. Heuristic methods such as neighborhood search, on the other hand, can handle large-scaled problems without too much difficulty and can be applied to problems having any form of objective functions and constraints. However, neighborhood search often gets stuck at local optima when faced with complex search spaces. This paper presents ,i hybrid algorithm of neighborhood search and integer programming, which nicely combines the advantages of both methods. The hybrid algorithm has been successfully tested on a large-scaled crew pairing optimization problem for a real subway line.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.10
• /
• pp.79-89
• /
• 2019

While most research focuses on the k-nearest neighbors (kNN) queries in the database community, an important type of proximity queries called k-farthest neighbors (kFN) queries has not received much attention. This paper addresses the problem of finding the k-farthest neighbors in road networks. Given a positive integer k, a query object q, and a set of data points P, a kFN query returns k data objects farthest from the query object q. Little attention has been paid to processing kFN queries in road networks. The challenge of processing kFN queries in road networks is reducing the number of network distance computations, which is the most prominent difference between a road network and a Euclidean space. In this study, we propose an efficient algorithm called FANS for k-FArthest Neighbor Search in road networks. We present a shared computation strategy to avoid redundant computation of the distances between a query object and data objects. We also present effective pruning techniques based on the maximum distance from a query object to data segments. Finally, we demonstrate the efficiency and scalability of our proposed solution with extensive experiments using real-world roadmaps.

• The Science & Technology
• /
• v.33 no.3 s.370
• /
• pp.15-17
• /
• 2000

해양을 무대로 한 육지공간의 창출은 21세기 들어 더욱 본격화될 전망이다. 이웃나라 일본에서는 이미 신오사카 국제공항이 완전한 인공섬에 건설되었고 우리나라도 인천국제공항이 기존 영종도 인근을 매립한 인공섬에 건설중이다. 3면이 바다인 우리나라에서 해양매립 공간 창출은 시급한 과제이지만 국내 기술수준은 아직 열악한 실정이다. 그러나 국내기술도 해양연구소, 각 대학 연구소 및 현대ㆍ대우ㆍ삼성중공업 등 민간기업 연구소에서 기술개발에 박차를 가하고 있어 머지않아 국제수준의 기술확보에 기대를 걸고 있다.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.47 no.4
• /
• pp.34-40
• /
• 2010

This paper proposes an efficient CABAC encoder to reduce syntax element storage in H.264/AVC entropy coding. In the proposed architecture, all blocks are designed in dedicated hardware, so it performs fast processing without programmable processors. Context modeler of CABAC encoder requires the neighbor block data. However it requires impractically huge memory size if the neighbor block data is directly stored without proper processing. Therefore, this paper proposes an effective method of storing the neighbor block data to decrease memory size. The proposed CABAC encoder has 35,463 gates in 0.18um standard cell library. It operates at maximum speed of 180MHz and its throughput is about 1 cycle per input symbol.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.6
• /
• pp.215-218
• /
• 2014

In hashing-based methods for approximate nearest neighbors(ANN) search, by mapping data points to k-bit binary codes, nearest neighbors are searched in a binary embedding space. In this paper, we present a hashing method using a PCA-based clustering method, Principal Direction Divisive Partitioning(PDDP). PDDP is a clustering method which repeatedly partitions the cluster with the largest variance into two clusters by using the first principal direction. The proposed hashing method utilizes the first principal direction as a projective direction for binary coding. Experimental results demonstrate that the proposed method is competitive compared with other hashing methods.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.11
• /
• pp.908-918
• /
• 2000

캐쉬의 성능을 향상시키는 가장 효과적인 방법은 프로그램 수행 특성에 내재되어 있는 시간적 (temporal locality) -공간적 지역성 (spatial locality)을 활용하는 것이다. 본 논문에서는 추가적인 장치나 컴파일러의 도움 없이 단지 캐쉬의 구조적인 특징과 간단한 메커니즘만을 이용하여 두 가지 타입의 지역성을 효과적으로 반영할 수 있는 새로운 캐쉬 시스템이 제안된다. 제안하는 새로운 캐쉬 시스템은 다른 블록 크기와 다른 연관도를 가지는 두 개의 캐쉬로써 구성되어 진다. 즉 작은 블록 크기를 지원하는 직접사상 캐쉬 (direct-mapped cache)와 큰 블록을 지원하는 완전 연관 버퍼 (fully-associative buffer)로 구성되어 진다. 큰 블록은 여러 개의 작은 블록으로 구성되어지며 두 캐쉬에서 접근 실패가 발생할 경우 직접사상 캐쉬의 접근 실패가 발생한 작은 블록과 그 이웃 작은 블록을 완전 연관 버퍼에 저장시킴으로써 한번 참조가 일어난 블록의 이웃 블록이 참조될 확률이 높다는 공간적 지역성의 특성을 효과적으로 반영할 수 있다. 또한 참조가 일어난 블록은 제어 비트를 사용하여 선택적으로 작은 블록을 직접사상 캐쉬에 저장함으로써 시간적 지역성을 보다 효과적으로 사용할 수 있다 시뮬레이션 결과에 따르면 기존의 직접사상 캐쉬의 4배 크기보다도 좋은 성능 향상을 보이고 있으며, 동일한 크기의 victim 캐쉬보다 우수한 성능을 보이고 소비 전력 면에서는 5% 정도의 전력 감소를 보이고 있다.

• 한국공간정보시스템학회:학술대회논문집
• /
• 2004.12a
• /
• pp.125-131
• /
• 2004

LiDAR 데이터의 필터링은 원 데이터로부터 건물, 수목 등과 같은 비지면점을 제거하는 과정이며, 이러한 필터링을 통해 DEM을 생성할 수 있다. 대표적인 필터링 방법들로는 분산을 이용한 linear prediction 기법, 주변 점들과의 경사관계를 이용한 slope-based 기법, morphology 필터, local maxima 필터 등이 있으며 이러한 기존의 기법들의 단점을 보완하기 위한 연구가 활발히 진행되고 있다. 대부분의 필터링 기법들은 필터의 크기(윈도우의 크기)와 같은 인자를 대상 지역에 적합하게 사용자가 직접 설정해주어야 한다. 더욱이 복잡한 지형, 지물이 존재하는 지역에 적용하기 위해서는 인자를 변형시켜줘야 하며 특히, 다양한 크기의 건물이 존재하는 지역에 대하여 적용하기 위해서는 가변적인 크기의 필터가 필요하다. 이에 본 논문에서는 다양한 크기의 건물이 존재하는 지역에 대하여 필터의 크기를 변화시키지 않고 필터링을 수행할 수 있는 연산기법을 제안하였다. 본 연구에서는 수목이나 자동차 등과 같은 작은 개체의 제거를 위해 고정된 작은 크기의 윈도우를 가지는 모폴로지 필터를 우선 적용한다. 그 후 건물과 같은 큰 개체의 포인트는 이웃 포인트와의 고도차이를 이용하여 인식하고 이웃에 위치하는 지면 포인트로 대체하며, 갱신된 값이 바로 다음 연산에 반영 되도록 한다. 또한 상, 하, 좌, 우 네 방향에 대하여 라인별로 독립된 연산을 수행한 후에 이들을 비교함으로써 오차를 보정한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1A
• /
• pp.66-74
• /
• 2007

Cognitive Radio system can guarantee available channel whenever, wherever by sensing surrounding channel condition. Therefore, there is a strict rule that have to use allocated channel efficiently without any interference from incumbent User. In this paper, to avoid interference which can occur during uplink transmission in CR system, we propose reporter using scheme which informs incumbent user's situation to adjacent cell to limit channel usage. Therefore, we can use more channel in each cell without interference. With this scheme we can expect better throughput using more channel in a large space with same resource.