• Journal of Digital Contents Society
• /
• v.2 no.2
• /
• pp.179-189
• /
• 2001

This paper aims at faster processing and retrieval in fingerprint identification systems by reducing the amount of preprocessing and the size of the feature vector. The distribution of fingerprint directions is a set of local directions of ridges and furrows in small overlapped blocks in a fingerprint image. It is extracted initially as a set of 8-direction components through the Gabor filter bank. The discontinuous distribution of directions is smoothed to a continuous one and visualized as a direction image. Then the center of the distribution is selected as a reference point. A feature vector is composed of 192 sine values of the ridge angles at 32-equiangular positions with 6 different distances from the reference point in the direction image. Experiments show that the proposed algorithm performs the same level of correct identification as a conventional algorithm does, while speeding up the overall processing significantly by reducing the length of the feature vector.

• The Journal of the Korea Contents Association
• /
• v.9 no.12
• /
• pp.19-30
• /
• 2009

The service that has recently come into the spotlight utilizes the map to first approach the map and then provide various mash-up formed results through the interface. This service can provide precise information to the users but the map is barely reusable. The sketch-map system of this paper, unlike the existing large map system, uses the method of presenting the specific spot and route in XML document and then clustering among sketch-maps. The map service system is designed to show the optimum route to the destination in a simple outline map. It is done by renovating the spot presented by the map into optimum contents. This service system, through the process of analyzing, splitting and clustering of the sketch-map's XML document input, creates a valid form of a sketch-map. It uses the LCS(Longest Common Subsequence) algorithm for splitting and merging sketch-map in the process of query. In addition, the simulation of this system's expected effects is provided. It shows how the maps that share information and knowledge assemble to form a large map and thus presents the system's ability and role as a new research portal.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.6 s.38
• /
• pp.153-166
• /
• 2005

Existing single cache structure has shown difference of hit-ratio according to individually replacement strategy However. It needs new improved cache structure for reducing network traffic and providing advanced hit-ratio. Therefore, this Paper design push agent model using dual cache for increasing hit-ratio by reducing server overload and network traffic by repetition request of persistent and identical information. In this model proposes dual cache structure to do achievement replace gradual cache using by two caches storage space for reducing server overload and network traffic. Also, we show new cache replace techniques and algorithms which executes data update and delete based on replace strategy of Log(Size) +LRU, LFU and PLC for effectiveness of data search in cache. And through an experiment, it evaluates Performance of dual cache push agent model.

• Journal of Digital Convergence
• /
• v.13 no.6
• /
• pp.157-164
• /
• 2015

An efficient retrieval of useful information is a prerequisite of an optimal decision making system. Hence, A research of data mining techniques finding useful patterns from the various forms of data has been progressed with the increase of the application of Big Data for convergence and integration with other industries. Each technique is more likely to have its drawback so that the generalization of retrieving useful information is weak. Another integrated technique is essential for retrieving useful information. In this paper, a uncertainty measure of information is calculated such that algebraic probability is measured by Bayesian theory and then information entropy of the probability is measured. The proposed measure generates the effective reduct set (i.e., reduced set of necessary attributes) and formulating the core of the attribute set. Hence, the optimal decision rules are induced. Through simulation deciding contact lenses, the proposed approach is compared with the equivalence and value-reduct theories. As the result, the proposed is more general than the previous theories in useful decision-making.

• Proceedings of the Korean Society of Medical Physics Conference
• /
• 2003.09a
• /
• pp.81-81
• /
• 2003

목적 : 현재, 많은 병원이 방사선과 의료영상정보를 기존의 필름형태로 판독하고, 진료하는 방식에서 PACS 를 도입하여 디지털 형태로 영상을 전송, 저장, 검색, 판독하는 환경으로 변화하고 있다. 한편, PACS 가 가지는 가장 큰 제한점은 휴대성의 결핍이다. 본 연구는 이동형 장치가 가지는 호스트의 이동성 및 휴대성의 장점들을 살리면서, 무선 채널 용량의 한계, 무선 링크 사용이라는 제약점들을 감안하여 의료영상을 JPEG2000 영상압축 방식으로 부호화한 후 무선 환경을 고려한 전송 패킷의 크기를 결정하고자 하였으며, 무선 통신 중 발생되는 패킷 손실에 대응하기 위한 자동 오류 수정 기능도 함께 구현하고자하였다. 방법 : Window 2000 운영체계에서 의료영상을 로드하고, 데이터베이스화하며, 저장하고, 다른 네트워크와 접속, 제어가 가능한 PC급 서버를 구축하였다. 영상데이터는 무선망을 통해 전송하기 때문에 가장 높은 압축비율을 지원하면서 에너지 밀도가 높은 JPEG2000 알고리즘을 사용하여 영상을 압축하였다. 또한, 무선망 사용으로 인한 패킷 손실에 대비하여, 영상을 JPEG2000 방식으로 부호화한 후 각 블록단위로 전송하였다. 결과 : PDA에서 JPEG2000 영상을 복호화 하는데 걸리는 시간은 256$\times$256 크기의 MR 뇌영상의 경우 바로 확인할 수 있었지만, 800$\times$790 크기의 CR 흉부 영상의 경우 약 5 초 정도의 시간이 걸렸다. CDMA 1X(Code Division Multiple Access 1st Generation) 모듈을 사용하여 영상을 전송하는 경우, 256 byte/see 정도에서는 안정된 전송 결과를 보여주었고, 1 Kbyte/see 정도의 전송의 경우 중간 중간에 패킷이 손실되는 결과를 관찰할 수 있었다. 반면 무선 랜의 경우 이보다 더 큰 패킷을 전송하더라도 문제점은 발견되지 않았다. 결론 : 현재의 PACS는 유선과 무선사이의 인터페이스의 부재로 인해 유무선 연동이 되지 못하고 있다. 따라서 이동형 JPEG2000 영상 뷰어는 PACS가 가지는 문제점인 휴대성을 보완하기 위하여 개발되었다. 또한 무선망이 가지는 데이터 손실에 대하여서도 허용할 수 있는 범위에서 재전송을 가능하게 함으로서 약한 연결성을 보완하였다. 본 JPEG2000 영상 뷰어 시스템은 기존 유선상의 PACS와 이동형 장치간에 유기적인 인터페이스 역할을 하리라 기대된다.

• The KIPS Transactions:PartC
• /
• v.17C no.5
• /
• pp.433-440
• /
• 2010

Energy efficiency, low latency and scalability for wireless sensor networks are important requirements, especially, the wireless sensor network consist of a large number of sensor nodes should be minimized energy consumption of each node to extend network lifetime with limited battery power. An efficient algorithm and energy management technology for minimizing the energy consumption at each sensor node is also required to improve transfer rate. Thus, this paper propose no-overlap multi-pass protocol provides for sensor data transmission in the wireless sensor network environment. The proposed scheme should minimize network overhead through reduced a sensor data translation use to searched multi-path and added the multi-path in routing table. Proposed routing protocol may minimize the energy consumption at each node, thus prolong the lifetime of the sensor network regardless of where the sink node is located outside or inside the received signal strength range. To verify propriety proposed scheme constructs sensor networks adapt to current model using the real data and evaluate consumption of total energy.

• 한국HCI학회:학술대회논문집
• /
• 2006.02a
• /
• pp.711-716
• /
• 2006

Since the introduction of digital camera to the mass market, the number of digital photos owned by an individual is growing at an alarming rate. This phenomenon naturally leads to the issues of difficulties while searching and browsing in the personal digital photo archive. Traditional approach typically involves content-based image retrieval using computer vision algorithms. However, due to the performance limitations of these algorithms, at least on the casual digital photos taken by non-professional photographers, more recent approaches are centered on time-based clustering algorithms, analyzing the shot times of photos. These time-based clustering algorithms are based on the insight that when these photos are clustered according to the shot-time similarity, we have "event clusters" that will help the user browse through her photo archive. It is also reported that one of the remaining problems with the time-based approach is that people perceive events in different scales. In this paper, we present an adaptive time-based clustering algorithm that exploits the usage history of digital photos in order to infer the user's preference on the event granularity. Experiments show significant performance improvements in the clustering accuracy.

• Journal of Navigation and Port Research
• /
• v.29 no.3 s.99
• /
• pp.221-226
• /
• 2005

This paper provides a method to implement IT system for supply chain management problem The fundamental scheduling issues that arise in the pickup delivery system are optimizing the system with the minimum cost, the maximum throughput and the service level. This study is concerned with the development of the customer responsive pickup-delivery system based on e-logistics and demand chain management. Through this study, the pickup-delivery problem of the vehicle using the GIS PDP and GUI- type computer programs are formulated. The computational results show that the proposed method is very effective on a set of test problems.

• The KIPS Transactions:PartD
• /
• v.8D no.2
• /
• pp.105-116
• /
• 2001

Moving objects are spatiotemporal data that location and shape of spatial objects are changed continuously over time. If spatiotemporal moving objects are managed by conventional database system, moving objects management systems have two problems as follows. First, update for location information changed over time is occurred frequently. Second, past and future information of moving objects are not provided by system because only current state of objects is stored in the system. Therefore, in this paper, we propose a spatiotemporal moving objects management system which is able to not only manage historical information of moving objects without frequent update, but also provide all location information about past, current, and near future. In the proposed system, information of moving objects are divided into location information for representing location and motion information for representing moving habits. Especially, we propose the method which can search location information all objects by use of changing process algorithms with minimum history information. Finally, we applied the proposed method to battlefield analysis system, as the result of experiment, we knew that past, current, and near future location information for moving objects are managed by relational database and GIS system.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.427-438
• /
• 2003

In a data warehouse, users typically search for trends, patterns, or unusual data behaviors by issuing queries interactively. The OLAP range-sum query is widely used in finding trends and in discovering relationships among attributes in the data warehouse. In a recent environment of enterprises, data elements in a data cube are frequently changed. The problem is that the cost of updating a prefix sum cube is very high. In this paper, we propose a novel algorithm which reduces the update cost significantly by an index structure called the Δ-tree. Also, we propose a hybrid method to provide either approximate or precise results to reduce the overall cost of queries. It is highly beneficial for various applications that need quick approximate answers rather than time consuming accurate ones, such as decision support systems. An extensive experiment shows that our method performs very efficiently on diverse dimensionalities, compared to other methods.