• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.5
• /
• pp.339-345
• /
• 2016

In general, mosaic blocks are used to hide some specified areas, such as human faces and disgusting objects, in an input image when images are uploaded on a web-site or blog. This paper proposes a new algorithm for robustly detecting grid mosaic areas in an image based on the edge projection. The proposed algorithm first extracts the Canny edges from an input image. The algorithm then detects the candidate mosaic blocks based on horizontal and vertical edge projection. Subsequently, the algorithm obtains real mosaic areas from the candidate areas by eliminating the non-mosaic candidate regions through geometric features, such as size and compactness. The experimental results showed that the suggested algorithm detects mosaic areas in images more accurately than other existing methods. The suggested mosaic detection approach is expected to be utilized usefully in a variety of multimedia-related real application areas.

• The KIPS Transactions:PartB
• /
• v.18B no.3
• /
• pp.117-130
• /
• 2011

The purpose of this study is to produce a better way to detect crossroad accidents, which involves an efficient method to produce background images in consideration of object movement and preserve/demonstrate the candidate accident region. One of the prior studies proposed an employment of traffic signal interval within crossroad to detect accidents on crossroad, but it may cause a failure to detect unwanted accidents if any object is covered on an accident site. This study adopted inverse perspective mapping to control the scale of object, and proposed different ways such as producing robust background images enough to resist surrounding noise, generating candidate accident regions through information on object movement, and by using edge information to preserve and delete the candidate accident region. In order to measure the performance of proposed algorithm, a variety of traffic images were saved and used for experiment (e.g. recorded images on rush hours via DVR installed on crossroad, different accident images recorded in day and night rainy days, and recorded images including surrounding noise of lighting and shades). As a result, it was found that there were all 20 experiment cases of accident detected and actual effective rate of accident detection amounted to 76.9% on average. In addition, the image processing rate ranged from 10~14 frame/sec depending on the area of detection region. Thus, it is concluded that there will be no problem in real-time image processing.

• Journal of Korea Multimedia Society
• /
• v.9 no.2
• /
• pp.160-171
• /
• 2006

In this paper, we propose a face detection method using region segmentation to deal with complex images that have various environmental changes such as mixed background and light changes. To reduce the detection error rate due to background elements of the images, we segment the images with the JSEG method. We choose candidate regions of face based on the ratio of skin pixels from the segmented regions. From the candidate regions we detect face regions by using location and color information of eyes and eyebrows. In the experiment, the proposed method works well with the images that have several faces and different face size as well as mixed background and light changes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.6B
• /
• pp.1012-1020
• /
• 2000

In this paper, This paper presents a new algorithm which is used for detecting and extracting human masks from a color still image. The regions where each pixel has a value of skin-color were extracted from the Cb and Cr images, after the tone of the color image is converted to YCbCr from. A morphological filter is used to eliminate noise in the resulting image. By scanning it in horizontal and vertical ways under ways under threshold value, first candidate section is chosen. If it is not a face, secondary candidate section is taken and is divided into two candidate sections. The proposed algorithm is not affected by the variation of illuminations, because it uses only Cb and Cr components in YCbCr color format. Moreover, the face recognition was possible regardless of the degree of shifting face, changed shape, various sizes of the face, and the quality of image.

• IEIE Transactions on Smart Processing and Computing
• /
• v.2 no.4
• /
• pp.189-196
• /
• 2013

This paper presents a two-stage approach to detect pedestrians in video sequences taken from a moving vehicle. The first stage is a preprocessing step, in which potential pedestrians are hypothesized. During the preprocessing step, a difference image is constructed using a global motion estimation, vertical and horizontal edge maps are extracted, and the color difference between the road and pedestrians are determined to create candidate regions where pedestrians may be present. The candidate regions are refined further using the vertical edge symmetry features of the pedestrians' legs. In the next stage, each hypothesis is verified using the integral channel features and an AdaBoost classifier. In this stage, a decision is made as to whether or not each candidate region contains a pedestrian. The proposed algorithm was tested on a range of dataset images and showed good performance.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.906-909
• /
• 2000

Conventional caption extraction methods use the difference between frames or color segmentation methods from the whole image. Because these methods depend heavily on heuristics, we should have a priori knowledge of the captions to be extracted. Also they are difficult to implement. In this paper, we propose a method that uses little heuristics and simplified algorithm. We use topographical features of characters to extract the character points and use KMST(Kruskal minimum spanning tree) to extract the candidate regions for captions. Character regions are determined by testing several conditions and verifying those candidate regions. Experimental results show that the candidate region extraction rate is 100%, and the character region extraction rate is 98.2%. And then we can see the results that caption area in complex images is well extracted.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.896-899
• /
• 1996

A new algorithm for planning a collision free path is developed based on linear parametric curve. A collision-free path is viewed as a connected space curve in which the path consists of two straight curve connecting start to target point. A single intermediate connection point is considered in this paper and is used to manipulate the shape of path by organizing the control point in polar coordinate (.theta.,.rho.). The algorithm checks interference with obstacles, defined as GM (Geometry Mapping), and maps obstacles in Euclidean Space into images in CPS (Connection Point Space). The GM for all obstacles produces overlapping images of obstacle in CPS. The clear area of CPS that is not occupied by obstacle images represents collision-free paths in Euclidean Space. Any points from the clear area of CPS is a candidate for a collision-free path. A simulation of GM for number of cases are carried out and results are presented including mapped images of GM and performances of algorithm.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.10
• /
• pp.78-89
• /
• 1992

In this paper, a multiresolution edge detction algorithm for speckle images is proposed. Due to the signal dependency of speckle images, the number of edge points detected depends on the local average intensity. Thus the edge detection method independent of the average intensity is required to detect properly real significant changes in an original signal. In the proposed method, candidate area is first selected based on the statistical propeties of speckle images,i.e., based on the busyness measure such as the CoV(coefficient of variation) and the difference between the real and theoretical CDF(cumulative density function). Then the real edges are extracted in a multiresolution environment. Computer simulation with test images shows that the proposed method reduces significantly false edges in relatively homogeneous areas while detects fine details properly.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.2 no.3
• /
• pp.79-86
• /
• 2009

This study proposed a method of detecting the facial area by calculating Euclidian distances among skin color elements and extracting the characteristics of the face. The proposed algorithm is composed of light calibration and face detection. The light calibration process performs calibration for the change of light. The face detection process extracts the area of skin color by calculating Euclidian distances to the input images using as characteristic vectors color and chroma in 20 skin color sample images. From the extracted facial area candidate, the eyes were detected in space C of color model CMY, and the mouth was detected in space Q of color model YIQ. From the extracted facial area candidate, the facial area was detected based on the knowledge of an ordinary face. When an experiment was conducted with 40 color images of face as input images, the method showed a face detection rate of 100%.

• Journal of Software Assessment and Valuation
• /
• v.16 no.2
• /
• pp.135-142
• /
• 2020

In this paper, we describe the iris localization method in RGB images. Most of the iris localization methods are developed for infrared images, thus an iris localization method in RGB images is required for various applications. The proposed method consists of four stages: i) detection of the candidate irises using circular Hough transform (CHT) from an input image, ii) detection of a pupil center based on deep learning, iii) determine the iris using the pupil center, and iv) correction of the iris region. The candidate irises are detected in the order of the number of intersections of the center point candidates after generating the Hough space, and the iris in the candidates is determined based on the detected pupil center. Also, the error due to distortion of the iris shape is corrected by finding a new boundary point based on the detected iris center. In experiments, the proposed method has an improved accuracy about 27.4% compared to the CHT method.