• Title/Summary/Keyword: robust extraction

Search Result 427, Processing Time 0.028 seconds

Sound recognition and tracking system design using robust sound extraction section (주변 배경음에 강인한 구간 검출을 통한 음원 인식 및 위치 추적 시스템 설계)

  • Kim, Woo-Jun;Kim, Young-Sub;Lee, Gwang-Seok
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.11 no.8
    • /
    • pp.759-766
    • /
    • 2016
  • This paper is on a system design of recognizing sound sources and tracing locations from detecting a section of sound sources which is strong in surrounding environmental sounds about sound sources occurring in an abnormal situation by using signals within the section. In detection of the section with strong sound sources, weighted average delta energy of a short section is calculated from audio signals received. After inputting it into a low-pass filter, through comparison of values of the output result, a section strong in background sound is defined. In recognition of sound sources, from data of the detected section, using an HMM(: Hidden Markov Model) as a traditional recognition method, learning and recognition are realized from creating information to recognize sound sources. About signals of sound sources that surrounding background sounds are included, by using energy of existing signals, after detecting the section, compared with the recognition through the HMM, a recognition rate of 3.94% increase is shown. Also, based on the recognition result, location grasping by using TDOA(: Time Delay of Arrival) between signals in the section accords with 97.44% of angles of a real occurrence location.

Development of Feature Points Detection Algorithm for Measuring of Pulse Wave Velocity (맥파 전달 속도(PWV) 측정을 위한 특징점 검출 알고리즘 개발)

  • Choi, Jung-Hyeon;Cho, Wook-Hyun;Park, Jun-Ho;Kim, Nam-Hoon;Seong, Hyang-Sook;Cho, Jong-Man
    • Journal of Sensor Science and Technology
    • /
    • v.20 no.5
    • /
    • pp.343-350
    • /
    • 2011
  • The compliance and stiffness of artery are closely related with disease of arteries. Pulse wave velocity(PWV) in the blood vessel is a basic and common parameter in the hemodynamics of blood pressure and blood flow wave traveling in arteries because the PWV is affected directly by the conditions of blood vessels. However, there is no standardized method to measure the PWV and it is difficult to measure. The conventional PWV measurement has being done by manual calculation of the pulse wave transmission time between coronary arterial proximal and distal points on a strip chart on which the pulse wave and ECG signal are recorded. In this study, a pressure sensor consisting of strain gauges is used to measure the blood pressure of arteries in invasive method and regular ECG electrodes are used to record the ECG signal. The R-peak point of ECG is extracted by using a reference level and time windowing technique and the ascending starting point of blood pressure is determined by using differentiation of the blood pressure signal and time windowing technique. The algorithm proposed in this study, which can measure PWV automatically, shows robust and good results in the extraction of feature points and calculation of PWV.

The Implementation of the Digital watermarking for 3D Polygonal Model (3차원 형상 모델의 디지털 워터마킹 구현)

  • Kim, Sun-Hyung;Lee, Sun-Heum;Kim, Gee-Seog;Ahn, Deog-Sang
    • The KIPS Transactions:PartD
    • /
    • v.9D no.5
    • /
    • pp.925-930
    • /
    • 2002
  • This paper discusses techniques for embedding data into 3D polygonal models of geometry. Much researches of Watermarking had been gone as element technology of DRM (digital rights management). But, few research had gone to 3D polygonal model. Most research is limited at text document, 2D image, animation, music etc. RP system is suitable a few production in various goods species, and it is used much in industry to possible reason that produce prototype and find error or incongruent factor at early stage on design in product development childhood. This paper is research about method that insert watermark in STL ( stereolithography) file that have 3D shape model. Proposed algorithm inserts watermark in normal vector region and facet's interior region of 3D shape data. For this reason, 3D shape does not produce some flexure and fulfill invisibility of watermark. Experiment results that insert and extract watermark in normal netter region and facet's Interior region of 3D shape data by proposed algorithm do not influence entirely in 3D shape and show that insertion and extraction of watermark are possible.

A Robust Marker Detection Algorithm Using Hybrid Features in Augmented Reality (증강현실 환경에서 복합특징 기반의 강인한 마커 검출 알고리즘)

  • Park, Gyu-Ho;Lee, Heng-Suk;Han, Kyu-Phil
    • The KIPS Transactions:PartA
    • /
    • v.17A no.4
    • /
    • pp.189-196
    • /
    • 2010
  • This paper presents an improved marker detection algorithm using hybrid features such as corner, line segment, region, and adaptive threshold values, etc. In usual augmented reality environments, there are often marker occlusion and poor illumination. However, existing ARToolkit fails to recognize the marker in these situations, especially, partial concealment of marker by user, large change of illumination and dim circumstances. In order to solve these problems, the adaptive threshold technique is adopted to extract a marker region and a corner extraction method based on line segments is presented against marker occlusions. In addition, a compensating method, corresponding the marker size and center between registered and extracted one, is proposed to increase the template matching efficiency, because the inside marker size of warped images is slightly distorted due to the movement of corner and warping. Therefore, experimental results showed that the proposed algorithm can robustly detect the marker in severe illumination change and occlusion environment and use similar markers because the matching efficiency was increased almost 30%.

Panoramic Image Composition Algorithm through Scaling and Rotation Invariant Features (크기 및 회전 불변 특징점을 이용한 파노라마 영상 합성 알고리즘)

  • Kwon, Ki-Won;Lee, Hae-Yeoun;Oh, Duk-Hwan
    • The KIPS Transactions:PartB
    • /
    • v.17B no.5
    • /
    • pp.333-344
    • /
    • 2010
  • This paper addresses the way to compose paronamic images from images taken the same objects. With the spread of digital camera, the panoramic image has been studied to generate with its interest. In this paper, we propose a panoramic image generation method using scaling and rotation invariant features. First, feature points are extracted from input images and matched with a RANSAC algorithm. Then, after the perspective model is estimated, the input image is registered with this model. Since the SURF feature extraction algorithm is adapted, the proposed method is robust against geometric distortions such as scaling and rotation. Also, the improvement of computational cost is achieved. In the experiment, the SURF feature in the proposed method is compared with features from Harris corner detector or the SIFT algorithm. The proposed method is tested by generating panoramic images using $640{\times}480$ images. Results show that it takes 0.4 second in average for computation and is more efficient than other schemes.

Line Drawings from 2D Images (이차원 영상의 라인 드로잉)

  • Son, Min-Jung;Lee, Seung-Yong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.12
    • /
    • pp.665-682
    • /
    • 2007
  • Line drawing is a widely used style in non-photorealistic rendering because it generates expressive descriptions of object shapes with a set of strokes. Although various techniques for line drawing of 3D objects have been developed, line drawing of 2D images has attracted little attention despite interesting applications, such as image stylization. This paper presents a robust and effective technique for generating line drawings from 2D images. The algorithm consists of three parts; filtering, linking, and stylization. In the filtering process, it constructs a likelihood function that estimates possible positions of lines in an image. In the linking process, line strokes are extracted from the likelihood function using clustering and graph search algorithms. In the stylization process, it generates various kinds of line drawings by applying curve fitting and texture mapping to the extracted line strokes. Experimental results demonstrate that the proposed technique can be applied to the various kinds of line drawings from 2D images with detail control.

Automatic Heart Segmentation in a Cardiac Ultrasound Image (초음파 심장 영상에서 자동 심장 분할 방법)

  • Lee, Jae-Jun;Kim, Dong-Sung
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.4
    • /
    • pp.418-426
    • /
    • 2006
  • This paper proposes a robust and efficient segmentation method for a cardiac ultrasound image taken from a probe inserted into the heart in surgery. The method consists of three steps: initial boundary extraction, whole boundary modification using confidence competition, and local boundary modification using the rolling spoke method. Firstly, the initial boundary is extracted with threshold regions along the global spokes emitted from the center of an ultrasound probe. Secondly, high confidence boundary edges are detected along the global spokes by competing among initial boundary candidate and new candidates achieved by edge and appearance information. finally, the boundary is modified by rolling local spokes along concave regions that are difficult to extract using the global spokes. The proposed method produces promising segmentation results for the ultrasound cardiac images acquired during surgery.

Automatic Face Extraction with Unification of Brightness Distribution in Candidate Region and Triangle Structure among Facial Features (후보영역의 밝기 분산과 얼굴특징의 삼각형 배치구조를 결합한 얼굴의 자동 검출)

  • 이칠우;최정주
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.1
    • /
    • pp.23-33
    • /
    • 2000
  • In this paper, we describe an algorithm which can extract human faces with natural pose from complex backgrounds. This method basically adopts the concept that facial region has the nearly same gray level for all pixels within appropriately scaled blocks. Based on the idea, we develop a hierarchial process that first, a block image data with pyramid structure of input image is generated, and some candidate regions for facial regions in the block image are Quickly determined, then finally the detailed facial features; organs are decided. To find the features easily, we introduce a local gray level transform which emphasizes dark and small regions, and estimate the geometrical triangle constraints among the facial features. The merit of our method is that we can be freed from the parameter assignment problem since the algorithm utilize a simple brightness computation, consequently robust systems not being depended on specific parameter values can be easily constructed.

  • PDF

Robust Detection of Body Areas Using an Adaboost Algorithm (에이다부스트 알고리즘을 이용한 인체 영역의 강인한 검출)

  • Jang, Seok-Woo;Byun, Siwoo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.17 no.11
    • /
    • pp.403-409
    • /
    • 2016
  • Recently, harmful content (such as images and photos of nudes) has been widely distributed. Therefore, there have been various studies to detect and filter out such harmful image content. In this paper, we propose a new method using Haar-like features and an AdaBoost algorithm for robustly extracting navel areas in a color image. The suggested algorithm first detects the human nipples through color information, and obtains candidate navel areas with positional information from the extracted nipple areas. The method then selects real navel regions based on filtering using Haar-like features and an AdaBoost algorithm. Experimental results show that the suggested algorithm detects navel areas in color images 1.6 percent more robustly than an existing method. We expect that the suggested navel detection algorithm will be usefully utilized in many application areas related to 2D or 3D harmful content detection and filtering.

Automatic Generation of GCP Chips from High Resolution Images using SUSAN Algorithms

  • Um Yong-Jo;Kim Moon-Gyu;Kim Taejung;Cho Seong-Ik
    • Proceedings of the KSRS Conference
    • /
    • 2004.10a
    • /
    • pp.220-223
    • /
    • 2004
  • Automatic image registration is an essential element of remote sensing because remote sensing system generates enormous amount of data, which are multiple observations of the same features at different times and by different sensor. The general process of automatic image registration includes three steps: 1) The extraction of features to be used in the matching process, 2) the feature matching strategy and accurate matching process, 3) the resampling of the data based on the correspondence computed from matched feature. For step 2) and 3), we have developed an algorithms for automated registration of satellite images with RANSAC(Random Sample Consensus) in success. However, for step 1), There still remains human operation to generate GCP Chips, which is time consuming, laborious and expensive process. The main idea of this research is that we are able to automatically generate GCP chips with comer detection algorithms without GPS survey and human interventions if we have systematic corrected satellite image within adaptable positional accuracy. In this research, we use SUSAN(Smallest Univalue Segment Assimilating Nucleus) algorithm in order to detect the comer. SUSAN algorithm is known as the best robust algorithms for comer detection in the field of compute vision. However, there are so many comers in high-resolution images so that we need to reduce the comer points from SUSAN algorithms to overcome redundancy. In experiment, we automatically generate GCP chips from IKONOS images with geo level using SUSAN algorithms. Then we extract reference coordinate from IKONOS images and DEM data and filter the comer points using texture analysis. At last, we apply automatically collected GCP chips by proposed method and the GCP by operator to in-house automatic precision correction algorithms. The compared result will be presented to show the GCP quality.

  • PDF