• Title/Summary/Keyword: 고속 탐색

Search Result 472, Processing Time 0.025 seconds

Manufacturing Protein-DNA Chip for Depigmenting Agent Screening (전사인자 저해제 통한 미백제 탐색용 단백질 칩 제작)

  • Han Jung-Sun;Kwak Eun-Young;Lee Hyang-Bok;Shin Jlung-Hyun;Baek Seung-Hak;Chung Bong-Hyun;Kim Eun-Ki
    • Journal of the Society of Cosmetic Scientists of Korea
    • /
    • v.30 no.4 s.48
    • /
    • pp.479-483
    • /
    • 2004
  • An attempt was made to develop a proteinchip for screening of MITF (microphthalmia transcription factor) inhibitor. Binding of MITF to E-box causes transcription of several pigmenting genes including tyrosinase gene. We investigated binding of MITF and its DNA binding site (E-box) using a protein-DNA chip with various detection methods including flurorescence (Cyt3). SPR (surface plasmon resonance) and SPRi (surface plasmon resonance imaging). A fusion protein (MITF-Maltose Binding Protein) was attached on the glass plate by chemical modification. An inhibitory synthetic DNA oligomer, artificially designed based on the E-box sequence, inhibited the binding of MITF and E-box. These results showed the potentials of flurorescence-based MITF protein chip as a microarray for high throughput screening (HTS) system of depigmenting agents.

Development of a Comprehensive Performance Test Facility for Small Millimeter-wave Tracking Radar (소형 추적 레이다용 종합성능시험 시설 개발)

  • Kim, Hong-Rak;Kim, Youn-Jin;Woo, Seon-Keol;An, Se-Hwan
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.3
    • /
    • pp.121-127
    • /
    • 2020
  • The small tracking radar targets the target in a real-time, fast-moving, fast-moving target against aircraft with a large RCS that is maneuvering at low speed and a small RCS aircraft maneuvering at high speed (fighters, drones, helicopters, etc.) It is a pulsed radar that detects and tracks. Performing a performance test on a tracking radar in a real environment is expensive, and it is difficult to quantitatively measure performance in a real environment. Describes the composition of the laboratory environment's comprehensive performance test facility and the main requirements and implementation of each configuration.Anechoic chambers to simulate the room environment, simulation target generator to simulate the signal of the room target, target It is composed of a horn antenna driving device to simulate the movement of a vehicle and a Flight Motion Simulatior (FMS) to simulate the flight environment of a tracking radar, and each design and implementation has been described.

Low Energy Motion Estimation Architecture using Energy Management Algorithm (에너지 관리 알고리즘을 이용한 저전력 움직임 추정기 구조)

  • Kim Eung-sup;Lee Chanho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.8C
    • /
    • pp.793-800
    • /
    • 2005
  • Computation of multimedia data increases in portable devices with the advances of the mobile and personal communication services. The energy management of such devices is very important for the battery-powered operation hours. The motion estimation in a video encoder requires huge amount of computation, and hence, consumes the largest portion of the energy consumption. In this paper, we propose a novel architecture that a low energy management scheme can be applied with several fast-search algorithms. The energy-constrained Vdd hopping (ECVH) technique reduces power consumption of the motion estimation by adaptively changing the search algorithm, the operating frequency, and the supply voltage using the remaining slack time within given power-budget. We show that the ECVH can be applied to the architecture, and that the power consumption can be efficiently reduced.

Real-Time Object Detection System Based on Background Modeling in Infrared Images (적외선영상에서 배경모델링 기반의 실시간 객체 탐지 시스템)

  • Park, Chang-Han;Lee, Jae-Ik
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.4
    • /
    • pp.102-110
    • /
    • 2009
  • In this paper, we propose an object detection method for real-time in infrared (IR) images and PowerPC (PPC) and H/W design based on field programmable gate array (FPGA). An open H/W architecture has the advantages, such as easy transplantation of HW and S/W, support of compatibility and scalability for specification of current and previous versions, common module design using standardized design, and convenience of management and maintenance. Proposed background modeling for an open H/W architecture design decreases size of search area to construct a sparse block template of search area in IR images. We also apply to compensate for motion compensation when image moves in previous and current frames of IR sensor. Separation method of background and objects apply to adaptive values through time analysis of pixel intensity. Method of clutter reduction to appear near separated objects applies to median filter. Methods of background modeling, object detection, median filter, labeling, merge in the design embedded system execute in PFC processor. Based on experimental results, proposed method showed real-time object detection through global motion compensation and background modeling in the proposed embedded system.

A Novel Architecture for Dynamic Mobile Networks with IPv6-based Multiple Network Interfaces (IPv6 기반의 다중 네트워크 인터페이스를 갖는 새로운 동적 이동형 네트워크 아키텍쳐)

  • Kim Wan-Tae
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.8 s.350
    • /
    • pp.25-34
    • /
    • 2006
  • In this paper DynaMoNET is suggested as a novel IPv6-based multi-homed mobile network architecture which is composed of nested mobile ad hoc networks dynamically coming together through wireless personal area networks. Each ad hoc network has a mobile router which may work as a root mobile router instead of fixed mobile routers in a DynaMoNET. A root mobile router provides the reliable Internet connectivity for the entire mobile network. This paper includes a innovative handover protocol for multi-homed mobile networks, network switchover algorithm considering multiple decision factors, root mobile router election process based on token-based algorithm fast root mobile router discovery algorithm and fault avoidance mechanism to support reliable Internet connectivity. Finally the system architecture of a mobile router is given in detail.

A Fast Search Algorithm for Sub-Pixel Motion Estimation (부화소 움직임 추정을 위한 고속 탐색 기법)

  • Park, Dong-Kyun;Jo, Seong-Hyeon;Cho, Hyo-Moon;Lee, Jong-Hwa
    • Proceedings of the KIEE Conference
    • /
    • 2007.04a
    • /
    • pp.26-28
    • /
    • 2007
  • The motion estimation is the most important technique in the image compression of the video standards. In the case of next generation standards in the video codec as H.264, a high compression-efficiency can be also obtained by using a motion compensation. To obtain the accurate motion search, a motion estimation should be achieved up to 1/2 pixel and 1/4 pixel uiuts. To do this, the computational complexity is increased although the image compression rate is increased. Therefore, in this paper, we propose the advanced sub-pixel block matching algorithm to reduce the computational complexity by using a statistical characteristics of SAD(Sum of Absolute Difference). Generally, the probability of the minimum SAD values is high when searching point is in the distance 1 from the reference point. Thus, we reduced the searching area and then we can overcome the computational complexity problem. The main concept of proposed algorithm, which based on TSS(Three Step Search) method, first we find three minimum SAD points which is in integer distance unit, and then, in second step, the optimal point is in 1/2 pixel unit either between the most minimum SAD value point and the second minimum SAD point or between the most minimum SAD value point and the third minimum SAD point In third step, after finding the smallest SAD value between two SAD values on 1/2 pixel unit, the final optimized point is between the most minimum SAD value and the result value of the third step, in 1/2 pixel unit i.e., 1/4 pixel unit in totally. The conventional TSS method needs an eight.. search points in the sub-pixel steps in 1/2 pixel unit and also an eight search points in 1/4 pixel, to detect the optimal point. However, in proposed algorithm, only total five search points are needed. In the result. 23 % improvement of processing speed is obtained.

  • PDF

Skew Correction of Document Images using Edge (에지를 이용한 문서영상의 기울기 보정)

  • Ju, Jae-Hyon;Oh, Jeong-Su
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.7
    • /
    • pp.1487-1494
    • /
    • 2012
  • This paper proposes an algorithm detecting the skew of the degraded as well as the clear document images using edge and correcting it. The proposed algorithm detects edges in a character region selected by image complexity and generates projection histograms by projecting them to various directions. And then it detects the document skew by estimating the edge concentrations in the histograms and corrects the skewed document image. For the fast skew detection, the proposed algorithm uses downsampling and 3 step coarse-to-fine searching. In the skew detection of the clear and the degraded images, the maximum and the average detection errors in the proposed algorithm are about 50% of one in a conventional similar algorithm and the processing time is reduced to about 25%. In the non-uniform luminance images acquired by a mobile device, the conventional algorithm can't detect skews since it can't get valid binary images, while the proposed algorithm detect them with the average detection error of 0.1o or under.

($OntoFrame^{(R)}$;an Information Service System based on Semantic Web Technology (시맨틱 웹 기술 기반 정보서비스 시스템 $OntoFrame^{(R)}$)

  • Sung, Won-Kyung;Lee, Seung-Woo;Hahn, Sun-Hwa;Jung, Han-Min;Kim, Pyung;Lee, Mi-Kyung;Park, Dong-In
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2008.04a
    • /
    • pp.87-88
    • /
    • 2008
  • As an information service system based on semantic web technology, $OntoFrame^{(R)}$ takes aim at a framework for providing analysis and fusion services of academic information. It currently consists of three parts: ontologies representing knowledge schema derived from academic information, $OntoURI^{(R)}$ which makes academic information into knowledge, and $OntoReasoner^{(R)}$ which performs inference and search on the knowledge. Unlike existing search engines which provides simple search services, our system provides, based on semantic web technology, several semantic and analytic services such as year-based topic trends in academic information, related topics, topic-based researchers and institutes, researcher network, statistics and regional distribution of academic information.

  • PDF

A Study on the Fast Motion Estimation Coding by Moving Region Segmentation (동영역 분할에 의한 고속 움직임 추정 부호화에 관한 연구)

  • Lee, Bong-Ho;Choi, Kyung-Soo;Kwak, No-Youn;Hwang, Byong-Won
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.37 no.3
    • /
    • pp.88-97
    • /
    • 2000
  • This paper presents motion estimation method using region segmentation information Motion estimation which is very difficult to be implemented only by software because of intensive computation cost, is implemented by special-purpose hardware in real-time applications In this paper, we propose region based motion estimation algorithm which can reduce the computation cost by using region segmentation information and setting the variable search window compared with FSMA algorithm Secondly, another proposed algorithm is to segment semantic region like face for selective coding and transfer of semantic region using segmented region information This work alms to improving the subjective quality of skin color region or face region m the picture that has slow motion and IS mainly composed of one or two speakers of video conference and video telephony applications.

  • PDF

A study on the Improvement of Performance for H.264/AVC Encoder (H.264/AVC 부호기의 성능 향상에 관한 연구)

  • Kim Yong-Wook;Huh Do-Cuen
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.7
    • /
    • pp.1405-1409
    • /
    • 2004
  • This paper is studied new block mode decision algorithm for H.264/AVC. The fast block mode decision algorithm is consist of block range decision algorithm. The block range decision algorithm classifies the block over 8$\times$8 size or below for 16${\times}$16 macroblock to decide the size and type of sub blocks. As the sub blocks of 8$\times$8, 8r4, 4$\times$8 and 4$\times$4, which are the blocks below 8$\times$8 size, include important motion information, the exact sub block decision is required. RDC(RDO cost) is used as the matching parameter for the exact sub block decision. RDC is calculated with motion strength which is the mean value of neighbor pixels of each sub block. The sub block range decision reduces encoding arithmetic amount by 34.62% on the average more than the case not using block range decision. The block mode decision using motion strength shows improvement of PSNR of 0.05[dB].