• Journal of Korea Multimedia Society
• /
• v.15 no.2
• /
• pp.204-214
• /
• 2012

This paper proposes an image segmentation for a vision-based automated defect inspection system on surface image of TFT-LCD(Thin Film Transistor Liquid Crystal Display) panels. TFT-LCD images have non-uniform brightness, which is hard to finding defective regions. Although there are several methods or proposed algorithms, it is difficult to divide the defect with high reliability because of non-uniform properties in the image. Kamel and Zhao disclosed a method which based on logical stage algorithm for segmentation of graphics and character. This method is a one of the local segmentation method that has a advantage. It is that characters and graphics are well segmented in an image which has non-uniform property. As TFT-LCD panel image has a same property, so this paper proposes new algorithm to segment regions of defects based on Kamel and Zhao's algorithm. Our algorithm has an advantage that there are a few ghost objects around the defects. We had experiments to prove performance in real TFT-LCD panel images, and comparing with the FFT(Fast Fourier Transform) method which is used a bandpass filter.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.30 no.1
• /
• pp.1-10
• /
• 2012

Recent spatial information technology has brought innovative improvement in both efficiency and accuracy. Especially, airborne LiDAR system(ALS) is one of the practical sensors to obtain 3D spatial information. Constructing reliable 3D spatial data infrastructure is world wide issue and most of the significant tasks involved with modeling manmade objects. This study aims to create a test data set for developing automatic building modeling methods by simulating point cloud data. The data simulates various roof types including gable, pyramid, dome, and combined polyhedron shapes. In this study, a robust bottom-up method to segment surface patches was proposed for generating building models automatically by determining model key points of the objects. The results show that building roofs composed of the segmented patches could be modeled by appropriate mathematical functions and the model key points. Thus, 3D digitizing man made objects could be automated for digital mapping purpose.

• The KIPS Transactions:PartB
• /
• v.9B no.3
• /
• pp.327-336
• /
• 2002

Texture analysis is an important technique in many image understanding areas, such as perception of surface, object, shape and depth. But the previous works are intend to the issue of only texture segment, that is not capable of acquiring recognition information. No unsupervised method is basased on the recognition of texture in image. we propose a novel approach for efficient texture image analysis that uses unsupervised learning schemes for the texture recognition. The self-organization neural network for multiple texture image identification is based on block-based clustering and merging. The texture features used are the angle and magnitude in orientation-field that might be different from the sample textures. In order to show the performance of the proposed system, After we have attempted to build a various texture images. The final segmentation is achieved by using efficient edge detection algorithm applying to block-based dilation. The experimental results show that the performance of the system Is very successful.

• The KIPS Transactions:PartB
• /
• v.11B no.6
• /
• pp.691-700
• /
• 2004

This paper proposes a user's mobility based cooperative proxy caching policy for effective resource management of continuous media objects in mobile environments. This policy is different from the existing proxy caching policies in terms of how to exploit users' mobility. In other words, existing caching policies work based on the information about objects by referring to user's requests within a specified domain whereas the proposed caching policy runs by utilizing a number of user's requests across several domains. So, the proposed policy is applicable to random requests in mobile environments Moreover, we also propose a replacement policy based on weights and playback time. To check the efficiency of the proposed caching policy, the proposed replacement policy is run with different size of caching unit object or segment. The result of performance analyze tells what a ratio of user's mobility is are major factors for the efficient operation of the cooperative caching.

• Journal of Korea Multimedia Society
• /
• v.17 no.2
• /
• pp.132-142
• /
• 2014

Stereo camera is drawing attention as an essential sensor for future intelligence robot system since it has the advantage of acquiring not only distance but also other additive information for an object. However, it cannot match correlated point on target image for low textured region or periodic patterned region such as wall of building or room. In this paper, we propose a stereo matching technique that increase the matching performance by fusing belief propagation stereo matching algorithm and local distance measurements of 2D-laser range finder in order to overcome this kind of limitation. The proposed technique adds laser measurements by referring quad-tree based segment information on to the local-evidence of belief propagation stereo matching algorithm, and calculates compatibility function by reflecting over-segmented information. Experimental results of the proposed method using simulation and real test images show that the distance information for some low textured region can be acquired and the discontinuity of depth information is preserved by using segmentation information.

• The KIPS Transactions:PartB
• /
• v.17B no.5
• /
• pp.355-362
• /
• 2010

Face tracking is to estimate the motion of a non-rigid face together with a rigid head in 3D, and plays important roles in higher levels such as face/facial expression/emotion recognition. In this paper, we propose an AAM-based face tracking algorithm. AAM has been widely used to segment and track deformable objects, but there are still many difficulties. Particularly, it often tends to diverge or converge into local minima when a target object is self-occluded, partially or completely occluded. To address this problem, we utilize the scale invariant feature transform (SIFT). SIFT is an effective method for self and partial occlusion because it is able to find correspondence between feature points under partial loss. And it enables an AAM to continue to track without re-initialization in complete occlusions thanks to the good performance of global matching. We also register and use the SIFT features extracted from multi-view face images during tracking to effectively track a face across large pose changes. Our proposed algorithm is validated by comparing other algorithms under the above 3 kinds of occlusions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.3
• /
• pp.385-396
• /
• 1993

In this paper, a improved method of digital image analysis required in basic medical science for diagnosis of cells was proposed. The object image was the thyroid gland cell image, and the purpose was automatic discrimination of three classes cells(normal cell, follicular neoplastic cells, and papillary neoplastic cells) by difference of chromatin patterns. To segment the cell nucleus from background, the region segmentation algorithm by edge tracing was proposed. And feature parameter was obtained from discrete Fourier transformation of image. After construct a feature sample group of each cells, experiment of discrimination was executed with any verification cells. As a consequency of using features proposed in this paper, get a better recognition rate(70-90%) than previously reported papers, and this method give shape to get objectivity and fixed quantity in diagnosis of cells, The methods described in this paper be used immediately for discrimination of neoplastic cells.

• The KIPS Transactions:PartD
• /
• v.13D no.7 s.110
• /
• pp.879-888
• /
• 2006

Recently many researchers have focused on management of Historical trajectories of moving objects in Euclidean spaces due to numerous sizes of accumulated data over time. However, the movement of moving objects in real applications generally has some constraints, for example vehicles on roads can only travel along connected road networks. In this paper, we propose an indexing method for trajectories of moving objects on road networks in order to process the network-based spatiotemporal range query. Our method contains the connect information of road networks to use the network distance for query processing, deals with trajectories which are represented by road segments in road networks, and manages them using multiple R-trees assigned per each road segment. Furthermore, it has a structure to be able to share R-tree among several road segments in large road networks. Consequently, we show that our method takes about 30% less in node accesses for the network-based spatiotemporal range query processing than other methods based on the Euclidean distance by experiments.

• Journal of Internet Computing and Services
• /
• v.18 no.2
• /
• pp.113-121
• /
• 2017

As the industrial structure of the mobile telecommunications market is transforming into the ICT ecosystem centered on smartphones, the regulatory system conforming to the new ICT environment has become the main subject of discussion in key developed countries. The EU segmented the mobile phone service into wholesale and retail. Simultaneously, the EU appraised mobile telecommunication carriers' market domination in segmented markets to continuously improve the scheme to promote competition in the telecommunications market. In Korea, also, there is discussion about adopting the EU scheme to segment the mobile phone market definition more finely and taking measures to appraise the market domination in accordance with object appraisal criteria. As such, this study analyzes whether the current criteria for appraising the wholesale termination rate market domination under the ICT's domestic mobile telecommunication ecosystem is adequate and presents the rational improvement measures reflecting the theoretically suggested evaluation factors.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.1
• /
• pp.40-47
• /
• 2009

Recently, dynamic proxy caching has been proposed on the distributed environment so that media objects by user's requests can be served directly from the proxy without contacting the server. However, it makes caching challenging due to multimedia large sizes, low latency and continuous streaming demands of media objects. To solve the problems caused by streaming demands of media objects, this paper has been proposed the grouping scheme with fuzzy filtering based on partition and mapping. For partition and mapping, this paper divides media block segments into fixed partition reference block(R$_f$P) and variable partition reference block(R$_v$P). For semantic relationship, it makes fuzzy relationship to performs according to the fixed partition temporal synchronization(T$_f$) and variable partition temporal synchronization(T$_v$). Simulation results show that the proposed scheme makes streaming service efficiently with a high average request response time rate and cache hit rate and with a low delayed startup ratio compared with other schemes.