• Title/Summary/Keyword: 스캔효율

Search Result 265, Processing Time 0.025 seconds

Efficient Path Finding Based on the $A^*$ algorithm for Processing k-Nearest Neighbor Queries in Road Network Databases (도로 네트워크에서 $A^*$ 알고리즘을 이용한 k-최근접 이웃 객체에 대한 효과적인 경로 탐색 방법)

  • Shin, Sung-Hyun;Lee, Sang-Chul;Kim, Sang-Wook;Lee, Jung-Hoon;Im, Eul-Kyu
    • Journal of KIISE:Databases
    • /
    • v.36 no.5
    • /
    • pp.405-410
    • /
    • 2009
  • This paper proposes an efficient path finding scheme capable of searching the paths to k static objects from a given query point, aiming at both improving the legacy k-nearest neighbor search and making it easily applicable to the road network environment. To the end of improving the speed of finding one-to-many paths, the modified A* obviates the duplicated part of node scans involved in the multiple executions of a one-to-one path finding algorithm. Additionally, the cost to the each object found in this step makes it possible to finalize the k objects according to the network distance from the candidate set as well as to order them by the path cost. Experiment results show that the proposed scheme has the accuracy of around 100% and improves the search speed by $1.3{\sim}3.0$ times of k-nearest neighbor searches, compared with INE, post-Dijkstra, and $na{\ddot{i}}ve$ method.

High Resolution Cyclostationary Spectrum Sensing for ATSC Signal Detection (ATSC 신호 검출을 위한 고분해능 사이클로스테이션너리(Cyclostationary) 스펙트럼 센싱)

  • Yoo, Do-Sik;Lim, Jong-Tae;Kang, Min-Hong;Lim, Sun-Min
    • Journal of Advanced Navigation Technology
    • /
    • v.13 no.3
    • /
    • pp.378-384
    • /
    • 2009
  • In this paper, we consider a cyclostationary-feature-detection based spectrum sensing algorithm for ATSC signal detection. One of the proposed algorithms for IEEE 802.22 standardization organization which meet the requirements of IEEE 802.22 is Thomson's algorithm based on cyclostationary feature detection. We propose an interpolation-based spectrum sensing algorithm for ATSC signal detection, which has less computation complexity than that of Thomson's algorithm and provides no performance loss compared to Thomson's algorithm. By using zero-padding in time domain and effective sensing scanning method, the proposed algorithm requires less computational complexity and shows no performance degradation compared to Thomson's algorithm.

  • PDF

Tyue Classification of Korean Characters Considering Relative Type Size (유형의 상대적 크기를 고려한 한글문자의 유형 분류)

  • Kim, Pyeoung-Kee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.6 s.44
    • /
    • pp.99-106
    • /
    • 2006
  • Type classification is a very needed step in recognizing huge character set language such as korean characters. Since most previous researches are based on the composition rule of Korean characters, it has been difficult to correctly classify composite vowel characters and problem space was not divided equally for the lack of classification of last consonant which is relatively bigger than other graphemes. In this paper, I Propose a new type classification method in which horizontal vowel is extracted before vortical vowel and last consonants are further classified into one of five small groups based on horizontal projection profile. The new method uses 19 character types which is more stable than previous 6 types or 15 types. Through experiments on 1.000 frequently used character sets and 30.614 characters scanned from several magazines, I showed that the proposed method is more useful classifying Korean characters of huge set.

  • PDF

An Active Candidate Set Management Model for Realtime Association Rule Discovery (실시간 연관규칙 탐사를 위한 능동적 후보항목 관리 모델)

  • Sin, Ye-Ho;Ryu, Geun-Ho
    • The KIPS Transactions:PartD
    • /
    • v.9D no.2
    • /
    • pp.215-226
    • /
    • 2002
  • Considering the rapid process of media's breakthrough and diverse patterns of consumptions's analysis, a uniform analysis might be much rooms to be desired for interpretation of new phenomena. In special, the products happening intensive sails on around an anniversary or fresh food have the restricted marketing hours. Moreover, traditional association rule discovery algorithms might not be appropriate for analysis of sales pattern given in a specific time because existing approaches require iterative scan operation to find association rule in large scale transaction databases. in this paper, we propose an incremental candidate set management model based on twin-hashing technique to find association rule in special sales pattern using database trigger and stored procedure. We also prove performance of the proposed model through implementation and experiment.

The study of optimal reduced-graphene oxide line patterning by using femtosecond laser pulse (펨토초 레이저 펄스를 이용한 환원된 그래핀의 최소 선폭 패턴 구현에 관한 연구)

  • Jeong, Tae-In;Kim, Seung-Chul
    • Journal of the Korea Convergence Society
    • /
    • v.11 no.7
    • /
    • pp.157-162
    • /
    • 2020
  • In recent years, laser induced graphene process have been intensively studied for eco-friendly electronic device such as flexible electronics or thin film based energy storage devices because of its simple and effective process. In order to increase the performance and efficiency of an electronic device using such a graphene patterned structure, it is essential to study an optimized laser patterning condition as small as possible linewidth while maintaining the graphene-specific 2-dimensional characteristics. In this study, we analyzed to find the optimal line pattern by using a Ti:sapphire femtosecond laser based photo-thermal reduction process. we tuned intensity and scanning speed of laser spot for generating effective graphene characteristic and minimum thermal effect. As a result, we demonstrated the reduced graphene pattern of 30㎛ in linewidth by using a focused laser beam of 18㎛ in diameter.

UHF RFID Tag Antenna for a Blood Bag and BIS (Blood Information System) (혈액백용 UHF RFID Tag 안테나와 혈액관리용 시스템)

  • Choi, Jae-Han;Jeon, Byung-Don;Chung, You-Chung
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.1
    • /
    • pp.102-107
    • /
    • 2011
  • The current blood control system is using barcode and scanning one by one to manage blood bags. To have better management and accuracy, an RFID BIS (blood information system) is implemented with an UHF RFID tag antenna using a reflecter for a blood bag has been used.. The UHF RFID tag for blood bag, attached on the high permittivity blood, is designed and fabricated. The tag antenna is optimized and fabricated with the simulation tests such as the existence and nonexistence of the reflector, various distance between the reflector and the dipole tag, the different widths of the reflector and the existence and nonexistence of the T-matching structure. The characteristics and the reading range patterns of the tag antennas are measured. The BIS is implemented with the new tag design.

A Study on the Development of Barcode Laser Scanner Using Optical Information Processing (광 정보처리를 이용한 바코드 레이저 스캐너 개발연구)

  • Shin, Kwang-Yong;Ihm, Jong-Tae;Eun, Jae-Jung;Kim, Nam;Park, Han-Kyu
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.1
    • /
    • pp.69-77
    • /
    • 1989
  • A hologram scanner for POS bar code symb9ol readers has been developed. This system is composed of scanning optics, optical detector, video signal circuitary and preprocessor. In contrast to conventional scanners using polygonal mirrors, which complicate the scanning optics, the hologram scanner developed in this research was made up with simple optics and higher reading performance was achieved. And in order to read abar code symbol omnidirectionally with highdensity scan patterns, the new real time decoding technique was proposed. The advantage of this technique is less hardware and lower clock rate. High speed processing and improved readability for tilted symbol was confirmed experimentally.

  • PDF

An Efficient Data Mining Algorithm based on the Database Characteristics (데이터 베이스 특성에 따른 효율적인 데이터 마이닝 알고리즘)

  • Park, Ji-Hyun;Koh, Chan
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.10 no.1
    • /
    • pp.107-119
    • /
    • 2006
  • Recently with developments of an internet and web techniques, the amount of data that are stored in database is increasing rapidly. So the range of adaption in database has been expanded and a research of Data Mining techniques finding useful skills from the huge database has been progressed. Many original algorithms have been developed by cutting down the item set and the size of database isn't required in the entire course of creating frequent item sets. Although those skills could save time in some course, it requires too much time for adapting those techniques in other courses. In this paper, an algorithm is proposed. In an Transaction Database that the length of it's transactions are short or the number of items are relatively small, this algorithm scans a database once by using a Hashing Technique and at the same time, stores all parts of the set, can be appeared at each transaction, in an Hash-table. So without an influence of n minimum percentage of support, it can discover a set of frequent items in more shorter time than the time what is used by an original algorithm.

  • PDF

Optimal Design and Implementation of 3D Shape Restoration System for Femto-second Laser Micromachining (펨토초 레이저 미세가공을 위한 3차원 형상 복원 시스템의 최적설계 및 구현)

  • Park, Jeong-Hong;Lee, Ji-Hong;Ko, Yun-Ho;Park, Young-Woo
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.43 no.6 s.312
    • /
    • pp.16-26
    • /
    • 2006
  • In this paper, we propose a 3D shape restoration system which measures height and surface shape of transparent ITO glass and delivers errors in focal length and incident angle of laser beam to femto-second laser micromachining. The proposed system is composed of a line scan laser, a high resolution camera, a linear motion guide synchronized to image capturing, and a control station. Also, we define the sensitivity indices that represent a relation between measurement error and a position of a camera and scan laser, and utilize it for optimum design. The results of the proposed system are compared with results of SPM(Scanning Probe Microscope) and prove the usefulness of the system.

Fast Motion Estimation Algorithms Through Adaptive Application of the Hadamard Transform (하다마드 변환의 적응적 적용을 이용한 고속 움직임 예측 알고리즘)

  • Lee, Hyuk;Kim, Jong-Ho;Jin, Soon-Jong;Jeong, Je-Chang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.8C
    • /
    • pp.712-719
    • /
    • 2007
  • In this paper, we propose a new, effective, fast motion estimation algorithms using $4{\times}4$ pixels Hadamard transform. The Hadamard transform has the advantage of simplicity because it uses only addition and subtraction. Motion estimation is composed of three stages. First, it should be decided whether to terminate the search early and use a previous motion vector with DC(Direct Current) coefficients. Then the adaptive matching scan order for motion estimation should be determined according to the image complexity using AC(Alternating Current) coefficients. Experimentally, we adapted this algorithms to MVFAST and PMVFAST algorithms, and the proposed algorithms turn out to be very efficient in terms of computational speed while remaining almost the same in terms of PSNR(Peak Signal-to-Noise Ratio) compared to MVFAST and PMVFAST algorithms.