• Journal of Information Processing Systems
• /
• v.5 no.4
• /
• pp.229-236
• /
• 2009

Sensors are deployed to gather physical, environmental data in sensor networks. Depending on scenarios, it is often assumed that it is difficult for batteries to be recharged or exchanged in sensors. Thus, sensors should be able to process users' queries in an energy-efficient manner. This paper proposes a spatial query processing scheme- Minimum Bounding Area Based Scheme. This scheme has a purpose to decrease the number of outgoing messages during query processing. To do that, each sensor has to maintain some partial information locally about the locations of descendent nodes. In the initial setup phase, the routing path is established. Each child node delivers to its parent node the location information including itself and all of its descendent nodes. A parent node has to maintain several minimum bounding boxes per child node. This scheme can reduce unnecessary message propagations for query processing. Finally, the experimental results show the effectiveness of the proposed scheme.

• Korean Journal of Computational Design and Engineering
• /
• v.2 no.3
• /
• pp.161-174
• /
• 1997

In this paper, the techniques for graphic simulation of material removal process are described. The concepts of the bounding box and base plane are proposed. With these concepts, a real-time shaded display of a Z-map model being milled by a cutting tool following an NC path can be implemented very efficiently. The base planes make it possible to detect the visible face of Z-map model effectively. And the bounding box of tool sweep volume provides minimum area of screen to be updated. The proposed techniques are suitable for implementation in raster graphic device and need a few memories and a small amount of calculation. Proposed method is written in C and executable on MS-Windows95 and Window-NT.

• 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.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.1
• /
• pp.60-68
• /
• 1999

In reverse engineering (RE) sustems, the quality of the data aquisition process is crucial to the accuracy of the reverse engineered three dimensional computer-aided design (CAD) model. However, these tasks are predominantly done manually, and little work has been done to improve the efficiency of scanning by determining the minimum number of scans and the optimal scanning directions. In this paper, new scanning and registration methods using tooling balls are developed to assist in determining the optimal parameter for these processes. When the object to scanned has no concavity, attaching path of the object and its bounding rectangle are used for optimal scanning and registration. Then minimum number of tooling balls and their positions are calculated automatically. In the case of concave parts, the scanning plan should include a complete scan of the concave area. With the surface normal vector and the scanning direction, the minimum degree of rotating the part can be calculated. But the maximum rotation should be restricted in order to prevent occlusion of the part. Finally tow sample part ar scanned based on the proposed methods and the results are discussed.

• Journal of the Semiconductor & Display Technology
• /
• v.9 no.2
• /
• pp.15-20
• /
• 2010

This paper deals with minimizing layout area of FPGA design. FPGAs are becoming increasingly important in the design of ASICs since they provide both large scale integration and user-programmability. 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 FPGA graphs in rectangles of several aspect ratios which solves the longest path problem in the constraint graph.

• 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.

• Journal of KIISE:Software and Applications
• /
• v.29 no.11
• /
• pp.809-817
• /
• 2002

This paper describes a new face detection method that is a pre-processing algorithm for on-line face recognition. To complement the weakness of using only edge or rotor features from previous face detection method, we propose the two types of face detection method. The one is a combined method with edge and color features and the other is a center area color sampling method. To prevent connecting the people's face area and the background area, which have same colors, we propose a new adaptive edge detection algorithm firstly. The adaptive edge detection algorithm is robust to illumination variance so that it extracts lots of edges and breakouts edges steadily in border between background and face areas. Because of strong edge detection, face area appears one or multi regions. We can merge these isolated regions using color information and get the final face area as a MBR (Minimum Bounding Rectangle) form. If the size of final face area is under or upper threshold, color sampling method in center area from input image is used to detect new face area. To evaluate the proposed method, we have experimented with 2,100 face images. A high face detection rate of 96.3% has been obtained.