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

Search Result 195, Processing Time 0.024 seconds

Block-Coordinate Gauss-Newton Optimization for Image Registration (영상 정합을 위한 Block-Coordinate Gauss-Newton 최적화)

  • Kim, Dong-Sik
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.6
    • /
    • pp.1-8
    • /
    • 2007
  • In this paper, research on joint optimization of the image spatial registration and the exposure compensation is conducted. The exposure compensation is performed in a frame work of the intensity compensation based on the polynomial approximation of the relationship between images. This compensation is jointly combined with the registration problem employing the Gauss-Newton nonlinear optimization method. In this paper, to perform for a simple and stable optimization, the block-coordinate method is combined with the Gauss-Newton optimization and extensively compared with the traditional approaches. Furthermore, regression analysis is considered in the compensation part for a better stable performance. By combining the block-coordinate method with the Gauss-Newton optimization, we can obtain a compatible performance reducing the computational complexity and stabilizing the performance. In the numerical result for a particular image, we obtain a satisfactory result for 10 repeats of the iteration, which implies a 50% reduction of the computational complexity. The error is also further reduced by 1.5dB compared to the ordinary method.

Postprocessing Algorithm of Fingerprint Image Using Isometric SOM Neural Network (Isometric SOM 신경망을 이용한 지문 영상의 후처리 알고리듬)

  • Kim, Sang-Hee;Kim, Yung-Jung;Lee, Sung-Koo
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.5
    • /
    • pp.110-116
    • /
    • 2008
  • This paper presents a new postprocessing method to eliminate the false minutiae, that caused by the skelectonization of fingerprint image, and an image compression method using Isometric Self Organizing Map(ISOSOM). Since the SOM has simple structure, fast encoding time, and relatively good classification characteristics, many image processing areas adopt this such as image compression and pattern classification, etc. But, the SOM shows limited performances in pattern classification because of it's single layer structure. To maximize the performance of the pattern classification with small code book, we a lied the Isometric SOM with the isometry of the fractal theory. The proposed Isometric SOM postprocessing and compression algorithm of fingerprint image showed good performances in the elimination of false minutiae and the image compression simultaneously.

A Matrix-Based Graph Matching Algorithm with Application to a Musical Symbol Recognition (행렬기반의 정합 알고리듬에 의한 음악 기호의 인식)

  • Heo, Gyeong-Yong;Jang, Kyung-Sik;Jang, Moon-Ik;Kim, Jai-Hie
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.8
    • /
    • pp.2061-2074
    • /
    • 1998
  • In pattern recognition and image analysis upplications, a graph is a useful tool for complex obect representation and recognition. However it takes much time to pair proper nodes between the prototype graph and an input data graph. Futhermore it is difficult to decide whether the two graphs in a class are the same hecause real images are degradd in general by noise and other distortions. In this paper we propose a matching algorithm using a matrix. The matrix is suiable for simple and easily understood representation and enables the ordering and matching process to be convenient due to its predefined matrix manipulation. The nodes which constitute a gaph are ordered in the matrix by their geometrical positions and this makes it possible to save much comparison time for finding proper node pairs. for the classification, we defined a distance measure thatreflects the symbo's structural aspect that is the sum of the mode distance and the relation distance; the fornet is from the parameters describing the node shapes, the latter from the relations with othes node in the matrix. We also introduced a subdivision operation to compensate node merging which is mainly due t the prepreocessing error. The proposed method is applied to the recognition of musteal symbols and the result is given. The result shows that almost all, except heavily degraded symbols are recognized, and the recognition rate is approximately 95 percent.

  • PDF

Customized Aerodynamic Simulation Framework for Indoor HVAC Using Open-Source Libraries (공개 라이브러리 기반 실내 공조 맞춤형 전산모사 시스템 개발)

  • Sohn, Ilyoup;Roh, Hyunseok;Kim, Jaesung
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.41 no.2
    • /
    • pp.135-143
    • /
    • 2017
  • A customized CFD simulator to perform thermo-fluid dynamic simulations of an HVAC for an indoor space is presented. This simulation system has been developed for engineers studying architectural engineering, as the HVAC mechanical systems used in housings and buildings. Hence, all functions and options are so designed to be suitable that they are suitable for non-CFD experts as well as CFD engineers. A Computational mesh is generated by open-source libraries, FEMM (Finite Element Method Magnetics), and OpenFOAM. Once the boundary conditions are set, the fluid dynamic calculations are performed using the OpenFOAM solver. Numerical results are validated by comparing them with the experimental data for a simple indoor air flow case. In this paper, an entirely new calculation process is introduced, and the flow simulation results for a sample office room are also discussed.

Constructing Software Structure Graph through Progressive Execution (점진적 실행을 통한 소프트웨어의 구조 그래프 생성)

  • Lee, Hye-Ryun;Shin, Seung-Hun;Choi, Kyung-Hee;Jung, Gi-Hyun;Park, Seung-Kyu
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.7
    • /
    • pp.111-123
    • /
    • 2013
  • To verify software vulnerability, the method of conjecturing software structure and then testing the software based on the conjectured structure has been highlighted. To utilize the method, an efficient way to conjecture software structure is required. The popular graph and tree methods such as DFG(Data Flow Graph), CFG(Control Flow Graph) and CFA(Control Flow Automata) have a serious drawback. That is, they cannot express software in a hierarchical fashion. In this paper, we propose a method to overcome the drawback. The proposed method applies various input data to a binary code, generate CFG's based on the code output and construct a HCFG (Hierarchical Control Flow Graph) to express the generated CFG's in a hierarchical structure. The components required for HCFG and progressive algorithm to construct HCFG are also proposed. The proposed method is verified through constructing the software architecture of an open SMTP(Simple Mail Transfer Protocol) server program. The structure generated by the proposed method and the real program structure are compared and analyzed.

Reduction of Radiographic Quantum Noise Using Adaptive Weighted Median Filter (적응성 가중메디안 필터를 이용한 방사선 투과영상의 양자 잡음 제거)

  • Lee, Hoo-Min;Nam, Moon-Hyon
    • Journal of the Korean Society for Nondestructive Testing
    • /
    • v.22 no.5
    • /
    • pp.465-473
    • /
    • 2002
  • Images are easily corrupted by noise during the data transmission, data capture and data processing. A technical method of noise analyzing and adaptive filtering for reducing of quantum noise in radiography is presented. By adjusting the characteristics of the filter according to local statistics around each pixel of the image as moving windowing, it is possible to suppress noise sufficiently while preserve edge and other significant information required in reading. We have proposed adaptive weighted median(AWM) filters based on local statistics. We show two ways of realizing the AWM filters. One is a simple type of AWM filter, whose weights are given by a simple non-linear function of three local characteristics. The other is the AWM filter which is constructed by homogeneous factor(HF). Homogeneous factor(HF) from the quantum noise models that enables the filter to recognize the local structures of the image is introduced, and an algorithm for determining the HF fitted to the detection systems with various inner statistical properties is proposed. We show by the experimented that the performances of proposed method is superior to these of other filters and models in preserving small details and suppressing the noise at homogeneous region. The proposed algorithms were implemented by visual C++ language on a IBM-PC Pentium 550 for testing purposes, the effects and results of the noise filtering were proposed by comparing with images of the other existing filtering methods.

A simple approach to refraction statics with the Generalized Reciprocal Method and the Refraction Convolution Section (GRM과 RCS 방법을 이용한 굴절파 정적 시간차를 구하는 간단한 방법)

  • Palmer Derecke;Jones Leonie
    • Geophysics and Geophysical Exploration
    • /
    • v.8 no.1
    • /
    • pp.18-25
    • /
    • 2005
  • We derive refraction statics for seismic data recorded in a hard rock terrain, in which there are large and rapid variations in the depth of weathering. The statics corrections range from less than 10 ms to more than 70 ms, often over distances as short as 12 receiver intervals. This study is another demonstration of the importance in obtaining accurate initial refraction models of the weathering in hard rock terrains in which automatic residual statics may fail. We show that the statics values computed with a simple model of the weathering using the Generalized Reciprocal Method (GRM) and the Refraction Convolution Section (RCS) are comparable in accuracy to those computed with a more complex model of the weathering, using least-mean-squares inversion with the conjugate gradient algorithm (Taner et al., 1998). The differences in statics values between the GRM model and that of Taner et al. (1998) systematically vary from an average of 2ms to 4ms over a distance of 8.8 km. The differences between these two refraction models and the final statics model, which includes the automatic residual values, are generally less than 5 ms. The residuals for the GRM model are frequently less than those for the model of Taner et al. (1998). The RCS statics are picked approximately 10 ms later, but their relative accuracy is comparable to that of the GRM statics. The residual statics values show a general correlation with the refraction statics values, and they can be reduced in magnitude by using a lower average seismic velocity in the weathering. These results suggest that inaccurate average seismic velocities in the weathered layer may often be a source of short-wavelength statics, rather than any shortcomings with the inversion algorithms in determining averaged delay times from the traveltimes.

A 200-MHz@2.5V 0.25-$\mu\textrm{m}$ CMOS Pipelined Adaptive Decision-Feedback Equalizer (200-MHz@2.5-V 0.25-$\mu\textrm{m}$ CMOS 파이프라인 적응 결정귀환 등화기)

  • 안병규;이종남;신경욱
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2000.05a
    • /
    • pp.465-469
    • /
    • 2000
  • This paper describes a single-chip full-custom implementation of pipelined adaptive decision-feedback equalizer (PADFE) using a 0.25-${\mu}{\textrm}{m}$ CMOS technology for wide-band wireless digital communication systems. To enhance the throughput rate of ADFE, two pipeline stage are inserted into the critical path of the ADFE by using delayed least-mean-square (DLMS) algorithm Redundant binary (RB) arithmetic is applied to all the data processing of the PADFE including filter taps and coefficient update blocks. When compared with conventional methods based on two's complement arithmetic, the proposed approach reduces arithmetic complexity, as well as results in a very simple complex-valued filter structure, thus suitable for VLSI implementation. The design parameters including pipeline stage, filter tap, coefficient and internal bit-width and equalization performance such as bit error rate (BER) and convergence speed are analyzed by algorithm-level simulation using COSSAP. The singl-chip PADFE contains about 205,000 transistors on an area of about 1.96$\times$1.35-$\textrm{mm}^2$. Simulation results show that it can safely operate with 200-MHz clock frequency at 2.5-V supply, and its estimated power dissipation is about 890-mW.

  • PDF

Implementation of an Efficient Microbial Medical Image Retrieval System Applying Knowledge Databases (지식 데이타베이스를 적용한 효율적인 세균 의료영상 검색 시스템의 구현)

  • Shin Yong Won;Koo Bong Oh
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.1 s.33
    • /
    • pp.93-100
    • /
    • 2005
  • This study is to desist and implement an efficient microbial medical image retrieval system based on knowledge and content of them which can make use of more accurate decision on colony as doll as efficient education for new techicians. For this. re first address overall inference to set up flexible search path using rule-base in order U redure time required original microbial identification by searching the fastest path of microbial identification phase based on heuristics knowledge. Next, we propose a color ffature gfraction mtU, which is able to extract color feature vectors of visual contents from a inn microbial image based on especially bacteria image using HSV color model. In addition, for better retrieval performance based on large microbial databases, we present an integrated indexing technique that combines with B+-tree for indexing simple attributes, inverted file structure for text medical keywords list, and scan-based filtering method for high dimensional color feature vectors. Finally. the implemented system shows the possibility to manage and retrieve the complex microbial images using knowledge and visual contents itself effectively. We expect to decrease rapidly Loaming time for elementary technicians by tell organizing knowledge of clinical fields through proposed system.

  • PDF

A Design of Pipelined Adaptive Decision-Feedback Equalized using Delayed LMS and Redundant Binary Complex Filter Structure (Delayed LMS와 Redundant Binary 복소수 필터구조를 이용한 파이프라인 적응 결정귀환 등화기 설계)

  • An, Byung-Gyu;Lee, Jong-Nam;Shin, Kyung-Wook
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.37 no.12
    • /
    • pp.60-69
    • /
    • 2000
  • This paper describes a single-chip full-custom implementation of pipelined adaptive decision-feedback equalizer(PADFE) using a 0.25-${\mu}m$ CMOS technology for wide-band wireless digital communication systems. To enhance the throughput rate of ADFE, two pipeline stages are inserted into the critical path of the ADFE by using delayed least-mean-square(DLMS) algorithm. Redundant binary (RB) arithmetic is applied to all the data processing of the PADFE including filter taps and coefficient update blocks. When compared with conventional methods based on two's complement arithmetic, the proposed approach reduces arithmetic complexity, as well as results in a very simple complex-valued filter structure, thus suitable for VLSI implementation. The design parameters including pipeline stage, filter tap, coefficient and internal bit-width, and equalization performance such as bit error rate (BER) and convergence speed are analyzed by algorithm-level simulation using COSSAP. The single-chip PADFE contains about 205,000 transistors on an area of about $1.96\times1.35-mm^2$. Simulation results show that it can safely operate with 200-MHz clock frequency at 2.5-V supply, and its estimated power dissipation is about 890-mW. Test results show that the fabricated chip works functionally well.

  • PDF