• KIISE Transactions on Computing Practices
• /
• v.24 no.3
• /
• pp.138-144
• /
• 2018

A video is a vivid medium similar to human's visual-linguistic experiences, since it can inculcate a sequence of situations, actions or dialogues that can be told as a story. In this study, we propose story learning/regeneration frameworks from videos with successive event order supervision for contextual coherence. The supervision induces each episode to have a form of trajectory in the latent space, which constructs a composite representation of ordering and semantics. In this study, we incorporated the use of kids videos as a training data. Some of the advantages associated with the kids videos include omnibus style, simple/explicit storyline in short, chronological narrative order, and relatively limited number of characters and spatial environments. We build the encoder-decoder structure with successive event order embedding, and train bi-directional LSTMs as sequence models considering multi-step sequence prediction. Using a series of approximately 200 episodes of kids videos named 'Pororo the Little Penguin', we give empirical results for story regeneration tasks and SEOE. In addition, each episode shows a trajectory-like shape on the latent space of the model, which gives the geometric information for the sequence models.

• The KIPS Transactions:PartB
• /
• v.19B no.1
• /
• pp.31-36
• /
• 2012

In recent years, there has been increasing interest in recommender systems which provide users with personalized suggestions for products or services. In particular, researches of collaborative filtering analyzing relations between users and items has become more active because of the Netflix Prize competition. This paper presents the reinforcement learning approach for collaborative filtering. By applying reinforcement learning techniques to the movie rating, we discovered the connection between a time sequence of past ratings and current ratings. For this, we first formulated the collaborative filtering problem as a Markov Decision Process. And then we trained the learning model which reflects the connection between the time sequence of past ratings and current ratings using Q-learning. The experimental results indicate that there is a significant effect on current ratings by the time sequence of past ratings.

• Journal of Korean Society of Transportation
• /
• v.20 no.7
• /
• pp.23-29
• /
• 2002

Five and more leg intersections have been still in operation in many urban areas. The number of conflicts in five leg intersection is more than four leg intersection. The signal timing design in the five leg intersection should be performed not only to reduce delay but also to increase safety. This paper suggests safety enhanced signal phase sequence design of a rotary with five leg intersection such as phase sequence minimizing the number of conflict points at the rotary with five leg intersections and the phase-length-design procedure by utilizing the Traffic Network Study Tool(TRANSYT). Field data was collected from Gonguptap five leg intersection in Ulsan and TRANSYT-7F was applied for signal timing design model. Optimal signal phase length and sequence of TRANSYT-7F is rearranged based on the Principal of "two moving traffic flows per phase". In conclusion, proposed signal phase design increased delay by 6.2% compared with the optimal signal phase of TRANSYT-7F. However, it could decrease the number of conflict in the five leg intersection by 61.5%.

• The Korean Journal of Applied Statistics
• /
• v.17 no.2
• /
• pp.281-301
• /
• 2004

In this paper we consider the change point problem in a sequence of univariate normal observations. We want to know whether there is any change point or not. In case a change point exists, we will identify its change type. Namely, it can be a mean change, a variance change, or both the mean and variance change. The intrinsic Bayes factors of Berger and Pericchi (1996, 1998) are used to find the type of optimal change model. The Gibbs sampling including the Metropolis-Hastings algorithm is used to estimate all the parameters in the change model. These methods are checked via simulation and applied to the winter average temperature data in Seoul.

• Journal of the Korea Society for Simulation
• /
• v.32 no.3
• /
• pp.43-53
• /
• 2023

In this detailed and comprehensive study, our primary focus has been placed on accurately gauging the number of visitors and their real-time locations in commercial spaces. Particularly, in a real cafe, using security cameras, we have developed a system that can offer live updates on available seating and predict future congestion levels. By employing YOLO, a real-time object detection and tracking algorithm, the number of visitors and their respective locations in real-time are also monitored. This information is then used to update a cafe's indoor map, thereby enabling users to easily identify available seating. Moreover, we developed a model that predicts the congestion of a cafe in real time. The sophisticated model, designed to learn visitor count and movement patterns over diverse time intervals, is based on Long Short Term Memory (LSTM) to address the vanishing gradient problem and Sequence-to-Sequence (Seq2Seq) for processing data with temporal relationships. This innovative system has the potential to significantly improve cafe management efficiency and customer satisfaction by delivering reliable predictions of cafe congestion to all users. Our groundbreaking research not only demonstrates the effectiveness and utility of indoor location tracking technology implemented through security cameras but also proposes potential applications in other commercial spaces.

• Korean Management Science Review
• /
• v.13 no.2
• /
• pp.25-48
• /
• 1996

Mixed Model Assembly Lines (MMALs) are increasingly used to produce differentiated products on a single assembly line without work-in-process storage, Usually, a typical MMAL consists of a number of (1) stations doing exactly the same operation on every job, (2) stations involving operations with different choices, and (3) stations offering operations that are not performed on every job, or that are performed on every job but with many options. For stations of the first type there is no sequencing problem at all. However, for the second type a set-up cost is incurred each time the operation switches from one choice to another. At the third type of stations, different models, requring different amounts and choices of assembly work, creates an uneven flow of work along the line and variations in the work load at these stations. When a subsequence of jobs requires more work load than the station can handle, it is necessary to help the operations at the station or to complete the work elsewhere. Therefore, a schedule which minimize the sum of set-up cost and utility work cost is desired. So this study has developed Fixed Random Ordering Rule (FROR), Fixed Ascending Ordering Rule (FAOR), Fixed Descending Ordering Rule, and Extended NHR (ENHR). ENHR is to choose optimal color ordering of each batch with NHR, and to decide job sequence of the batch with it, too. As the result of experiments, ENHR was the best heuristic algorithm. NHR is a new heuristic rule in which only the minimum addition of violations from both partial sequence and unassigned sequence at every branch could be considered. And this is a heuristic sequencing rule for the third type of stations at MMAL. This study developed one more heuristic algorithm to test the performance of NHR, which is named as Practical Heuristic Rule (PHR).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.10
• /
• pp.3708-3728
• /
• 2021

Indian herbal plants are used in agriculture and in the food, cosmetics, and pharmaceutical industries. Laboratory-based tests are routinely used to identify and classify similar herb species by analyzing their internal cell structures. In this paper, we have applied computer vision techniques to do the same. The original leaf image was preprocessed using the Chan-Vese active contour segmentation algorithm to efface the background from the image by setting the contraction bias as (v) -1 and smoothing factor (µ) as 0.5, and bringing the initial contour close to the image boundary. Thereafter the segmented grayscale image was fed to a leaky capacitance fired neuron model (LCFN), which differentiates between similar herbs by combining different groups of pixels in the leaf image. The LFCN's decay constant (f), decay constant (g) and threshold (h) parameters were empirically assigned as 0.7, 0.6 and h=18 to generate the 1D feature vector. The LCFN time sequence identified the internal leaf structure at different iterations. Our proposed framework was tested against newly collected herbal species of natural images, geometrically variant images in terms of size, orientation and position. The 1D sequence and shape features of aloe, betel, Indian borage, bittergourd, grape, insulin herb, guava, mango, nilavembu, nithiyakalyani, sweet basil and pomegranate were fed into the 5-fold Bayesian regularization neural network (BRNN), K-nearest neighbors (KNN), support vector machine (SVM), and ensemble classifier to obtain the highest classification accuracy of 91.19%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.11
• /
• pp.2341-2348
• /
• 2009

An intrusion detection technique based on host consider system call sequence or system call arguments. These two ways are suitable when system call sequence or order and length of system call arguments are out of order. However, there are two disadvantages which a false positive rate and a false negative rate are high. In this paper we propose the T-N2SCD detection model based on Time Window in order to reduce false positive rate and false negative rate. Data for using this experiment is provided from DARPA. As experimental results, the proposed model showed that the false positive rate and the false negative rate are lowest at an interval of 1000ms than at different intervals.

• Journal of KIISE
• /
• v.44 no.3
• /
• pp.261-274
• /
• 2017

Variability management is the foremost criterion that defines the extent to which complexities can be handled in a system. Predominantly, the requirements' engineering (RE) study overlooks, or speculates a consistent behavior of, the environment in which a system functions. In real-time systems it is vital to observe and adjust to an intrinsically changing context. Therefore, in this work we identify the requirements of the system in various contexts by recommending a framework using i* goal model, problem frames, use case maps and live sequence charts. The framework is illustrated using a case study of the smart grid RTP system. In the case study, elaboration of scenarios using use case maps and live sequence charts proved beneficial as they assisted in early analysis and validation of contexts. In addition, the elaboration of requirements for obstacle and conflict analysis assists the requirements engineer to increase the robustness of the system. The proposed framework is evaluated theoretically and by empirical study.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.222-225
• /
• 2000

Human frequently communicate non-linguistic information with gesture. So, we must develop efficient and fast gesture recognition algorithms for more natural human-computer interaction. However, it is difficult to recognize gesture automatically because human's body is three dimensional object with very complex structure. In this paper, we suggest a method which is able to detect key frames and frame changes, and to classify image sequence into some gesture groups. Gesture is classifiable according to moving part of body. First, we detect some frames that motion areas are changed abruptly and save those frames as key frames, and then use the frames to classify sequences. We symbolize each image of classified sequence using Principal Component Analysis(PCA) and clustering algorithm since it is better to use fewer components for representation of gestures. Symbols are used as the input symbols for the Hidden Markov Model(HMM) and recognized as a gesture with probability calculation.