• Journal of Digital Contents Society
• /
• v.7 no.1
• /
• pp.67-74
• /
• 2006

In current video-conferencing systems. user's face movements are restricted by fixed camera, therefore it is inconvenient to users. To solve this problem, tracking of face movements is needed. Tracking using whole face needs much computing time and whole face is difficult to define as an one feature. Thus, using several feature points in face is more desirable to track face movements efficiently. This paper addresses an effective eye location algorithm which is essential process of automatic human face tracking system for natural video-conferencing. The location of eye is very important information for face tracking, as eye has most clear and simplest attribute in face. The proposed algorithm is applied to candidate face regions from the face region extraction. It is not sensitive to lighting conditions and has no restriction on face size and face with glasses. The proposed algorithm shows very encouraging results from experiments on video-conferencing environments.

• Journal of Bio-Environment Control
• /
• v.20 no.4
• /
• pp.277-282
• /
• 2011

We carried out shape recognition. We found out cucumber's feature shape by means of neural network and back propagation algorithm. We developed an algorithm which finds object position and shape in real image and we gained following conclusion as a result. It was processed for feature shape extraction of cucumber to detect automatic. The output pattern rates of the miss-detected objects was 0.1~4.2% in the output pattern which was recognized as cucumber. We were gained output pattern according to image resolution $445{\times}363$, $501{\times}391$, $450{\times}271$, $297{\times}421$. It was appeared that no change was detected. When learning pattern was increased to 25, miss-detection ratio was 16.02%, and when learning pattern had 2 pattern, it didn't detect 8 cucumber in 40 images.

• Korean Journal of Remote Sensing
• /
• v.19 no.2
• /
• pp.159-169
• /
• 2003

This paper presents a method for automatic 3-d building reconstruction using high resolution aerial imagery. First, by using edge preserving filtering, noise is eliminated and then images are segmented by watershed algorithm, which preserves location of edge pixels. To extract line segments between control points from boundary of each region, we calculate curvature of each pixel on the boundary and then find the control points. Line segment linking is performed according to direction and length of line segments and the location of line segments is adjusted using gradient magnitudes of all pixels of the line segment. Coplanar grouping and pplygonal patch formation are performed per region by selecting 3-d line segments that are matched using epipolar geometry and flight information. The algorithm has been applied to high resolution aerial images and the results show accurate 3D building reconstruction.

• Korean Journal of Remote Sensing
• /
• v.27 no.1
• /
• pp.33-41
• /
• 2011

In the information communication technology, it is world-widely apparent that trend movement from internet web to smartphone app by users demand and developers environment. So it needs kinds of appropriate technological responses from geo-spatial domain regarding this trend. However, most cases in the smartphone app are the map service and location recognition service, and uses of geo-spatial contents are somewhat on the limited level or on the prototype developing stage. In this study, app for extraction of corner point features using geo-spatial imagery and their linkage to database system are developed. Corner extraction is based on Harris algorithm, and all processing modules in database server, application server, and client interface composing app are designed and implemented based on open source. Extracted corner points are applied LOD(Level of Details) process to optimize on display panel. Additional useful function is provided that geo-spatial imagery can be superimposed with the digital map in the same area. It is expected that this app can be utilized to automatic establishment of POI (Point of Interests) or point-based land change detection purposes.

• Journal of KIISE:Software and Applications
• /
• v.34 no.12
• /
• pp.1045-1055
• /
• 2007

Latent topic models are statistical models which automatically captures salient patterns or correlation among features underlying a data collection in a probabilistic way. They are gaining an increased popularity as an effective tool in the application of automatic semantic feature extraction from text corpus, multimedia data analysis including image data, and bioinformatics. Among the important issues for the effectiveness in the application of latent topic models to the massive data set is the efficient learning of the model. The paper proposes an accelerated learning technique for PLSA model, one of the popular latent topic models, by an incremental EM algorithm instead of conventional EM algorithm. The incremental EM algorithm can be characterized by the employment of a series of partial E-steps that are performed on the corresponding subsets of the entire data collection, unlike in the conventional EM algorithm where one batch E-step is done for the whole data set. By the replacement of a single batch E-M step with a series of partial E-steps and M-steps, the inference result for the previous data subset can be directly reflected to the next inference process, which can enhance the learning speed for the entire data set. The algorithm is advantageous also in that it is guaranteed to converge to a local maximum solution and can be easily implemented just with slight modification of the existing algorithm based on the conventional EM. We present the basic application of the incremental EM algorithm to the learning of PLSA and empirically evaluate the acceleration performance with several possible data partitioning methods for the practical application. The experimental results on a real-world news data set show that the proposed approach can accomplish a meaningful enhancement of the convergence rate in the learning of latent topic model. Additionally, we present an interesting result which supports a possible synergistic effect of the combination of incremental EM algorithm with parallel computing.

• Journal of Korea Multimedia Society
• /
• v.7 no.4
• /
• pp.451-458
• /
• 2004

A leather quality inspection by naked eyes has known as unreliable because of its biological characteristics like accumulated fatigue caused from an optical illusion and biological phenomenon. Therefore it is necessary to automate the leather quality inspection by computer vision technique. In this paper, we present automatic leather qua1ity classification system get information from leather surface. Leather is usually graded by its information such as texture density, types and distribution of defects. The presented algorithm explain how we analyze leather information like texture density and defects from the gray-level images obtained by digital camera. The density data is computed by its ratio of distribution area, width, and height of Fourier spectrum magnitude. And the defect information of leather surface can be obtained by histogram distribution of pixels which is Windowed from preprocessed images. The information for entire leather could be a standard for grading leather quality. The proposed leather inspection system using machine vision can also be applied to another field to substitute human eye inspection.

• The Journal of the Korea Contents Association
• /
• v.10 no.4
• /
• pp.19-27
• /
• 2010

In recent years, high-throughput genome-wide RNA interference screening is emerging as an essential tool to biologists in understanding complex cellular processes. The manual analysis of the large number of images produced in each study spends much time and the labor. Hence, automatic cellular image analysis becomes an urgent need, where segmentation is the first and one of the most important steps. However, those factors such as the region overlapping, a variety of shapes, and non-uniform local characteristics of cellular images become obstacles to efficient cell segmentation. To avoid the problem, a new watershed-based cell segmentation algorithm using a localized segmentation method and a feature vector is proposed in this paper. Localized approach in segmentation resolves the problems caused by a variety of shapes and non-uniform characteristics. In addition, the poor performance of segmentation in overlapped regions can be improved by taking advantage of a feature vector whose component features complement each other. Simulation results show that the proposed method improves the segmentation performance compared to the method in Cellprofiler.

• Journal of KIISE
• /
• v.43 no.9
• /
• pp.983-997
• /
• 2016

Many available online product reviews for any given product makes it difficult for a consumer to locate the helpful reviews. The purpose of this study was to investigate automatic helpfulness evaluation of online product reviews according to review information types based on the target of information. The underlying assumption was that consumers find reviews containing specific information related to the product itself or the reliability of reviewers more helpful than peripheral information, such as shipping or customer service. Therefore, each sentence was categorized by given information types, which reduced the semantic space of review sentences. Subsequently, we extracted specific information from sentences by using a topic-based representation of the sentences and a clustering algorithm. Review ranking experiments indicated more effective results than other comparable approaches.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.4968-4986
• /
• 2017

In this paper, we primarily address the difficulty of automatic generation of a plausible depth map from a single image in an unstructured environment. The aim is to extrapolate a depth map with a more correct, rich, and distinct depth order, which is both quantitatively accurate as well as visually pleasing. Our technique, which is fundamentally based on a preexisting DepthTransfer algorithm, transfers depth information at the level of superpixels. This occurs within a framework that replaces a pixel basis with one of instance-based learning. A vital superpixels feature enhancing matching precision is posterior incorporation of predictive semantic labels into the depth extraction procedure. Finally, a modified Cross Bilateral Filter is leveraged to augment the final depth field. For training and evaluation, experiments were conducted using the Make3D Range Image Dataset and vividly demonstrate that this depth estimation method outperforms state-of-the-art methods for the correlation coefficient metric, mean log10 error and root mean squared error, and achieves comparable performance for the average relative error metric in both efficacy and computational efficiency. This approach can be utilized to automatically convert 2D images into stereo for 3D visualization, producing anaglyph images that are visually superior in realism and simultaneously more immersive.

• KIISE Transactions on Computing Practices
• /
• v.22 no.9
• /
• pp.419-425
• /
• 2016

In navigator systems, keeping map data up-to-date is an important task. Manual update involves a substantial cost and it is difficult to achieve immediate reflection of changes with manual updates. In this paper, we present a method for trajectory-center extraction, which is essential for automatic road map generation with GPS data. Though clustered trajectories are necessary to extract the center road, real trajectories are not clustered. To address this problem, this paper proposes a new method using the maximum overlapping interval and trajectory clustering. Finally, we apply the Virtual Running method to extract the center road from the clustered trajectories. We conducted experiments on real massive taxi GPS data sets collected throughout Gang-Nam-Gu, Sung-Nam city and all parts of Seoul city. Experimental results showed that our method is stable and efficient for extracting the center trajectory of real roads.