• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.5
• /
• pp.73-82
• /
• 1996

In this paper, an efficient algorithm for recognizing and positioning occuluded objects in a two-dimensional plane is presented. Model objects and unknown input image are approximated by polygonal boundaries, which are compactly represented by shape functions of the polygons. The input image is partitioned into measningful segments whose end points are at the locations of possible occlusion - i.e. at concave vertices. Each segment is matched against known model objects by calculating a matching measure, which is defined as the minimum euclidean distance between the shape functions. An O(mm(n+m) algorithm for computing the measure is presentd, where n and m are the number of veritces for a model and an unknown object, respectively. Match results from aprtial segments are combined based on mutual compatibility, then are verified using distance transformation and translation vector to produce the final recognition. The proposed algorithm is invariant under translation and rotation of objects, which has been shown by experimental results.

• Child Studies in Asia-Pacific Contexts
• /
• v.2 no.2
• /
• pp.77-90
• /
• 2012

The present study investigated infants' ability to form a category of a support relation (i.e., "on") when the objects depicting the relation were perceptually simple versus more complex. Twenty Korean infants of 14 months were habituated to dynamic support events with objects that were either simple or more complex in appearance. They were then tested with events that differed from the habituation events in the specific objects, spatial relation, or both. Infants formed a support category whether familiarized to simple or complex objects, looking significantly longer at test events with a novel than familiar relation. The results indicate that at 14 months of age, object features do not impact infants' ability to form a categorical representation of support.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.12
• /
• pp.1919-1925
• /
• 2001

Overhead cranes consist of trolley, girder, rope, objects, trolley motor, girder motor, and hoist motor. If objects are regarded as mass point, and the acceleration of hoisting motion for objects is neglected, analytical model of overhead cranes becomes a nonlinear model because the length of a rope changes. Equations of motion this model is derived of simultaneous differential equations fur motors and object. Positions of the model are controlled by optimal inputs which obtain from a nonlinear optimal control method. From the results of computer simulation, even if initial states of objects suing, it is founded that position of overhead cranes is controlled, and that swing of objects is suppressed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.7
• /
• pp.1815-1830
• /
• 2012

Existing R-tree that is based on a variety of outdoor-based techniques to manage moving objects have been investigated. Due to the different characteristics of the indoor and outdoor, it is difficult to management of moving object using existed methods in indoor setting. We propose a new index structure called ACII(adaptive Cell-based index for Indoor moving objects) for Indoor moving objects. ACII is Cell-based access structure adopting an overlapping technique. The ACII refines cells adaptively to handle indoor regional data, which may change its locations over time. The ACII consumed at most 30% of the space required by R-tree based methods, and achieved higher query performance compared with r-tree based methods.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.309-312
• /
• 2005

The need for LBS (Loc,ation Based Services) is increasing due to the wnespread of mobile computing devices and positioning technologies~ In LBS, there are many applications that need to manage moving objects (e.g. taxies, persons). The moving object join operation is to make pairs with spatio-temporal attribute for two sets in the moving object database system. It is import and complicated operation. And processing time increases by geometric progression with numbers of moving objects. Therefore efficient methods of spatio-temporal join is essential to moving object database system. In this paper, we apply spatial join methods to moving objects join. We propose two kind of join methods with TB- Tree that preserves trajectories of moving objects. One is depth first traversal spatio-temporaljoin and another is breadth-first traversal spatio-temporal join. We show results of performance test with sample data sets which are created by moving object ,generator tool.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.778-784
• /
• 2005

Miniaturization of computing devices, and advances in wireless communication and positioning systems will create a wide and increasing range of database applications such as location-based services, tracking and transportation systems that has to deal with Moving Objects. Various types of queries could be posted to moving objects, including past, present and future queries. The key problem is how to model the location of moving objects and enable Database Management System (DBMS) to predict the future location of a moving object. It is obvious that there is a need for an innovative, generic, conceptually clean and application-independent approach for spatio-temporal handling data. This paper presents behavioral aspect of the spatio-temporal databases for managing and querying moving objects. Our objective is to impelement and extend the Spatial TAU (STAU) system developed by Dr.Pelekis that provides spatio-temporal functionality to an Object-Relational Database Management System to support modeling and querying moving objecs. The results of the impelementation are demonstrated in this paper.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.306-315
• /
• 1995

This paper presents a bin picking method using a slit beam laser in which a robot recognizes all of the unoccluded objects from the top of jumbled objects, and picks them up one by one. Once those unoccluded objects are removed, newly developed unoccluded objects underneath are recognized and the same process is continued until the bin gets empty. To recognize unoccluded objects, a new algorithm to link edges on slices which are generated by the orthogonally mounted laser on the xy table is proposed. The edges on slices are partitioned and classified using convex and concave function with a distance parameter. The edge types on the neighborhood slices are compared, then the hamming distances among identical kinds of edges are extracted as the features of fuzzy membership function. The sugeno fuzzy integration about features is used to determine linked edges. Finally, the pick-up sequence based on MaxMin theory is determined to cause minimal disturbance to the pile. This proposed method may provide a solution to the automation of part handling in manufacturing environments such as in punch press operation or part assembly.

• Journal of Information Processing Systems
• /
• v.7 no.3
• /
• pp.519-530
• /
• 2011

A Snake is an active contour for representing object contours. Traditional snake algorithms are often used to represent the contour of a single object. However, if there is more than one object in the image, the snake model must be adaptive to determine the corresponding contour of each object. Also, the previous initialized snake contours risk getting the wrong results when tracking multiple objects in successive frames due to the weak topology changes. To overcome this problem, in this paper, we present a new snake method for efficiently tracking contours of multiple objects. Our proposed algorithm can provide a straightforward approach for snake contour rapid splitting and connection, which usually cannot be gracefully handled by traditional snakes. Experimental results of various test sequence images with multiple objects have shown good performance, which proves that the proposed method is both effective and accurate.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.63.5-63
• /
• 2001

In this paper, moving objects tracking and dynamic characteristic analysis are studied. Kohonen´s self-organizing neural network models are used for moving objects tracking and time delay neural networks are used for dynamic characteristic analysis. Instead of objects brightness, neuron projections by Kohonen Networks are used. The motion of target objects can be analyzed by using the differential neuron image between the two projections. The differential neuron image which is made by two consecutive neuron projections is used for center detection and moving objects tracking. The two differential neuron images which are made by three consecutive neuron projections are used for the moving trajectory estimation.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.10
• /
• pp.89-97
• /
• 1997

Because a map consists of many lines, a process of recognizing an object in a map is one to group lines that are consistent with the structure of the object. Therefore, it is important to establish an efficient method for finding lines which constitute objects. In this paper, a novel method for recognizing roads and districts in a land register map is proposed. In this method, lines that constitute objects are searched in a reduced search space by defining some relations between lines, and objects are recognized by using the structural information of the objects. As a result, the search space is reduced effetively, and even objects that embody the broken lines and the crossed lines are recognized.