• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2486-2491
• /
• 2003

This paper presents a method to segment object ID marks on poor quality images under uncontrolled lighting conditions of FA inspection process. The method is based on multiple templates and normalized gray-level correlation (NGC) method. We propose a multiple template method, called as ATM (Active Template Model) which uses combinational relation of multiple templates from model templates to match and segment several characters of the inspection images. Conventional Snakes algorithm provides a good methodology to model the functional of ATM. To increase the computation speed to segment the ID mark regions, we introduce the Dynamic Programming based algorithm. Experimental results using images from real FA environment are presented.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.8
• /
• pp.119-128
• /
• 1994

In this paper we propose a new method for the recognition of 2-D partially occluded objects. The border of the object is transformed to a curve in arc length-accumulated interior angle plane. The transformed curve of an image is partitioned so that each segment is bounded by the concave interior angles. In order to tolerate shape distortion due to the polygonal approximation of the boundary of the object a group of feature points of the input image are matched with those of model views. The estimation method for positions and orientations of the identified objects objects is presented.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.8
• /
• pp.726-733
• /
• 2004

This paper presents a method to segment object ID(identification) marks on poor quality images under uncontrolled lighting conditions of automated inspection process. The method is based on dynamic programming using multiple templates and normalized gray-level correlation (NGC) method. If the lighting condition is not good and hence, we can not control the image quality, target image to be inspected presents poor quality ID marks and it is not easy to identify and recognize the ID characters. Conventional several methods to segment the interesting ID mark regions fail on the bad quality images. In this paper, we propose a multiple template method, which uses combinational relation of multiple templates from model templates to match several characters of the inspection images. To increase the computation speed to segment the ID mark regions, we introduce the dynamic programming based algorithm. Experimental results using images from real factory automation(FA) environment are presented.

• Proceedings of the KSRS Conference
• /
• 2006.03a
• /
• pp.307-310
• /
• 2006

고해상도(VHR, Very High Resolution) 영상은 활용에 따라 도심의 다양한 정보를 얻을 수 있는 잠재적 가치가 매우 큰 자료이다. 그러나 이러한 고해상도 영상자료는 매우 높은 공간해상력으로 인해 같은 용도의 객체 혹은 같은 객체(예, 건물)라 할지라도 다양한 분광 특성 및 형태로 표현된다. 그러므로 이러한 고해상도영상을 이용하여 효과적으로 주제도를 생성하기 위해서는 현재까지 영상분류 분야에서 주로 활용되고 있는 화소(pixel)단위 기반의 분석방법으로는 한계가 존재한다. 본 연구에서는 이러한 문제점을 보완하기 위한 방법으로 활발한 연구가 진행되고 있는 세그멘트(segment) 혹은 객체(object) 기반 분류기법을 고해상도 영상 및 라이다 자료에 적용하여 도심지역의 건물들을 추출해 보았으며, 그 활용 가능성에 대하여 판단해 보았다. 이러한 세그멘트 기법은 분류하고자 하는 객체들을 하나의 동일한 특성을 가지는 집단으로 모으는 방법을 말하는데, 이를 위해 본 연구에서는 multi-resolution image segmentation기법을 제공해주는 eCognition이라는 소프트웨어를 이용하였다.

• Journal of Broadcast Engineering
• /
• v.21 no.5
• /
• pp.782-791
• /
• 2016

The object segmentation algorithm from the background could be used for object recognition and tracking, and many applications. To segment objects, this paper proposes a method that refer to several initial frames with real-time processing at fixed camera. First we suggest the probability model to segment object and background and we enhance the performance of algorithm analyzing the color consistency and focus characteristic of camera for several initial frames. We compensate the segmentation result by using human skeleton characteristic among extracted objects. Last the proposed method has the applicability for various mobile application as we minimize computing complexity for real-time video processing.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.19 no.3
• /
• pp.19-27
• /
• 1982

Minimization of total routing and number of cuts has been adopted for the placement problem in LSI and printed wire board as the object function, recently. Although it is considered that in the general situation this object function reflects the final goal which is wiring of 100% of layout, it often seems to be insufficient because it does not exhibit partial wire congestion. This paper introduces a new concept called the wire congestion of segestion to get the partial wire congestion and proposes the object function to minimize the wire congestion of segmests. In order to optimize this object function, an effective heuristic algorithm is also suggestsl Experimental results show that this algorithm sustains its efficiency. The experimental consequences point out that if the total routing length is short, maximum wire congestion of segment is small and vice versa. Therefore control parameter, that is, congestion parameter, which mintnizes total length and concurrently reduces maximal wire congestion of segment, is obtained by experiment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2320-2334
• /
• 1999

In this paper, we propose multiple IS-MMBS service schemes for very low power and micro-size RMIMS (radio-interfaced micro information monitoring system) terminals. In MMBS service area, when new arrival RMIMS terminals have real-time traffic characteristic or large traffic bandwidth, only single IS-MMBS service scheme can not guarantee RMIMS terminal's QoS(quality of service) such as buffer overflow or packet loss. In this case, the proposed multiple IS-MMBS service schemes can be effectively used for QoS service of RMIMS terminal. According to clustering method of RMIMS terminals and MMBS segment method, the proposed schemes can be divided into terminal segment method, region segment method, application based segment method, traffic type based segment method, overlapping segment method and hybrid segment method

• Journal of Digital Convergence
• /
• v.17 no.9
• /
• pp.153-161
• /
• 2019

Discrimination of media object segments in wireless home proxies has a significant impact on caching delay, and caching delay degrades the performance of the proxy. In this paper, we propose a Single Fetching Smart Caching (SFSC) strategy and a Multi-Fetching Smart Caching (MFSC) strategy to improve the proxy performance of the home network and improve the caching performance for media object segments. The SFSC strategy is a technique that performs caching by sequential fetching of object segments requested by the home node one at a time, which guarantees a faster cache hit rate, and the MFSC strategy is a technique that caches the media object segments by blocking object segments requested by the home node one at a time, which improves the throughput of cache. Simulation results show that the cache hit rate and the caching delay are more efficient than the MFSC technique, and the throughput of the object segment is more efficient than that of the SFSC technique.

• Journal of Korea Multimedia Society
• /
• v.7 no.9
• /
• pp.1240-1245
• /
• 2004

This paper presents the moving objects segmentation algorithms from the sequence images in the stationary backgrounds such as surveillance camera and video phone and so on. In this paper, the moving object area is extracted with proposed object searching algorithm and then moving object is segmented within the moving object area. Also the proposed algorithms have the robustness against noise problems and results show the proposed algorithm is able to efficiently segment and track the moving object area.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.851-867
• /
• 1999

Numerous proposals for extending the relational data model as well as conceptual and object-oriented data models have been suggested. However, there has been relatively less research in the area of defining segmented storage structure and data migration strategies for temporal data. This paper presents the segmented storage structure in order to increment search performance and the two data migration strategies for segmented storage structure. this paper presents the two data migration strategies : the migration strategy by Time granularity, the migration strategy by LST-GET. In the migration strategy by Time Granularity, the dividing time point to assign the entity versions to the past segment, the current segment, and future segment is defined and the searching and moving process for data validity at a granularity level are described. In the migration strategy by LST-GET, we describe the process how to compute the value of dividing criterion. searching and moving processes are described for migration on the future segment and the current segment and entity versions 새 assign on each segment are defined. We simulate the search performance of the segmented storage structure in order to compare it with conventional storage structure in relational database system. And extensive simulation studies are performed in order to compare the search performance of the migration strategies with the segmented storage structure.