• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.06a
• /
• pp.212-215
• /
• 2001

본 논문에서는 평면 형상에 대한 새로운 계층적 표현 방법을 소개하였다. 제안한 방법에서는 근사화 과정의 근사화 오차(approximation error)를 근사화 순서와 정도를 결정하는 중요한 척도로 활용하였으며, 제안한 오차 조절 알고리즘을 통해 보다 자연스러운 근사화 표현이 가능하도록 하였다. 그리고 최소 경계 사각형(MBR: Minimum Bounding Rectangle)을 단순 확장한 최소 경계 팔각형(MBO: Minimum Bounding Octangle)을 지역화에 응용하였으며, 이는 다른 지역화 방법들과 비교하였을 때 상대적으로 더 효율적인 방법임을 확인할 수 있었다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.6
• /
• pp.1243-1248
• /
• 2006

Object tracking in a real time image is one of interesting subjects in computer vision and many practical application fields past couple of years. But sometimes existing systems cannot find object by recognize background noise as object. This paper proposes a method of object detection and tracking using adaptive background image in real time. To detect object which does not influenced by illumination and remove noise in background image, this system generates adaptive background image by real time background image updating. This system detects object using the difference between background image and input image from camera. After setting up MBR(minimum bounding rectangle) using the internal point of detected object, the system tracks object through this MBR. In addition, this paper evaluates the test result about performance of proposed method as compared with existing tracking algorithm.

• Journal of Korea Multimedia Society
• /
• v.5 no.1
• /
• pp.18-27
• /
• 2002

A hierarchical representation scheme for planar curves, MBO-tree, is proposed in this paper, which provides natural approximation and efficient localization. MBO-tree is based on the Douglas-Peucker algorithm (iterative end-point fit algorithm), but approximation errors that are stored with corresponding points in MBO-tree nodes and are used for abstraction measures are adjusted by force to eliminate unnatural approximation. The error adjusting is just making the approximation error of a node in a MBO-tree to be less than or equal to that of its parent. In point of localization, the bounding area of a curve is represented with a minimum bounding octangle (MBO), which can enclose the curve more compactly compared with those of other hierarchical schemes, such as the strip tree, the arc tree and the HAL tree. The MBO satisfies the hierarchical inclusion property that is useful for hierarchical geometrical operations, such as the point-inclusion test and the polygon intersection test. Through several experiments, we found that the proposed scheme was able to approximate more naturally and to localize more effectively.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.4
• /
• pp.708-712
• /
• 1987

This paper deals with minimizing layout area of VLSI design. A long wire in a VLSI layout causes delay which can be reduced by using a driver. There can be significant area increase when many drivers are introduced in a layout. This paper describes a method to obtain tight bound on the worst-case increase in area when drivers are introduced along many long wires in a layout. The area occupied by minimum-area embedding for a circuit can depend on the aspect ratio of the bounding rectangle of the layout. This paper presents a separator-based area optimal embeddings for VLSI graphs in rectangles of several aspect ratios.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.11
• /
• pp.789-794
• /
• 2013

A vehicle tracking system makes it possible to induce the vehicle movement path for avoiding traffic congestion and to prevent traffic accidents in advance by recognizing traffic flow, monitoring vehicles, and detecting road accidents. To track the vehicles effectively, those which appear in a sequence of video frames need to identified by extracting the features of each object in the frames. Next, the identical vehicles over the continuous frames need to be recognized through the matching among the objects' feature values. In this paper, we identify objects by binarizing the difference image between a target and a referential image, and the labelling technique. As feature values, we use the center coordinate of the minimum bounding rectangle(MBR) of the identified object and the averages of 1D FFT(fast Fourier transform) coefficients with respect to the horizontal and vertical direction of the MBR. A vehicle is tracked in such a way that the pair of objects that have the highest similarity among objects in two continuous images are regarded as an identical object. The experimental result shows that the proposed method outperforms the existing methods that use geometrical features in tracking accuracy.

• Journal of Korea Multimedia Society
• /
• v.6 no.3
• /
• pp.409-418
• /
• 2003

Object tracking in video is one of subject that computer vision and several practical application field have interest in several years. This paper proposes real time object tracking and face region extraction method that can be applied to security and supervisory system field. For this, in limited environment that camera is fixed and there is seldom change of background image, proposed method detects position of object and traces motion using difference between input image and background image. The system creates adaptive background image and extracts pixels in object using line scan method for more stable object extraction. The real time object tracking is possible through establishment of MBR(Minimum Bounding Rectangle) using extracted pixels. Also, effectiveness for security and supervisory system is improved due to extract face region in established MBR. And through an experiment, the system shows fast real time object tracking under limited environment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.12
• /
• pp.2831-2838
• /
• 2014

This paper proposes the off-line handwritten flowchart symbol recognition algorithm by type and strength of a cross region of the straight line strokes that is extracted based the normalized dominant slope vectors. In the proposed algorithm, first of all, a connector symbol which consisted only curves is recognized by the special features, and the other symbols with straight line strokes are recognized by type and strength of a cross region, and that is extracted by extension of minimum bounding rectangle of the clusters of the normalized dominant slope vectors, and the straight line strokes of the symbols is extracted by the normalized dominant slope vectors. To confirm the validity of the proposed algorithm, the experiments are conducted for 10 different kinds of flowchart symbols that mainly used for computer program, and the number of symbols is 198. Experiment results were obtained the recognition rate of 99.5%, and the flowchart symbols is recognized correctly robust to variations, and then the proposed algorithm were found very effective for off-line handwritten flowchart symbol recognition.

• Spatial Information Research
• /
• v.19 no.1
• /
• pp.117-126
• /
• 2011

Recently, AR applications provide location-based spatial information by GPS. Also, the spatial information is displayed by the angle of the camera. So far, traditional spatial indexes in spatial database field retrieve and filter spatial information by the minimum bounding rectangle (MBR) algorithm.(ex. R-tree) MBR strategy is a useful technique in the geographic information systems and location based services. But MBR technique doesn't reflect the characteristics of spatial queries in AR. Spatial queries of AR applications have high possibility of the dead space area between MBRs of non-leaf node and query area. We propose triangle node filtering algorithm that improved efficiency of spatial retrieval used the triangle node filtering techniques by exclusion the dead space. In this paper, the proposed algorithm has been implemented on PostgreSQL/PostGIS. Experimental results show the spatial retrieval that using the proposed algorithm better performance than the spatial retrieval that of the minimum bounding rectangle algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.6
• /
• pp.49-55
• /
• 2012

Pacman is one of the world-famous and have been chosen game in the game room at the arcade. In this paper, pacman game gives you the ability to perform by simple hand movement alone. First, we obtain binary RGB image to extract skin color, and convert into binary image YCbCr by minus the luminance in this image. Next, we extract the hand region by the product of an binary RGB image and binary YCbCr image. Finally, the hand region, we obtain the center of gravity by the minimum bounding rectangle and the center of the hand pixel area, and we used to obtain the center of the hand area with an average of two center of gravity. In other words, we presented the game of motion that can take the place of arrow key by using the center coordinates of hand. In addition, these experiments showed the average movement and error rate, and cause of the error type was also investigated.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.91-94
• /
• 2011

The LBSNS(Location-Based Social Networking Service) service has been well-received by researchers and end-users, such as Twitter. Location-Based service of Twitter is now structured that users could not subscribe the information of their interesting local area. Those who being following from someone tweet message included information of local area to them just for their own interesting. However, follower may receive that kind of tweet. In order to handle the problem, we propose filtering technique using spatial join. The first work for filtering technique is to add a location information to tweets and users. In this paper, location information is represented by MBR(Minimum Bounding Rectangle). Location information is divided into dynamic property and static property. Suppose that users are continuously moving, that means one of the dynamic property's example. At this time, a massive continous query could cause the problem in server. In this paper, we create Virtual Grid on Google Map for reducing frequency of query, and conclude that it is useful for server.