• Title/Summary/Keyword: 탐색율

Search Result 748, Processing Time 0.025 seconds

Improvement of ELV Recycling Technology - Focused on achievement of ELV recycling rate 95% - (자동차 재활용의 진보 - 자동차 재활용율 95%의 탐색 -)

  • Oh, Jae-Hyun
    • Resources Recycling
    • /
    • v.23 no.2
    • /
    • pp.71-80
    • /
    • 2014
  • In order to survey the numerical achievement of ELV recycling rate 95%, the definition of ELV recycling rate, material components of the automobile, improvement of ELV dismantling technology and status of ASR recycling were reviewed. On the other hand, field survey in details for dismantling works were conducted at Incheon Junkyard and H Junkyard. Although material recycling rate has been approaching 94% in dismantling step, status of ASR recycling is very unstable due to a ban of ASR recycling at cement kiln. It is clear that ASR recycling acts as a bottle neck in the ELV recycling. Therefore, it is important energy recycling of ASR should be enlarged to achieve ELV recycling rate 95%.

A Study on the Variance Based Self-similar Block Search for Fractal Image Compression (프랙탈 이미지 압축을 위한 분산 기반 유사 블록 탐색 연구)

  • Ham, Do-Yong;Kim, Jong-Gu;Kim, Ha-Jin;Wi, Yeong-Cheol
    • Journal of the Korea Computer Graphics Society
    • /
    • v.7 no.1
    • /
    • pp.11-17
    • /
    • 2001
  • Fractal image coding provides many promising qualities including the high compression ratio. The coding process however suffers from the long search time of domain block pool because the size of the domain block pool is often very large. In this paper, we introduce a hybrid domain block pool search method that combines the block classification and the variance based searching. This hybrid method makes use of the fact that the variance of a block is independent of the block classification. Thus, this hybrid method enhances the search speed by up to an O(number of classes) factor over the purely variance based searching method. An experimental result shows that our method enhances the search speed by up to 17 times over the purely variance based searching method. We also propose an adjustable variance based searching method that further enhances the search speed without noticeable loss of image quality.

  • PDF

Fast Motion Estimation with Adaptive Search Range Adjustment using Motion Activities of Temporal and Spatial Neighbor Blocks (시·공간적 주변 블록들의 움직임을 이용하여 적응적으로 탐색 범위 조절을 하는 고속 움직임 추정)

  • Lee, Sang-Hak
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.5 no.4
    • /
    • pp.372-378
    • /
    • 2010
  • This paper propose the fast motion estimation algorithm with adaptive search range adjustment using motion activities of temporal and spatial neighbor blocks. The existing fast motion estimation algorithms with adaptive search range adjustment use the maximum motion vector of all blocks in the reference frame. So these algorithms may not control a optimum search range for slow moving block in current frame. The proposed algorithm use the maximum motion vector of neighbor blocks in the reference frame to control a optimum search range for slow moving block. So the proposed algorithm can reduce computation time for motion estimation. The experiment results show that the proposed algorithm can reduce the number of search points about 15% more than Simple Dynamic Search Range(SDSR) algorithm while maintaining almost the same bit-rate and motion estimation error.

Fast Block Motion Estimation Using the Characteristics of the Motion in Search Region (탐색 영역에서의 움직임 특성을 이용한 고속 블록 움직임 추정)

  • 최정현;박대규;정태연;이경환;이법기;김덕규
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.1B
    • /
    • pp.167-174
    • /
    • 2000
  • The three-step search(TSS) algorithm, a simple and gradual motion estimation algorithm, has been widely used in some low bit-rate video compression. We propose a new fast block motion estimation algorithm using the characteristics of motion in search region. Most of motion vectors exist in the center region of search area, so the notion in that region is examined more closely than TSS in this paper. Also in a search step, motion vector is estimated in the local area which is not overlapped with the search area in previous step, considering the all possible direction of motion. Therefore, we get the better motion estimation and reduce computational time in compared with the conventional methods.

  • PDF

Development of Artificial Intelligence Processing Embedded System for Rescue Requester search (소방관의 요구조자 탐색을 위한 인공지능 처리 임베디드 시스템 개발)

  • La, Jong-Pil;Park, Hyun Ju
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.12
    • /
    • pp.1612-1617
    • /
    • 2020
  • Recently, research to reduce the accident rate by actively adopting artificial intelligence technology in the field of disaster safety technology is spreading. In particular, it is important to quickly search the Rescue Requester in order to effectively perform rescue activities at the disaster site. However, it is difficult to search for Rescue Requester due to the nature of the disaster environment. In this paper, We intend to develop an artificial intelligence system that can be operated in a smart helmet for firefighters to search for a rescue requester. To this end, the optimal SoC was selected and developed as an embedded system, and by testing a general-purpose artificial intelligence S/W, the embedded system for future smart helmet research was verified to be suitable as an artificial intelligence S/W operating platform.

Motion Estimation Algorithm Using Variance and Adaptive Search Range for Frame Rate Up-Conversion (프레임 율 향상을 위한 분산 및 적응적 탐색영역을 이용한 움직임 추정 알고리듬)

  • Yu, Songhyun;Jeong, Jechang
    • Journal of Broadcast Engineering
    • /
    • v.23 no.1
    • /
    • pp.138-145
    • /
    • 2018
  • In this paper, we propose a new motion estimation algorithm for frame rate up-conversion. The proposed algorithm uses the variance of errors in addition to SAD in motion estimation to find more accurate motion vectors. Then, it decides which motion vectors are wrong using the variance of neighbor motion vectors and the variance between current motion vector and neighbor's average motion vector. Next, incorrect motion vectors are corrected by weighted sum of eight neighbor motion vectors. Additionally, we propose adaptive search range algorithm, so we can find more accurate motion vectors and reduce computational complexity at the same time. As a result, proposed algorithm improves the average peak signal-to-noise ratio and structural similarity up to 1.44 dB and 0.129, respectively, compared with previous algorithms.

An Efficient Mode Decision and Search Region Restriction for Fast Encoding of H.264/AVC (H.264/AVC의 빠른 부호화를 위한 효율적인 모드 결정과 탐색영역 제한)

  • Chun, Sung-Hwan;Shin, Kwang-Mu;Kang, Jin-Mi;Chung, Ki-Dong
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.2
    • /
    • pp.185-195
    • /
    • 2010
  • In this paper, we propose an efficient inter and intra prediction algorithms for fast encoding of H.264/AVC. First, inter prediction mode decision method decides early using temporal/spatial correlation information and pixel direction information. Second, intra prediction mode decision method selects block size judging smoothness degree with inner/outer pixel value variation and decides prediction mode using representative pixel and reference pixel. Lastly, adaptive motion search region restriction sets search region using mode information of neighboring block and predicted motion vector. The experimental results show that proposed method can achieve about 18~53% reduction compared with the existing JM 14.1 in the encoding time. In RD performance, the proposed method does not cause significant PSNR value losses while increasing bitrates slightly.

Stereoscopic Image Compression and Transmission Using Disparity Information and MPEG-2′s Scalability (시차정보와 MPEG-2의 스케일러빌리티를 이용한 입체영상 압축 및 전송)

  • 민재홍;백중환
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.2 no.2
    • /
    • pp.20-27
    • /
    • 2001
  • 3D image coding and transmission technologies are essential for transmitting 3D image information through the limited transmission channel, and very important in the area of information and telecommunication services using 3D image media. In this paper, we propose the 3D image coding and transmission methods welch use disparity information and MPEG-2's scalability. Left and Fight image sequences are coded in base layer and enhancement layer, respectively. The enhancement layer contains the disparity and prediction informations. In order to reduce searching time for disparity information, we propose a method in which the disparity information of previous image paid is used in the next image pair, and we adopt the bit rate control method proposed in MPEG-2 TM6. An experimental result showed that the proposed searching method considerably reduced the entire encoding time and reached the desired bit rates.

  • PDF

Channel Assignment for RFID Readers in Dense Reader Environments (밀집리더환경에서 RFID 리더를 위한 채널 할당)

  • Sohn, Surgwon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.2
    • /
    • pp.69-76
    • /
    • 2013
  • Reader-to-reader interference in RFID system is occurred due to the use of limited number of frequencies, and this is the main cause of read rate reduction in the passive RFID tags. Therefore, in order to maximize the read rate under the circumstances of limited frequency resources, it is necessary to minimize the frequency interference among RFID readers. This paper presents a hybrid FDM/TDM constraint satisfaction problem models for frequency interference minimization problems of the RFID readers, and assigns optimal channels to each readers using conventional backtracking search algorithms. A depth first search based on backtracking are accomplished to find solutions of constraint satisfaction problems. At this moment, a variable ordering algorithm is very important to find a solution quickly. Variable ordering algorithms applied in the experiment are known as efficient in the graph coloring. To justify the performance of the proposed constraint satisfaction problem model, optimal channels for each readers in the passive UHF RFID system are allocated by using computer simulation satisfying various interference constraints.

An Explorative Case Study of Flipped College General English Class (대학 일반영어 플립드 러닝 수업 방식의 탐색적 사례연구)

  • Kim, Young-hee
    • Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
    • /
    • v.9 no.5
    • /
    • pp.259-271
    • /
    • 2019
  • The purpose of this study is to examine the potential of flip learning in Korea and to explore the possibilities of university English education. To this end, participants are sought for classes wherein general English class is taught and the researcher is in charge of teaching. 25 students of media-English class is chosen for the study. Instruments for the study include class evaluation and feedbacks, mid-term and final exams, group performative evaluation, on-line class views and participations. The findings of the study are: As students progress in flipped learning classes, their exam results significantly improved, and their performative evaluation results also improved significant across different groups. The effects are more eminent among higher levels of students, but students with mid and low level of English still improved significantly once they engage themselves in preview activity on a regular basis and self-directedly.