• Journal of Broadcast Engineering
• /
• v.17 no.3
• /
• pp.437-446
• /
• 2012

A face detection algorithms using two-dimensional (2-D) intensity or color images have been studied for decades. Recently, with the development of low-cost range sensor, three-dimensional (3-D) information (i.e., depth image that represents the distance between a camera and objects) can be easily used to reliably extract facial features. Most people have a similar pattern of 3-D facial structure. This paper proposes a face detection method using intensity and depth images. At first, adaboost algorithm using intensity image classifies face and nonface candidate regions. Each candidate region is divided into $5{\times}5$ blocks and depth values are averaged in each block. Then, $5{\times}5$ block rank pattern is constructed by sorting block averages of depth values. Finally, candidate regions are classified as face and nonface regions by matching the constructed depth map based block rank patterns and a template pattern that is generated from training data set. For template matching, the $5{\times}5$ template block rank pattern is prior constructed by averaging block ranks using training data set. The proposed algorithm is tested on real images obtained by Kinect range sensor. Experimental results show that the proposed algorithm effectively eliminates most false positives with true positives well preserved.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.3
• /
• pp.55-62
• /
• 2009

Location based Services in the ubiquitous computing environment, namely u-LBS, use very large and skewed spatial objects that are closely related to locational information. It is especially essential to achieve fast search, which is looking for POI(Point of Interest) related to the location of users. This paper examines how to search large and skewed POI efficiently in the u-LBS environment. We propose the Dynamic-level Grid based R-Tree(DGR-Tree), which is an index for point data that can reduce the cost of stationary POI search. DGR-Tree uses both R-Tree as a primary index and Dynamic-level Grid as a secondary index. DGR-Tree is optimized to be suitable for point data and solves the overlapping problem among leaf nodes. Dynamic-level Grid of DGR-Tree is created dynamically according to the density of POI. Each cell in Dynamic-level Grid has a leaf node pointer for direct access with the leaf node of the primary index. Therefore, the index access performance is improved greatly by accessing the leaf node directly through Dynamic-level Grid. We also propose a K-Nearest Neighbor(KNN) algorithm for DGR-Tree, which utilizes Dynamic-level Grid for fast access to candidate cells. The KNN algorithm for DGR-Tree provides the mechanism, which can access directly to cells enclosing given query point and adjacent cells without tree traversal. The KNN algorithm minimizes sorting cost about candidate lists with minimum distance and provides NEB(Non Extensible Boundary), which need not consider the extension of candidate nodes for KNN search.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.39 no.5
• /
• pp.535-541
• /
• 2015

In this study, an approximate multi-objective optimization of a wall-mounted monitor bracket arm was performed. The rotation angle of the bracket arm was determined considering the inplane degree of freedom. We then formulated an optimization problem on maximum stress and deflection. Analyses of mean and design parameters were conducted for sensitivity regarding performance with orthogonal array and response surface method (RSM). RSM models of objective and constraint functions were generated using central composite (CCD) and D-optimal design. The accuracy of approximate models was evaluated through $R^2$ value. The obtained optimal solutions by non-dominant sorting genetic algorithm (NSGA-II) were validated through the finite element analysis and we compared the obtained optimal solution by CCD and D-optimal design.

• International Journal of Aeronautical and Space Sciences
• /
• v.10 no.2
• /
• pp.117-124
• /
• 2009

In the environment where various and complicated threat signals exist, RWR (Radar Warning Receiver), which can warn pilot of the existence of threats, has long been a necessary electronic warfare (EW) system to improve survivability of aircraft. The angle of arrival (AOA) information, the most reliable sorting parameter in the RWR, is measured by means of four-quadrant amplitude comparison direction finding (DF) technique. Each of four antennas (usually spiral antenna) of DF unit covers one of four quadrant zones, with 90 degrees apart with nearby antenna. According to the location of antenna installed in helicopter, RWR is subject to signal loss and interference by helicopter body and structures including tail bumper, rotor blade, and so on, causing a difficulty of detecting hostile emitters. In this paper, the performance degradation caused by signal interference by tail rotor blades has been estimated by measuring amplitude video signals into which RWR converts RF signals in case a part of antenna is screened by real tail rotor blade in anechoic chamber. The results show that corruption of pulse amplitude (PA) is main cause of DF error. We have proposed two algorithms for resolving the interference by tail rotor blades as below: First, expand the AOA group range for pulse grouping at the first signal analysis phase. Second, merge each of pulse trains with the other, that signal parameter except PRI and AOA is similar, after the first signal analysis phase. The presented method makes it possible to use RWR by reducing interference caused by blade screening in case antenna is screened by tail rotor blades.

• Journal of Digital Contents Society
• /
• v.18 no.1
• /
• pp.159-165
• /
• 2017

In order to solve problems in automatic quality inspection of tablet capsules, computation-efficient image processing technique, appropriate threshold setting, edge detection and segmentation methods are required. And since existing automatic system for quality inspection of tablet capsules is of very high cost, it needs to be reduced through the realization of low-price hardware system. This study suggests a technique that uses low-cost camera module to obtain image and inspects dents on tablet capsules and sorting them by applying TLS curve fitting technique and edge-based image segmentation. In order to assess the performance, the major classifications algorithm of PCA, ICA and SVM are used to evaluate training time, test time and accuracy for capsule image area and curve fitting edge data sets.

• Journal of the Korea Computer Graphics Society
• /
• v.24 no.1
• /
• pp.27-33
• /
• 2018

This paper presents a new adaptive LSB steganography for high capacity in spatial color images. The number of least signi ficant bit (LSB) of each RGB component in a color image pixel, to replace with the data bits to be hidden, was determine d through analysis of the worst case peak signal noise ratio (PSNR). In addition, the combination of the number of bits is determined adaptively according to image content. That is, 70% of the data to be hidden is proposed to be replaced with 3 bit LSB of two components, 2 bit LSB of the rest component, and 30% be replaced with 4 bit LSB of each RGB compon ent. To find edge areas in an image, delta sorting in local area is also suggested. Using the proposed method, the data cap acity is 9.2 bits per pixel (bpp). The average PSNR value of the tested images with concealed data of up to 60Kbyte was 43.9 db and also natural histograms were generated.

• Journal of Korea Multimedia Society
• /
• v.3 no.6
• /
• pp.674-684
• /
• 2000

One key obstacle which has been identified in achieving parallel processing is to communicate effectively between processors during execution. One approach to achieving an optimal delay time is to use expander graph. The networks and algorithms which are based on expander graphs are successfully exploited to yield fast parallel algorithms and efficient design. The AKS sorting algorithm in time O(logN) which is an important result is based on the use of expanders. The expander graph also can be applied to construct a concentrator and a superconcentrator. Since Margulis found a way to construct an explicit linear expander graph, several expander graphs have been developed. But the proof of existence of such graphs is in fact provided by a nonconstructive argument. We investigate the expander network on the hypercube network. We prove the expansion of a sin81e stage hypercube network and extend this from a single stage to multistage networks. The results in this paper provide a theoretical analysis of expansion in the hypercube network.

• Journal of Biosystems Engineering
• /
• v.27 no.4
• /
• pp.341-348
• /
• 2002

Quality evaluation of red ginsengs is determined by outer shape and inner qualities. Especially, the inner qualities are main grading criteria. Currently, red ginsengs are classified into 3-grades; heaven, earth and good. The best heaven grade must not include inner holes and sponge tissues. This study was conducted to develop a red ginseng sorting system using x-ray image processing technique. Because of lens characteristic, gray values of the central region in the x-ray image are higher and gradually decreased towards the edge regions. This difference of gray values gives trouble in segmentation and detection of inner holes in red ginseng image, so preprocessing technique is necessary. The preprocessing was done by subtracting source image from an empty background image. But, simple subtraction was not quite appropriate because of too small contrast between inner holes and sound part. Scaled subtraction images were obtained by multiplying all gray values by some numbers. However this method could not help to set threshold value because the gray values of root part are generally lower than body part when red ginseng is exposed to the x-ray. To determine threshold value for detecting inner holes, an algorithm was developed by increasing overall gray values of less clear images.

• Journal of Sensor Science and Technology
• /
• v.11 no.2
• /
• pp.93-101
• /
• 2002

The quality of agricultural products is classified with various factors which are measured and determined by destructive and/or nondestructive method. NIR spectrum analysis method is used to determine internal qualities such as a brix and an acidity. CCD color camera is used to measure external quality like color and a size of fruit. Today, nondestructive methods are widely researched. The quality and the grade of fruit loaded into a cup automatically and measured in real time by camera and NIR system is determined by infernal and external factors. This paper proposes modified boundary tracking algorithm which detects the contour of fruit's color image and make chain code faster than conventional method. The chain code helps compute a size of fruit image and find multiple loading of a fruit in single cup or fruit between two cups. The designed classification system sorts a citrus at speed of 8 fruit/s, with evaluating a brix, an acidity and a size grade.

• Journal of Digital Contents Society
• /
• v.18 no.4
• /
• pp.739-745
• /
• 2017

This paper presents and discusses an implementation of the GPU shifted sorting method to find approximate k nearest neighbors which executes within "warp", the minimum execution unit in GPU parallel architecture. Also, this paper presents the comparison results with other two common nearest neighbor searching methods, GPU-based kd-tree and ANN (Approximate Nearest Neighbor) library. The proposed implementation focuses on the cases when k is small, i.e. 2, 4, 8, and 16, which are handled efficiently within warp to consider it is very common for applications to handle small k's. Also, this paper discusses optimization ways to implementation by improving memory management in a loop for the CUB open library and adopting CUDA commands which are supported by GPU hardware. The proposed implementation shows more than 16-fold speed-up against GPU-based other methods in the tests, implying that the improvement would become higher for more larger input data.