• Journal of the Korea Society of Computer and Information
• /
• v.19 no.10
• /
• pp.63-70
• /
• 2014

Process of recognizing objects in binary images consists of image segmentation and pattern matching. If binary objects in the image are assumed to be separated, global features such as area, length of perimeter, or the ratio of the two can be used to recognize the objects in the image. However, if such an assumption is not valid, the global features can not be used but local features such as points or line segments should be used to recognize the objects. In this paper points with large curvature along the perimeter are chosen to be the feature points, and pairs of points selected from them are used as local features. Similarity of two local features are defined using elastic deformation energy for making the lengths and angles between gradient vectors at the end points same. Neighbour support value is defined and used for robust recognition of partially occluded binary objects. An experiment on Kimia-25 data showed that the proposed algorithm runs 4.5 times faster than the maximum clique algorithm with same recognition rate.

• Journal of the Korean earth science society
• /
• v.38 no.7
• /
• pp.535-545
• /
• 2017

Maritime accidents around the Korean Peninsula are increasing, and the ship detection research using remote sensing data is consequently becoming increasingly important. This study presented a new ship detection algorithm using hyperspectral images that provide the spectral information of several hundred channels in the ship detection field, which depends on high resolution optical imagery. We applied a spectral matching algorithm between the reflection spectrum of the ship deck obtained from two field observations and the ship and seawater spectrum of the hyperspectral sensor of an airborne visible/infrared imaging spectrometer. A total of five detection algorithms were used, namely spectral distance similarity (SDS), spectral correlation similarity (SCS), spectral similarity value (SSV), spectral angle mapper (SAM), and spectral information divergence (SID). SDS showed an error in the detection of seawater inside the ship, and SAM showed a clear classification result with a difference between ship and seawater of approximately 1.8 times. Additionally, the present study classified the vessels included in hyperspectral images by presenting the adaptive thresholds of each technique. As a result, SAM and SID showed superior ship detection abilities compared to those of other detection algorithms.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.10a
• /
• pp.12-19
• /
• 1993

In general, the line balancing problem is defined as of finding an assignment of the given jobs to the workstations under the precedence constraints given to the set of jobs. Usually, the objective is either minimizing the cycle time under the given number of workstations or minimizing the number of workstations under the given cycle time. In this paper, we present a new type of an assembly line balancing problem which occurs in an electronics company manufacturing home appliances. The main difference of the problem compared to the general line balancing problem lies in the structure of the precedence given to the set of jobs. In the problem, the set of jobs is partitioned into two disjoint subjects. One is called the set of fixed jobs and the other, the set of floating jobs. The fixed jobs should be processed in the linear order and some pair of the jobs should not be assigned to the same workstations. Whereas, to each floating job, a set of ranges is given. The range is given in terms of two fixed jobs and it means that the floating job can be processed after the first job is processed and before the second job is processed. There can be more than one range associated to a floating job. We present a procedure to find an approximate solution to the problem. The procedure consists of two major parts. One is to find the assignment of the floating jobs under the given (feasible) assignment of the fixed jobs. The problem can be viewed as a constrained bin packing problem. The other is to find the assignment of the whole jobs under the given linear precedence on the set of the floating jobs. First problem is NP-hard and we devise a heuristic procedure to the problem based on the transportation problem and matching problem. The second problem can be solved in polynomial time by the shortest path method. The algorithm works in iterative manner. One step is composed of two phases. In the first phase, we solve the constrained bin packing problem. In the second phase, the shortest path problem is solved using the phase 1 result. The result of the phase 2 is used as an input to the phase 1 problem at the next step. We test the proposed algorithm on the set of real data found in the washing machine assembly line.

• Journal of the Korea Computer Graphics Society
• /
• v.12 no.4
• /
• pp.23-32
• /
• 2006

In recent years, since the digital camera has been popularized, so users can easily collect hundreds of photos in a single usage. Thus the managing of hundreds of digital photos is not a simple job comparing to the keeping paper photos. We know that managing and classifying a number of digital photo files are burdensome and annoying sometimes. So people hope to use an automated system for managing digital photos especially for their own purposes. The previous studies, e.g. content-based image retrieval, were focused on the clustering of general images, which it is not to be applied on digital photo clustering and classification. Recently, some specialized clustering algorithms for images clustering digital camera images were proposed. These algorithms exploit mainly the statistics of time gap between sequent photos. Though they showed a quite good result in image clustering for digital cameras, still lots of improvements are remained and unsolved. For example the current tools ignore completely the image transformation with the different focal lengths. In this paper, we present a photo considering focal length information recorded in EXIF. We propose an algorithms based on MVA(Matching Vector Analysis) for classification of digital images taken in the every day activity. Our experiment shows that our algorithm gives more than 95% success rates, which is competitive among all available methods in terms of sensitivity, specificity and flexibility.

• Journal of Bio-Environment Control
• /
• v.24 no.3
• /
• pp.210-216
• /
• 2015

Purpose of this study was a development of an image processing algorithm to recognize paprika and acquire it's 3D coordinates from stereo images to precisely control an end-effector of a paprika auto harvester. First, H and S threshold was set using HSI histogram analyze for extracting ROI(region of interest) from raw paprika cultivation images. Next, fundamental matrix of a stereo camera system was calculated to process matching between extracted ROI of corresponding images. Epipolar lines were acquired using F matrix, and $11{\times}11$ mask was used to compare pixels on the line. Distance between extracted corresponding points were calibrated using 3D coordinates of a calibration board. Non linear regression analyze was used to prove relation between each pixel disparity of corresponding points and depth(Z). Finally, the program could calculate horizontal(X), vertical(Y) directional coordinates using stereo camera's geometry. Horizontal directional coordinate's average error was 5.3mm, vertical was 18.8mm, depth was 5.4mm. Most of the error was occurred at 400~450mm of depth and distorted regions of image.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.7
• /
• pp.734-740
• /
• 2017

A frame rate up-conversion scheme is needed when moving pictures with a low frame rate is played on appliances with a high frame rate. Frame rate up-conversion methods interpolate the frame with two consecutive frames of the original source. This can be divided into the frame repetition method and motion estimation-based the frame interpolation one. Frame repetition has very low complexity, but it can yield jerky artifacts. The interpolation method based on a motion estimation and compensation can be divided into pixel or block interpolation methods. In the case of pixel interpolation, the interpolated frame was classified into four areas, which were interpolated using different methods. The block interpolation method has relatively low complexity, but it can yield blocking artifacts. The proposed method is the frame rate up-conversion method based on a block motion estimation and compensation using the linearity of motion. This method uses two previous frames and one next frame for motion estimation and compensation. The simulation results show that the proposed algorithm effectively enhances the objective quality, particularly in a high resolution image. In addition, the proposed method has similar or higher subjective quality than other conventional approaches.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.3 s.357
• /
• pp.33-40
• /
• 2007

In this paper, low-rate TCP attack as one of shrew attacks is considered and the scaling based dynamic time warping (S-DTW) algorithm is introduced. The low-rate TCP attack can not be detected by the detection method for the previous flooding DoS/DDoS (Denial of Service/Distirbuted Denial of Service) attacks due to its low average traffic rate. It, however, is a periodic short burst that exploits the homogeneity of the minimum retransmission timeout (RTO) of TCP flows and then some pattern matching mechanisms have been proposed to detect it among legitimate input flows. A DTW mechanism as one of detection approaches has proposed to detect attack input stream consisting of many legitimate or attack flows, and shown a depending method as well. This approach, however, has a problem that legitimate input stream may be caught as an attack one. In addition, it is difficult to decide a threshold for separation between the legitimate and the malicious. Thus, the causes of this problem are analyzed through simulation and the scaling by maximum auto-correlation value is executed before computing the DTW. We also discuss the results on applying various scaling approaches and using standard deviation of input streams monitored.

• Journal of Korean Society of Transportation
• /
• v.22 no.7 s.78
• /
• pp.7-16
• /
• 2004

The homogeneous road section is defined as one consisted of similar traffic characteristics focused on demand and supply. The criteria, in the aspect of demand, are the diverging rate and the ratio of green time to cycle time at signalized intersection, and distance between the signalized intersections. The criteria, in that or supply, are the traffic patterns such as traffic volume and its speed. In this study, the effective method to generate valuable data, pointing out the problems of removal method of obscure data, is proposed using data collected from Gonjiam IC to Jangji IC on the national highway No.3. Travel times are collected with licence matching method and traffic volume and speed are collected from detectors. Futhermore, the method of selecting homogeneous road section is proposed considering demand and supply aspect simultaneously. This method using outlier filtering algorithm can be applied to generate the travel time forecasting model and to revise the obscured of missing data transmitting from detectors. The point and link data collected at the same time on the rational highway can be used as a basis predicting the travel time and revising the obscured data in the future.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.6
• /
• pp.170-178
• /
• 2008

A high performance object recognition algorithm using Fourier description of the 3D information of the objects is proposed. Object boundaries contain sufficient information for recognition in most of objects. However, it is not well utilized as the key solution of the object recognition since obtaining the accurate boundary information is not easy. Also, object boundaries vary highly depending on the size or orientation of object. The proposed object recognition algorithm is based on 1) the accurate object boundaries extracted from the 3D shape which is obtained by the laser scan device, and 2) reduction of the required database using the size and rotational invariant feature of the Fourier Descriptor. Such Fourier information is compared with the database and the recognition is done by selecting the best matching object. The experiments have been done on the rich database of MPEG 7 Part B.

• Journal of KIISE:Software and Applications
• /
• v.35 no.1
• /
• pp.1-11
• /
• 2008

This paper detected the characteristics of motion vector to support efficient content -based video search of video. Traditionally, the present frame of a video was divided into blocks of equal size and BMA (block matching algorithm) was used, which predicts the motion of each block in the reference frame on the time axis. However, BMA has several restrictions and vectors obtained by BMA are sometimes different from actual motions. To solve this problem, the foil search method was applied but this method is disadvantageous in that it has to make a large volume of calculation. Thus, as an alternative, the present study extracted the Spatio-Temporal characteristics of Motion Vector Spatio-Temporal Correlations (MVSTC). As a result, we could predict motion vectors more accurately using the motion vectors of neighboring blocks. However, because there are multiple reference block vectors, such additional information should be sent to the receiving end. Thus, we need to consider how to predict the motion characteristics of each block and how to define the appropriate scope of search. Based on the proposed algorithm, we examined motion prediction techniques for motion compensation and presented results of applying the techniques.