• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04c
• /
• pp.232-234
• /
• 2003

차량 번호판 인식 시스템은 차량 보급의 대중화와 그에 따라 발생되는 여러문제의 해결차원에서 활발하게 연구 개발되고 있는 분야이다. 본 논문에서는 휴대용 입력 장치로부터 획득한 차량 번호판 영상에서 차량 번호판이 가지는 특성을 이용하여 번호판을 추출한 후, 차량 번호판의 특성을 이용하여 개별 문자 영역들의 MBR(Minimum Boundary Rectangle)을 추출한다. 그리고. 불변 모멘트의 특징을 이용하여 기존의 템플릿 매칭 방식 보다 연산시간이 매우 빠르고 입력 영상내의 번호판 크기에 제약이 적온 장점을 가진 보다 향상된 차량 번호판 인식 시스템을 제안한다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.1
• /
• pp.57-64
• /
• 2013

In this paper, we propose the classification method of medicine bottle images using the features with color and size information. It is difficult to classify with size feature only, because there are many similar sizes of bottles. Therefore, we suggest a classification method based on color information, which robust to illumination variations. First, we extract MBR(Minimum Boundary Rectangle) of medicine bottle area using Binary Threshold of Red, Green, and Blue in image and classify images with size. Then, hue information and RGB color average rate are used to classify image, which features are robust to lighting variations. Finally, using SURF(Speed Up Robust Features) algorithm, corresponding image can be found from candidates with previous extracted features. The proposed method makes to reduce execution time and minimize the error rate and is confirmed to be reliable and efficient from experiment.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.1
• /
• pp.15-28
• /
• 2008

In ubiquitous sensor networks(USN) environment, it is essential to process region query for user-demand services. Using R-tree is a preferred technique to process region query for in-network query environment. In USN environment, USN middleware must select sensors that transfers region query with accuracy because the lifetime of sensors is that of whole sensor networks. When R-tree is used, however, it blindly passes the region query including non-existent sensors where MBR(Minimum Boundary Rectangle) of R-tree is Intersected by region of query. To solve in this problem, we propose a reconstruction of region query method which is a trie-structured Quad tree in the base station that includes sensors in region of query select with accuracy. We observed that the proposed method delays response time than R-tree, but is useful for reducing communication cost and energy consumption.

• Journal of Internet Computing and Services
• /
• v.10 no.6
• /
• pp.1-6
• /
• 2009

In this paper, we propose an energy efficient index scheme for Nearest Neighbor queries, specially designed for mobile P2P environments. we propose a PMBR (P2P Minimum Boundary Rectangle) index that provides the client with the ability of selective contacting and tuning from other nodes. The mobile client is able to identify whether or not the neighbor nodes have the desired information by accessing PMBR. Thus, the client immediately switches to change to another node's broadcast channel if the index does not contain the desired information. Furthermore, the client is able to predict the arrival time of the desired data items and only needs to tune into the broadcast channel when the requested data items arrives, by first accessing PMBR. Thus, the mobile client can stay in power save mode most of time, and tune into the broadcast channel only when the requested data items arrive. Experiments are conducted to evaluate the performance of the proposed scheme. Comprehensive experiments illustrate that the proposed scheme is more efficient than the previous techniques in terms of energy consumption.

• Journal of KIISE:Software and Applications
• /
• v.27 no.7
• /
• pp.731-741
• /
• 2000

This paper proposes a method to detect a facial region and extract facial features which is crucial for visual recognition of human faces. In this paper, we extract the MER(Minimum Enclosing Rectangle) of a face and facial components using projection analysis on both edge image and binary image. We use an active contour model(snakes) for extraction of the contours of eye, mouth, eyebrow, and face in order to reflect the individual differences of facial shapes and converge quickly. The determination of initial contour is very important for the performance of snakes. Particularly, we detect Minimum Enclosing Rectangle(MER) of facial components and then determine initial contours using general shape of facial components within the boundary of the obtained MER. We obtained experimental results to show that MER extraction of the eye, mouth, and face was performed successfully. But in the case of images with bright eyebrow, MER extraction of eyebrow was performed poorly. We obtained good contour extraction with the individual differences of facial shapes. Particularly, in the eye contour extraction, we combined edges by first order derivative operator and zero crossings by second order derivative operator in designing energy function of snakes, and we achieved good eye contours. For the face contour extraction, we used both edges and grey level intensity of pixels in designing of energy function. Good face contours were extracted as well.

• Korean Journal of Remote Sensing
• /
• v.34 no.6_1
• /
• pp.1067-1087
• /
• 2018

In a study for LiDAR data based building boundary extraction, usually dense point cloud was used to cluster building rooftop area and extract building outline. However, when we used DSM generated from stereo image matching to extract building boundary, it is not trivial to cluster building roof top area automatically due to outliers and large holes of point cloud. Thus, we propose a technique to extract building boundary semi-automatically from the DSM created from stereo images. The technique consists of watershed segmentation for using user input as markers and recursive MBR algorithm. Since the proposed method only inputs simple marker information that represents building areas within the DSM, it can create building boundary efficiently by minimizing user input.

• Proceedings of the Korea Contents Association Conference
• /
• 2010.05a
• /
• pp.13-15
• /
• 2010

이동객체의 공간 데이터를 색인하기 위해 검색성능이 뛰어난 R-tree구조가 많이 활용된다. 최근 R-tree를 B+-tree처럼 인접한 단말노드 간의 연결을 통해 질의 처리를 수행하는 ISR-tree와 ISG-index가 제안되었다. 이 기법들은 MBR (Minimum Boundary Rectangle) 간의 인접한 이웃 노드를 결정하기 위해 보르노이 다이어그램(Voronoi Diagram)을 이용한다. MBR을 대상으로 하는 보르노이 다이어그램은 매우 복잡한 연산과정을 거친다. 본 논문에서는 점을 대상으로 하는 보르노이 다이어그램 연산을 활용한 인접한 이웃 MBR을 연산하는 기법을 제안한다. 각 MBR의 꼭지점들을 기준으로 보르노이 다이어그램을 만들 경우, 인접한 MBR의 꼭지점들의 보르노이 셀이 항상 인접한 것을 알아내었고, 이를 활용한다. 제안하는 기법의 우수성을 증명하기 위해 기존의 기법과 비교하여 성능평가를 수행하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.11
• /
• pp.1343-1350
• /
• 2019

Converting boundary images to time-series makes it feasible to perform boundary matching even on a very large image database, which is very important for interactive and fast matching. In recent research, there has been an attempt to perform fast matching considering partial denoising by converting the boundary image into time series. In this paper, to improve performance, we propose an index-building method considering all possible arbitrary denoising parameters for removing arbitrary partial noises. This is a challenging problem since the partial denoising boundary matching must be considered for all possible denoising parameters. We propose an efficient single index-building algorithm by constructing a minimum bounding rectangle(MBR) according to all possible denoising parameters. The results of extensive experiments conducted show that our index-based matching method improves the search performance up to 46.6 ~ 4023.6 times.

• Journal of the Korea Society for Simulation
• /
• v.19 no.4
• /
• pp.129-137
• /
• 2010

Currently used shortest path search algorithms involve graphs with vertices and weighted edges between each vertex. However, when finding the shortest path with a randomly shaped obstacle(an island, for instance) positioned in between the starting point and the destination, using such algorithms involves high memory inefficiency and is significantly time consuming - all positions in the map should be considered as vertices and every line connecting any of the two adjacent vertices should be considered an edge. Therefore, we propose a new method for finding the shortest path in such conditions without using weighted graphs. This algorithm will allow finding the shortest obstacle bypass given only the positions of the obstacle boundary, the starting point and the destination. When the row and column size of the minimum boundary rectangle to include an obstacle is m and n, respectively, the proposed algorithm has the maximum time complexity, O(mn). This performance shows the proposed algorithm is very efficient comparing with the currently used algorithms.

• Tribology and Lubricants
• /
• v.32 no.1
• /
• pp.24-31
• /
• 2016

In this paper hydrodynamic lubrication analysis is carried out to investigate the effects of groove location on the lubrication performance of a piston and cylinder system in a linear compressor. The rectangle shaped grooves having a constant groove depth and width are applied on the lubrication area of the piston. The Universal Reynolds equation is used to calculate the oil film pressure, and the Elrod algorithm with the finite different method is used to solve the governing equation. The JFO boundary condition is applied to predict cavitation regions. Transient analysis for different locations of the grooves on the piston is carried out using the typical operating condition of the linear compressor in order to estimate the variations of frictional power losses and minimum film thicknesses. When the grooves are applied on the lubrication area, both the frictional power loss and the minimum film thickness decrease. The frictional power loss can be reduced effectively, while maintaining a minimum film thickness to enable the piston operation without direct contact with the cylinder surface, by means of choosing a proper location of the grooves. The optimum location of the grooves to improve a lubrication performance depends on the operation condition or the system requirements specification.