• Title/Summary/Keyword: Detection Space

Search Result 1,638, Processing Time 0.028 seconds

Face Detection in Color Image

  • Chunlin Jino;Park, Yeongmi;Euiyoung Cha
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10b
    • /
    • pp.559-561
    • /
    • 2003
  • Human face detection plays an important role in variable applications. A face detection method based on skin-color information and facial feature in color images is proposed in this paper. First, the RGB color space is transformed to YCbCr space and only the skin region is extracted with the skin color information. And then, the candidate where face is likely to exist is selected after labeling processing. Finally, we detect facial features in face candidate. The experimental results show that the method proposed here is effective.

  • PDF

STBC-OFDM Decoding Method for Fast-Fading Channels

  • Lee, Kyu-In;Kim, Jae-Kwon;Cho, Yong-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.2C
    • /
    • pp.160-165
    • /
    • 2007
  • In this paper, we propose a novel signal detection method that achieves the maximum likelihood (ML) performance but requires much less computational complexity than the ML detection. When the well-known linear decoding method is used for space-time block coded (STBC) OFDM systems in fast-fading channels, co-channel interference (CCI) as well as inter-carrier interference (ICI) occurs. A maximum likelihood (ML) method can be employed to deal with the CCI; however, its computational complexity is very high. In this paper, we propose a signal detection method for orthogonal space-time coded OFDM systems that achieves the similar error performance as the ML method, but requires much less computational complexity.

Simplified Maximum-Likelihood Decoder for V-BLAST Architecture

  • Le Minh-Tuan;Pham Van-Su;Mai Linh;Yoon Giwan
    • Journal of information and communication convergence engineering
    • /
    • v.3 no.2
    • /
    • pp.76-79
    • /
    • 2005
  • In this paper, a low-complexity maximum-likelihood (ML) decoder based on QR decomposition, called real-valued LCMLDec decoder or RVLCMLDec for short, is proposed for the Vertical Bell Labs Layered Space-Time (V-BLAST) architecture, a promising candidate for providing high data rates in future fixed wireless communication systems [1]. Computer simulations, in comparison with other detection techniques, show that the proposed decoder is capable of providing the V­BLAST schemes with ML performance at low detection complexity

Automatic face detection using chromaticity space and deformable templates

  • Lee, Kwansu;Lee, Sung-Oh;Lee, Byung-Ju;Park, Gwi-Tae
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.28.1-28
    • /
    • 2001
  • An automatic face recognition(AFR) of individuals is a significant problem in the development of computer vision. An AFR consists of two major parts which are detection of face region and recognition process, and the overall performance of AFR is determined by each. In this paper, the face region is acquired using chromaticity space, but this face region is a simple rectangle which doesn´t consider the shape information. By applying deformable templates to the face region, we can locate the position of the eyes in images. With the face region and the eye location information, more precise face region can be extract from the image. Because processing time is critical in real-time system, we use simplified eye templates and the modified energy function for the efficiency. We can get a good detection performance in experiments.

  • PDF

Robust architecture search using network adaptation

  • Rana, Amrita;Kim, Kyung Ki
    • Journal of Sensor Science and Technology
    • /
    • v.30 no.5
    • /
    • pp.290-294
    • /
    • 2021
  • Experts have designed popular and successful model architectures, which, however, were not the optimal option for different scenarios. Despite the remarkable performances achieved by deep neural networks, manually designed networks for classification tasks are the backbone of object detection. One major challenge is the ImageNet pre-training of the search space representation; moreover, the searched network incurs huge computational cost. Therefore, to overcome the obstacle of the pre-training process, we introduce a network adaptation technique using a pre-trained backbone model tested on ImageNet. The adaptation method can efficiently adapt the manually designed network on ImageNet to the new object-detection task. Neural architecture search (NAS) is adopted to adapt the architecture of the network. The adaptation is conducted on the MobileNetV2 network. The proposed NAS is tested using SSDLite detector. The results demonstrate increased performance compared to existing network architecture in terms of search cost, total number of adder arithmetics (Madds), and mean Average Precision(mAP). The total computational cost of the proposed NAS is much less than that of the State Of The Art (SOTA) NAS method.

Forest Fire Detection and Identification Using Image Processing and SVM

  • Mahmoud, Mubarak Adam Ishag;Ren, Honge
    • Journal of Information Processing Systems
    • /
    • v.15 no.1
    • /
    • pp.159-168
    • /
    • 2019
  • Accurate forest fires detection algorithms remain a challenging issue, because, some of the objects have the same features with fire, which may result in high false alarms rate. This paper presents a new video-based, image processing forest fires detection method, which consists of four stages. First, a background-subtraction algorithm is applied to detect moving regions. Secondly, candidate fire regions are determined using CIE $L{\ast}a{\ast}b{\ast}$ color space. Thirdly, special wavelet analysis is used to differentiate between actual fire and fire-like objects, because candidate regions may contain moving fire-like objects. Finally, support vector machine is used to classify the region of interest to either real fire or non-fire. The final experimental results verify that the proposed method effectively identifies the forest fires.

Analysis and Detection of Malicious Data Hidden in Slack Space on OOXML-based Corrupted MS-Office Digital Files

  • Sangwon Na;Hyung-Woo Lee
    • International journal of advanced smart convergence
    • /
    • v.12 no.1
    • /
    • pp.149-156
    • /
    • 2023
  • OOXML-based MS-Office digital files are extensively utilized by businesses and organizations worldwide. However, OOXML-based MS-Office digital files are vulnerable to forgery and corruption attack by including hidden suspicious information, which can lead to activating malware or shell code being hidden in the file. Such malicious code can cause a computer system to malfunction or become infected with ransomware. To prevent such attacks, it is necessary to analyze and detect the corruption of OOXML-based MS-Office files. In this paper, we examine the weaknesses of the existing OOXML-based MS-Office file structure and analyzes how concealment and forgery are performed on MS-Office digital files. As a result, we propose a system to detect hidden data effectively and proactively respond to ransomware attacks exploiting MS-Office security vulnerabilities. Proposed system is designed to provide reliable and efficient detection of hidden data in OOXML-based MS-Office files, which can help organizations protect against potential security threats.

Improvement of free-space optical interconnection efficiency by using circular aperture CGH

  • Shin, Chang-Mok;Seo, Dong-Hoan;Cho, Kyu-Bo;Kim, Cheol-Su;Lee, Ha-Woon;Kim, Soo-Joong
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.9-11
    • /
    • 2002
  • We improve the free-space optical interconnection efficiency by using circular aperture computer-generated hologram (CGH). In free-space optical interconnection system using CGH, the single CGH is composed of sub-CGHs, which can change the direction of input beams to desired output positions, by Fourier transform. Each sub-CGH is rectangular shape, so the input beams through each sub-CGH are transformed to sinc functions in output plane. The side lobes of each sinc function are superimposed in output plane and they result in detection error in output plane, so the detection efficiency is low. We use the circular shaped sub-CGHs in order to reduce the side lobe value in output plane instead of rectangular shaped sub-CGHs. The each input beam is transformed to first-order Bessel functions through circular shaped sub-CGHs in output plane. The side lobes of first-order Bessel functions us low values compared with side lobes of sinc function, so we can improve the detection efficiency in output plane. We use binary phase modulated CGH, and confirm this improvement results by simulation.

  • PDF

PLANETARY CAUSTIC PERTURBATIONS OF A CLOSE-SEPARATION PLANET ON MICROLENSING

  • Ryu, Yoon-Hyun;Kim, Han-Seek;Chung, Sun-Ju;Kim, Dong-Jin
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.41 no.1
    • /
    • pp.77.1-77.1
    • /
    • 2016
  • We investigate the properties and detection conditions for the planetary caustic perturbation of close-separation planets. To find the properties of the planetary caustic perturbation, we construct deviation maps by subtracting the single-lensing magnification of the lens star from the planetary lensing magnification for various lensing parameters. We find that each deviation area of the positive and negative perturbations disappears at the same normalized source radius according to a given deviation threshold regardless of mass ratio but disappears at a different normalized source radius according to the separation. We also estimate the upper limit of the normalized source radius to detect the planetary caustic perturbation. We find simple relations between the upper limit of the normalized source radius and the lensing parameters. From the relations, we obtain an analytic condition for the detection limit of the planet, and which show that we can sufficiently discover a planet with the mass of sub-Earth for typical microlensing events. Therefore, we expect to add the number of low-mass planets in the next-generation microlensing experiments and conclude that our detection condition of the planet can be used as a important criteria for maximal planet detections considering the source type and the photometric accuracy.

  • PDF

Depth-first branch-and-bound-based decoder with low complexity (검출 복잡도를 감소 시키는 Depth-first branch and bound 알고리즘 기반 디코더)

  • Lee, Eun-Ju;Kabir, S.M.Humayun;Yoon, Gi-Wan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.12
    • /
    • pp.2525-2532
    • /
    • 2009
  • In this paper, a fast sphere decoder is proposed for the joint detection of phase-shift keying (PSK) signals in uncoded Vertical Bell Laboratories Layered Space Time (V-BLAST) systems. The proposed decoder, PSD, consists of preprocessing stage and search stage. The search stage of PSD relies on the depth-first branch-and-bound (BB) algorithm with "best-first" orders stored in lookup tables. Simulation results show that the PSD is able to provide the system with the maximum likelihood (ML) performance at low complexity.