• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.580-583
• /
• 2010

본 논문에서는 동영상을 대상으로 하는 시각 주의 탐색에 대한 새로운 시스템에 대하여 설명한다. 제안하는 시스템은 기존의 공간 주의 모델에 새로운 시간 특징 추출 모듈을 추가함으로써 색상 및 명암, 형태, 방위와 같은 공간 특징 외에 움직임과 같은 시간 특징을 추가로 사용한 시각주의 탐색 모델이다. 기존 시스템과 가장 큰 차이점으로 공간 특징의 가중치 결합 방법과 움직임 특징 추출방법, 공간과 시간 특징 간 결합방법에 있다. 시스템의 성능평가를 위하여 다양한 환경의 영상을 대상으로 실험하였고 제안하는 시스템은 영상에서 사람이 시각적으로 중요하게 인지하는 영역과 부합되는 결과를 보였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.46-48
• /
• 2004

차량항법장치(Car Navigation System ： CNS)나 지리정보시스템(Geographic Information System ： CIS)에서 공간 객체를 효율적으로 다루는 색인기법에 대한 다양한 논의가 있어왔다 기존의 방법에서는 공간 객체의 인접성(cluster)과 밀집성 만을 고려해서 색인 트리를 생성하므로, 편향된 접근 빈도론 가진 공간 객체이 대해서 효과적인 탐색시간을 제공하지 못한다. 접근 빈도를 반영한 색인 기법은 공간 데이터가 갖는 특성-2개 이상의 차원에 대한 순서 할당이 불가능-에 의해서 지리적으로 인접된 객체들을 묶지 못하고, 이로 인해서 공간 객체에 대한 효율적인 색인 기법을 제공할 수 없다. 지리 데이터에 대한 위치와 접근 빈도가 주어질 매, 색인 트리는 좌표 정보뿐 아니라 공간 객체에 대한 접근 빈도도 고려해서 생성되어야 한다 본 논문에서 제안하는 기법을 전체 영역을 세부영역으로 분할하고, 각 세부 영역에 대해서 편향색인 트리를 생성한 뒤에 트리를 병합함으로써 밀집도와 접근 빈도를 반영한, 편향된(skewed) 색인 트리를 생성하도록 한다. 편향된 색인 트리는 접근 빈도가 높은 공간객체를 상위계층(level)에 위치시킴으로써 탐색비용을 줄인다.

• Journal of the Korean association of regional geographers
• /
• v.16 no.5
• /
• pp.590-609
• /
• 2010

The purpose of the study is to propose and evaluate Exploratory Spatial Data Analysis(ESDA) methods for examining age-specific population migration characteristics. First, population migration pyramid which is a pyramid-shaped graph designed with in-migration, out-migration, and net migration by age (or age group), was developed as a tool exploring age-specific migration propensities and structures. Second, various spatial statistics techniques based on local indicators of spatial association(LISA) such as Local Moran''s $I_i$, Getis-Ord ${G_i}^*$, and AMOEBA were suggested as ways to detect spatial dusters of age-specific net migration rate. These ESDA techniques were applied to age-specific population migration of Daegu Metropolitan City. Application results demonstrated that suggested ESDA methods can effectively detect new information and patterns such as contribution of age-specific migration propensities to population changes in a given region, relationship among different age groups, hot and cold spot of age-specific net migration rate, and similarity between age-specific spatial clusters.

• Spatial Information Research
• /
• v.19 no.2
• /
• pp.37-46
• /
• 2011

Recently in the field of GIS(Geographic Information System), data integration from various sources has become an important topic in order to use spatial data effectively. In general, the integration of spatial data is accomplished by navigating corresponding space object and combining the information interacting with each object. But it is very difficult to navigate an object which has correspondence with one in another dataset. Many matching methods have been studied for navigating spatial object. The purpose of this paper is development of method for searching correspondent spatial object considering local position error which is remained even after coordinate transform ation when two different building data sets integrated. To achieve this goal, we performed coordinate transformation and overlapped two data sets and generated blocks which have similar position error. We matched building objects within each block using similarity and ICP algorithm. Finally, we tested this method in the aspect of applicability.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.05a
• /
• pp.63-66
• /
• 2003

본 논문에서는 다면체의 인식을 위하여 사용되는 여러-방향-보기 방법 (multiple-view approach)에서 모델베이스의 탐색공간 크기를 줄이기 위한 방법을 제시한다. 이 방법에서 모델베이스는 물체를 둘러싸고 있는 보기 구 (view sphere)의 미리 정해진 보는 곳(viewpoint)에서 보여지는 2차원 투영체들로 구성된다. 물체를 인식하기 위하여 개략-상세 전략을 채택하되, 본 논문에서는 모델베이스의 개략 탐색을 위하여 ART-1을 이용하는 방법은 제시한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.05a
• /
• pp.387-389
• /
• 2019

자산 선택을 통해 최적 포트폴리오를 구성하는 데 있어 모든 경우의 수를 탐색하는 것은 불가능하다. 본 논문에서는 몬테카를로 시뮬레이션을 통해 탐색 공간을 축소하고, 축소된 탐색 공간에 유전 알고리즘을 적용함으로써 최적 포트폴리오에 근사하는 부최적 포트폴리오를 생성하는 방법을 제안한다.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.4
• /
• pp.372-378
• /
• 2010

This paper propose the fast motion estimation algorithm with adaptive search range adjustment using motion activities of temporal and spatial neighbor blocks. The existing fast motion estimation algorithms with adaptive search range adjustment use the maximum motion vector of all blocks in the reference frame. So these algorithms may not control a optimum search range for slow moving block in current frame. The proposed algorithm use the maximum motion vector of neighbor blocks in the reference frame to control a optimum search range for slow moving block. So the proposed algorithm can reduce computation time for motion estimation. The experiment results show that the proposed algorithm can reduce the number of search points about 15% more than Simple Dynamic Search Range(SDSR) algorithm while maintaining almost the same bit-rate and motion estimation error.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.9
• /
• pp.2173-2184
• /
• 1997

Among spatial queries handled in spatial database systems, nearest neighbor queries to find the nearest spatial object from the given locaion occur frequently. The number of searched nodes in an index must be minimized in order to increase the performance of nearest neighbor queries. An Existing approach considered only the processing of an nearest neighbor query in a two-dimensional search space and could not optimize the number of searched nodes accurately. In this paper, we propose the optimal search distance and prove its properties. The proposed optimal search distance is the measurement of a new search distance for accurately selecting the nodes which will be searched in processing nearest neighbor queries. We present an algorithm for processing the nearest neighbor query by applying the optimal search distance to R-trees and prove that the result of query processing is correcter than the existing approach.

• Journal of KIISE:Software and Applications
• /
• v.34 no.6
• /
• pp.503-518
• /
• 2007

Normalization transforms one parent genotype to be consistent with the other before crossover. In this paper, we explain how normalization alleviates the difficulties caused by non-synonymously redundant encodings in genetic algorithms. We define the encodings with maximally non-synonymous property and prove that the encodings induce uncorrelated search spaces. Extensive experiments for a number of problems show that normalization transforms the uncorrelated search spaces to correlated ones and leads to significant improvement in performance.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.25 no.1
• /
• pp.1-8
• /
• 2007

People tend to spend more time in indoor spaces than before such as shopping malls and subway stations. As buildings become larger and more complex, people feel difficulty in finding their ways to destinations. Consequently, a means to provide better paths can aid people in reducing time for finding ways. Routing information in large indoor spaces is especially required in emergency cases as fire, power failure and terror. This study suggests to compute optimal paths using $A^*$ algorithm based on raster GIS data structure. The suggested method can be used either in daily lives for path provision or in emergency cases for evacuation, and is illustrated on a campus building.