• ETRI Journal
• /
• 제39권1호
• /
• pp.97-107
• /
• 2017

A fast and accurate building-level visual place recognition method built on an image-retrieval scheme using street-view images is proposed. Reference images generated from street-view images usually depict multiple buildings and confusing regions, such as roads, sky, and vehicles, which degrades retrieval accuracy and causes matching ambiguity. The proposed practical database refinement method uses informative reference image and keypoint selection. For database refinement, the method uses a spatial layout of the buildings in the reference image, specifically a building-identification mask image, which is obtained from a prebuilt three-dimensional model of the site. A global-positioning-system-aware retrieval structure is incorporated in it. To evaluate the method, we constructed a dataset over an area of $0.26km^2$. It was comprised of 38,700 reference images and corresponding building-identification mask images. The proposed method removed 25% of the database images using informative reference image selection. It achieved 85.6% recall of the top five candidates in 1.25 s of full processing. The method thus achieved high accuracy at a low computational complexity.

• 한국농공학회:학술대회논문집
• /
• 한국농공학회 1999년도 Proceedings of the 1999 Annual Conference The Korean Society of Agricutural Engineers
• /
• pp.354-358
• /
• 1999

In practicing the refinement project of agriuctural production basys, many researches have been done until now, but they are not reused because management is not easily accomplished. We analysed and designed the Components of refinement project by the object -orientation technique, and presented a method of accumulation and management of object's data using relational database. In result, management of new data is easy and reusibility are increased compared to structural analysis technique.

• 보건행정학회지
• /
• 제14권1호
• /
• pp.121-147
• /
• 2004

Since the pilot program for a DRG-based prospective payment system was introduced in 1997, the performance of KDRGs has been one of hotly debated issues. The objectives of this study are to refine the classification algorithm of the KDRGs and to assess the improvement achieved by the refinement. The U.S. Medicare DRGs version 17.0 and the Australian Refined DRGs version 4.1 were reviewed to identify areas of possible impro-vement. Refined changes in the classification and result of date analyses were submitted to a panel of 48 physicians for their reviews and suggestions. The refinement was evaluated by the variance reduction in resource utilization achieved by the KDRG The database of 2,182,168 claims submitted to the Health Insurance Review Agency during 2002 was used for evaluation. As the result of the refinement, three new MDCs were introduced and the number of ADEGs increased from 332 to 674. Various age splits and two to four levels of severity classification for secondary diagnoses were introduced as well. A total of 1,817 groups were defined in the refined KDRGs. The variance reduction for charges of all patients increased from 48.2％ to 53.6％ by the refinement, and from 65.6％ to 73.1％ for non-outlier patients. The r-square for length of stays of all patients was increased from 28.3％ to 32.6％, and from 40.4％ to 44.9％ for non-outlier patients. These results indicated a significant improvement in the classification accuracy of the KDRG system.

• 정보기술과데이타베이스저널
• /
• 제4권2호
• /
• pp.33-45
• /
• 1998

Database summarization is the procedure to obtain generalized and representative descriptions expressing the content of a large amount of database at a glance. We present a top-down summary refinement procedure to discover database summaries. The procedure exploits attribute concept hierarchies that represent ISA relationships among domain concepts. It begins with the most generalized summary and proceeds to find more specialized ones by stepwise refinements. This top-down paradigm reveals at least two important advantages compared to the previous bottom-up methods. Firstly, it provides a natural way of reflecting the user's own discovery preference interactively. Secondly, it does not produce too large intermediate result that makes it hard for the bottom-up approach to be applied in practical environment. The proposed procedure can also be easily extended for distributed databases. Information content measure of a database summary is derived in order to identify more informative summaries among the discovered results.

• 한국멀티미디어학회논문지
• /
• 제18권12호
• /
• pp.1453-1461
• /
• 2015

Since digital images and videos are rapidly increasing in the internet with the spread of mobile computers and smartphones, research on image retrieval has gained tremendous momentum. Color, shape, and texture are major features used in image retrieval. Especially, color information has been widely used in image retrieval, because it is robust in translation, rotation, and a small change of camera view. This paper proposes a new method for histogram refinement based on local color difference. Firstly, the proposed method converts a RGB color image into a HSV color image. Secondly, it reduces the size of color space from 256³ to 32. It classifies pixels in the 32-color image into three groups according to the color difference between a central pixel and its neighbors in a 3x3 local region. Finally, it makes a color difference vector(CDV) representing three refined color histograms, then image retrieval is performed by the CDV matching. The experimental results using public image database show that the proposed method has higher retrieval accuracy than other conventional ones. They also show that the proposed method can be effectively applied to search low resolution images such as thumbnail images.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제11권1호
• /
• pp.1-7
• /
• 2011

Most of expert systems use the text-oriented knowledge bases. However, knowledge management using the knowledge bases is considered as a huge burden to the knowledge workers because it includes some troublesome works. It includes chasing and/or checking activities on Consistency, Redundancy, Circulation, and Refinement of the knowledge. In those cases, we consider that they could reduce the burdens by using relational database management systems-based knowledge management infrastructure and convert the knowledge into one of easy forms human can understand. Furthermore they could concentrate on the knowledge itself with the support of the systems. To meet the expectations, in this study, we have tried to develop a general-purposed knowledge conversion tool for expert systems. Especially, this study is focused on the knowledge conversions among text-oriented knowledge base, relational database knowledge base, and decision tree.

• 한국정보과학회논문지:데이타베이스
• /
• 제30권3호
• /
• pp.286-295
• /
• 2003

공간 선택 질의에 사용되는 질의 윈도우로는 직사각형이 주로 사용된다. 하지만, 공간 선택 질의의 윈도우로는 직사각형이 아닌 일반적인 다각형 모양도 가능하며, 최근에는 GIS 등과 같은 응용 프로그램들이 성능 향상으로 인해 보다 많은 공간 데이터를 다룰 수 있게 됨에 따라, 여러 다양한 종류의 응용도 많이 등장하고 있다. 따라서, 직사각형뿐만 아니라 임의의 다각형 형태의 질의 윈도우에도 적합한 정제 단계 수행 전략에 대해 고려해 볼 필요가 있다. 이러한 전략으로는 기존의 공간 조인에서와 같이 plane-sweep 알고리즘을 이용하는 방법이 일반적이다. 하지만, 공간 데이터와 질의 윈도우의 특성을 관찰해보면, 일반적으로 질의 윈도우가 공간 데이터보다 훨씬 간단한 모양으로 구성되어 있음을 알 수 있으므로, 본 논문에서는 이러한 상황에 보다 적합한 정제 단계 수행 방법을 제시하고 있다. 실험을 통해 알 수 있듯이, 질의 윈도우를 구성하는 점의 개수가 약 20개 이하인 일반적인 경우에는, 본 논문에서 제시하는 새로운 방법이 기존의 방법보다 20% 정도 향상된 성능을 보이고 있다.

• 대한한의학회지
• /
• 제34권1호
• /
• pp.170-178
• /
• 2013

Objectives: Because TKM-related statistics are scattered in year books, white papers, or web services, it is not easy to use. This study aimed to build a TKM statistical database offering one-stop service. Methods: We collected TKM statistics from year books, white papers, and web services using TKM related keywords which came from the advanced study. Then we removed, merged, or split the statistics looking through data and meta-data of statistics to build a database. Results: First, we classified the statistics into 6 categories and found that the service category was 303, product category 37 and so on. Second, we analyzed the source of statistics and found that the Ministry of Health & Welfare and the Korea statistics were the strongest sources. Third, we analyzed the years of statistics and found that the oldest was 1962, 35% were within the past 3 years, and only 14% were over 10 years old. Finally, we found that the 415 statistics were composed of 1,120 items and the average was 2.70. Conclusions: Through this study we found that more sophisticated TKM statistics must be produced and developed specially in the education, research, and administration categories. We hope that the effort of TKM societies is available to eliminate the lack of statistical producer's understanding about TKM.

• 정보처리학회논문지D
• /
• 제10D권4호
• /
• pp.591-602
• /
• 2003

기존의 단일 대용량 데이터베이스 서버에 인터넷 서비스 사용자들이 과도하게 몰릴 경우 서버에 발생하는 네트워크 통신량의 증가와 자원 사용량의 급격한 증가로 인해 서비스 처리 시간의 지연 및 서비스의 중단 현상이 발생할 수 있다. 이러한 문제들을 해결하기 위해 저비용의 여러 단일 노드를 고속의 네트워크로 연결하여 고성능을 제공하는 공간 데이터베이스 클러스터가 대두되었으나, 단일 노드에서 처리할 경우 전체 시스템의 성능을 저하시킬 수 있는 고비용의 공간 조인 연산에 대한 연구가 필요하다. 본 논문에서는 공간 데이터의 특성을 고려한 데이터의 분할과 부분 중복 기법을 사용하는 비공유 공간 데이터베이스 클러스터 환경에서 고비용의 공간 조인 연산을 효율적으로 수행하기 위한 논리적 분할 영역 및 병렬 공간 조인 기법을 제안한다. 제안 기법은 기존의 병렬 광간 조인 기법에서 나타나는 노드간 작업 생성 및 할당 단계가 필요하지 않으며 추가적인 메시지 전송이 발생하지 않으므로 고비용의 공간 조인 질의에 대해 기존의 비공유 구조를 위한 병렬 R-tree 공간 조인 기법보다 23%의 성능향상을 보인다. 또한, 각 클러스터 노드에서의 중복 정제(Refinement) 연산을 제거하므로 사용자에게 빠른 응답을 제공한다.

• 한국음향학회지
• /
• 제22권2호
• /
• pp.135-144
• /
• 2003

본 논문에서는 문-음성 합성기에서 사용되는 대용량 데이터 베이스의 구성을 목적으로 하는 음성 신호의 자동 분할기법을 기술하였다. 주된 내용은 은닉 마코프 모델에 기반을 둔 음소 분할과 여기서 얻어진 결과를 초기 음소 경계로 사용하여 이를 자동으로 수정하는 방법으로 구성되어 있다. 다층 퍼셉트론이 음성 경계의 검출기로 사용되었으며, 음소 분할의 성능을 증가시키기 위해, 음소의 천이 패턴에 따라 다층 퍼셉트론을 개별적으로 학습시키는 방법이 제안되었다. 음소 천이 패턴은 수작업에 의해 생성된 레이블 정보를 기준 음소 경계로 사용하여, 기준 음소 경계와 추정된 음소 경계간의 전체 오차를 최소화하는 관점에서 분할되도록 하였다. 단일 화자를 대상으로 하는 실험에서 제안된 기법을 통해 생성된 음소 경계는 기준 경계와 비교하여 95%의 음소가 20 msec 이내의 경계 오차를 갖는 것으로 나타났으며, 평균 자승 제곱근 오차면에서 수정 작업을 통해 25% 향상된 결과를 나타내었다.