• Title/Summary/Keyword: 고속 알고리듬

Search Result 229, Processing Time 0.028 seconds

Rapid Optimization of Multiple Isocenters Using Computer Search for Linear Accelerator-based Stereotactic Radiosurgery (Multiple isocenter를 이용한 뇌정위적 방사선 수술시 컴퓨터 자동 추적 방법에 의한 고속의 선량 최적화)

  • Suh Tae-suk;Park Charn Il;Ha Sung Whan;Yoon Sei Chul;Kim Moon Chan;Bahk Yong Whee;Shinn Kyung Sub
    • Radiation Oncology Journal
    • /
    • v.12 no.1
    • /
    • pp.109-115
    • /
    • 1994
  • The purpose of this paper is to develop an efficient method for the quick determination of multiple isocenters plans to provide optimal dose distribution in sterotactic radiosurgery. A Spherical dose model was developed through the use of fit to the exact dose data calculated in a 18cm diameter of spherical head phantom. It computes dose quickly for each spherical part and is useful to estimate dose distribution for multiple isocenters. An automatic computer search algorithm was developed using the relationship between the isocenter move and the change of dose shape, and adapted with a spherical dose model to determine isocenter separation and cellimator sizes quickly and automatically. A spheric81 dose model shows a comparable isodose distribution with exact dose data and permits rapid calculations of 3-D isodoses. the computer search can provide reasonable isocenter settings more quickly than trial and error types of plans, while producing steep dose gradient around target boundary. A spherical dose model can be used for the quick determination of the multiple isocenter plans with 3 computer automatic search. Our guideline is useful to determine the initial multiple isocenter plans.

  • PDF

A Study on Channel Equalization in Time Varying Channels for Mobile Communication System (이동통신 시스템의 Time Varying 채널 환경에서 채널 등화에 관한 연구)

  • Park No-Jin;Kim Dong-Ok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.1
    • /
    • pp.29-35
    • /
    • 2006
  • The third generation mobile communications system requiring the reliable multimedia data transmission has provided with the reliable voice, data and video services over the variable propagation environment. However the broadband wireless multiple access technologies cause Inter Symbol Interference(ISI) or Multiple Access Interference(MAI) to degrade the performance of CDMA(Code Division Multiple Access) system. Constant Modulus Algorithm which is frequently used as the adaptive blind equalizers to remove the interfering signal has ill-convergence phenomenon without proper initialization. In this paper, new blind equalization method based on conventional CMA is proposed to improve the channel efficiency, and through computer simulation this is tested over the time varying fading environment of mobile communication system. consequently, new blind equalization method into concatenated Kalman filter with CMA is verified better than conventional CMA through adopting minimum mean square errors and eye-pattern obtained from algorithm are compared.

Development of a High-performance DSP Coprocessor Architecture (고성능 32-bit DSP 코프로세서의 아키텍쳐 개발)

  • Yun, Seong-Cheol;Kim, Sang-Uk;Bae, Seong-Il;Gang, Seong-Ho;Kim, Yong-Cheon;Jeong, Seung-Jae;Kim, Sang-U;Mun, Sang-Hun
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.39 no.2
    • /
    • pp.72-81
    • /
    • 2002
  • A new high-performance DSP architecture is proposed, which behaves as a coprocessor of a 32bit microcontroller. Because the proposed DSP architecture is a dual MAC(Multiply and Accumulate) DSP architecture, it can process efficiently a number of SOP(sum of product) operations used in many DSP applications. In order to efficiently perform other operations such as pure additions without any restriction, a MAC is composed of a multiplier and a ALU placed in parallel. In addition, it is a 3-way superscalar architecture, which can issue 3 instructions at a time. The benchmark results with 3 thor dual MAC DSPs show that the proposed DSP has the best performance. Futhermore, it is proven that the proposed DSP is more efficient in memory usage, although the performance is comparable in some algorithms such as Viterbi decoding and FFT butterfly.

A Development of Monitor Screen Checking System for Monitor Manufacturing Firm (모니터 생산업체에서의 최종 모니터 화면검사 시스템의 개발)

  • 조영창;윤정오;최병진;정종혁;강상욱;오주환
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 2000.05a
    • /
    • pp.107-111
    • /
    • 2000
  • There are many recent menial manufacturing firms not equipped with automatic checking system in their final process. And the check is based on the human perception so the automatic checking system is needed for the consistency and the accuracy of the checking process to elevate the productivity and the Quality. As the performance of computer systems and the vision systems has been increased the cost for the system is reduced and their applicable algorithms have been developed. In this study we develop monitor checking system which is low-cost, fast, and easy to adopt by the small-scaled manufacturing firms. The system is based on the computer vision techniques, and is equipped with the GUI interface and checking functions such as centering, yoke rotation, pincushion. sizing. Monitor checking system developed in this study can be used in the final checking process thereby we expect the synergy effects both on the efficiency of production and on the reduction of the cost for the facility investments.

  • PDF

Fractal Image Compression using the Minimizing Method of Domain Region (정의역 최소화 기법을 이용한 프랙탈 영상압축)

  • 정태일;권기룡;문광석
    • Journal of Korea Multimedia Society
    • /
    • v.2 no.1
    • /
    • pp.38-46
    • /
    • 1999
  • In this paper, the fractal image compression using the minimizing method of domain region is proposed. It is minimize to domain regions in the process of decoding. Since the conventional fractal decoding applies to IFS(iterative function system) for the total range blocks of the decoded image, its computational complexity is a vast amount. In order to improve this using the number of the referenced times to the domain blocks for the each range blocks, a classification method which divides necessary and unnecessary regions for IFS is suggested. If necessary regions for IFS are reduced, the computational complexity is reduced. The proposed method is to define the minimum domain region that a necessary region for IFS is minimized in the encoding algorithms. That is, a searched region of the domain is limited to the range regions that is similar with the domain regions. So, the domain region is more overlapped. Therefore, there is not influence on image quality or PSNR(peak signal-to-noise ratio). And it can be a fast decoding by reduce the computational complexity for IFS in fractal image decoding.

  • PDF

Performance Evaluation of Scheduling Algorithms according to Communication Cost in the Grid System of Co-allocation Environment (Co-allocation 환경의 그리드 시스템에서 통신비용에 따른 스케줄링 알고리즘의 성능 분석)

  • Kang, Oh-Han;Kang, Sang-Seong;Kim, Jin-Suk
    • The KIPS Transactions:PartA
    • /
    • v.14A no.2
    • /
    • pp.99-106
    • /
    • 2007
  • Grid computing, a mechanism which uses heterogeneous systems that are geographically distributed, draws attention as a new paradigm for the next generation operation of parallel and distributed computing. The importance of grid computing concerning communication cost is very huge because grid computing furnishes uses with integrated virtual computing service, in which a number of computer systems are connected by a high-speed network. Therefore, to reduce the execution time, the scheduling algorithm in grid environment should take communication cost into consideration as well as computing ability of resources. However, most scheduling algorithms have not only ignored the communication cost by assuming that all tasks were dealt in one cluster, but also did not consider the overhead of communication cost when the tasks were processed in a number of clusters. In this paper, the functions of original scheduling algorithms are analyzed. More importantly, the functions of algorithms are compared and analyzed with consideration of communication cost within the co allocation environment, in which a task is performed separately in many clusters.

Modified Speeded Up Robust Features(SURF) for Performance Enhancement of Mobile Visual Search System (모바일 시각 검색 시스템의 성능 향상을 위하여 개선된 Speeded Up Robust Features(SURF) 알고리듬)

  • Seo, Jung-Jin;Yoona, Kyoung-Ro
    • Journal of Broadcast Engineering
    • /
    • v.17 no.2
    • /
    • pp.388-399
    • /
    • 2012
  • In the paper, we propose enhanced feature extraction and matching methods for a mobile environment based on modified SURF. We propose three methods to reduce the computational complexity in a mobile environment. The first is to reduce the dimensions of the SURF descriptor. We compare the performance of existing 64-dimensional SURF with several other dimensional SURFs. The second is to improve the performance using the sign of the trace of the Hessian matrix. In other words, feature points are considered as matched if they have the same sign for the trace of the Hessian matrix, otherwise considered not matched. The last one is to find the best distance-ratio which is used to determine the matching points. We find the best distance-ratio through experiments, and it gives the relatively high accuracy. Finally, existing system which is based on normal SURF method is compared with our proposed system which is based on these three proposed methods. We present that our proposed system shows reduced response time while preserving reasonably good matching accuracy.

Modeling and Simulation Study of Multipath Ghosts (다중 경로 고스트의 모델링 및 시뮬레이션 연구)

  • Kwon, Sung-Jae
    • Journal of the Korea Computer Industry Society
    • /
    • v.6 no.5
    • /
    • pp.675-686
    • /
    • 2005
  • This paper proposes a new method of mathematically modeling and computer simulating television ghosts wherein television signals that have undergone multipath fading are generated without using approximations by considering the attenuation, time delay, phase, and timing jitter between consecutive frames. Conventional methods used polynomial interpolation or complex arithmetic to take into account the ghost phase, but our method uses only real arithmetic by employing the Hilbert transform and also reduces the computation time using the FFT (fast Fourier transform) algorithm. Furthermore, it is also possible to observe the transmit waveforms in both RF and IF ranges. Various ghost patterns generated in software provide for essential data required for the development of ghost canceling algorithms, and are deemed to be very useful in analyzing the constituent blocks of the transmitter and receiver chain in television broadcasting. The development of ghost cancelers needs to be preceded by the task of mathematically modeling ghosts and their extensive computer simulations.

  • PDF

A Study on the Integrated Coding of Image and Document Data (영상과 문자정보의 통합 부호화에 관한 연구)

  • Lee, Huen-Joo;Park, Goo-Man;Park, Kyu-Tae
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.7
    • /
    • pp.42-49
    • /
    • 1989
  • A new integrated coding method is proposed in this study for embedding the text information including Hangul into an image. A monochrome analog image may be quantized to a few leveled digital image and be displayed on bi-leveled output devices by using halftone processing techniques. Text data are embedded on each micro pattern. Based on this concept, the encoding and the decoding algorithm are implemented and experiments are performed. As a result, the average amount of the embedded text information is more than 8 bpp (bits per pixer) in this halftone processed image converted form a $64{\times}64$ image, i.e, corresponding to 2000 characters in Hangul, or 4000 characters in alphanumeral. using this algorithm, the integrated personal record management system is implemented.

  • PDF

Adaptive Hybrid Beamformer Suitable for Fast Fading (고속 페이딩에 적합한 적응 하이브리드 빔형성기)

  • Ahn Jang Hwan;Han Dong Seog
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.2 s.332
    • /
    • pp.49-59
    • /
    • 2005
  • An adaptive hybrid beamformer is proposed to improve the reception performance of the advanced television system committee (ATSC) digital television (DTV) in a mobile environment. Dynamic multipaths and Doppler shifts severely degrade the reception performance of the ATSC DTV receiver. Accordingly, a hybrid beamformer, called a Capon and least mean square (CLMS) beamformer, is presented that uses direction of arrival (DOA) information and the least mean square (LMS) beamforming algorithm. The proposed CLMS algerian efficiently removes dynamic multipaths and compensates for the phase distortion caused by Doppler shifts in mobile receivers. After the CLMS beamformer is operated, the subsequent use of an equalizer removes any residual multipath effects, thereby significantly improving the performance of DTV receivers. The performances of the proposed CLMS, Capon, and LMS beamformersare compared based on computer simulations. In addition, the overall performance of the CLMS beamformer followed by an equalizer is also considered.