• Title/Summary/Keyword: Sequence of View

Search Result 262, Processing Time 0.032 seconds

Fast MR Imaging Technique by Using Locally-Linear Gradient Field (부분적인 경사자계를 이용한 고속 자기공명 영상촬영기법)

  • 양윤정;이종권
    • Journal of Biomedical Engineering Research
    • /
    • v.17 no.1
    • /
    • pp.93-98
    • /
    • 1996
  • The purpose of this paper is to propose a new localized imaging method of reduced imaging time luting a locally-linear gradient. Since most fast MR(Magnetic Resonance) imaging methods need the whole $\kappa$-space(Spatial frequency space) data corresponding to the whole imaging area, there are limitstions in reducing the minimum imaging time. The imaging method proposed in this paper uses a specially-made gradient coil generating a local ramp-shape field and uniform field outside of the imaging areal Conventional imaging sequences can be used without any RF/gradient pulse sequence modifiestions except the change in the number of encoding steps and the field of view.

  • PDF

False Match Rejection in Rear View Camera Image Sequences (차량 후방 연속 영상에서 오정합점 제거방법)

  • Suhr, Jae-Kyu;Bae, Kwang-Hyuk;Kim, Jai-Hie
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.327-328
    • /
    • 2006
  • This paper proposes a method for rejecting false matches in automobile rear view camera image sequences. Our method consists of two submethods which utilize the motion characteristics of an automobile. One is for a straight motion and the other is for a curve motion. First, we classify an image sequence into a straight motion or a curve motion and then apply an appropriate submethod. Our method works in cases where the percentage of true matches is as low as 30%.

  • PDF

A study on Face Image Classification for Efficient Face Detection Using FLD

  • Nam, Mi-Young;Kim, Kwang-Baek
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2004.05a
    • /
    • pp.106-109
    • /
    • 2004
  • Many reported methods assume that the faces in an image or an image sequence have been identified and localization. Face detection from image is a challenging task because of variability in scale, location, orientation and pose. In this paper, we present an efficient linear discriminant for multi-view face detection. Our approaches are based on linear discriminant. We define training data with fisher linear discriminant to efficient learning method. Face detection is considerably difficult because it will be influenced by poses of human face and changes in illumination. This idea can solve the multi-view and scale face detection problem poses. Quickly and efficiently, which fits for detecting face automatically. In this paper, we extract face using fisher linear discriminant that is hierarchical models invariant pose and background. We estimation the pose in detected face and eye detect. The purpose of this paper is to classify face and non-face and efficient fisher linear discriminant..

  • PDF

Stereoscopic Video Coding for Subway Accident Monitoring System (지하철 사고 감시를 위한 스테레오 비디오 부호화 기법)

  • Kim Gil-Dong;Park Sung-Hyuk;Lee Hanmin;Oh Seh-Chan
    • Journal of the Korean Society for Railway
    • /
    • v.8 no.6 s.31
    • /
    • pp.559-565
    • /
    • 2005
  • In this paper, we propose a stereoscopic video coding scheme for subway accident monitoring system. The proposed designed for providing flexible video among various displays, such ass control center, station employees and train driver. We uses MPEG-2 standard for coding the left-view sequence and IBMDC coding scheme predicts matching block by interpolating both motion and disparity predicted macroblocks. To provide efficient stereoscopic video service, we define both temporally and spatially scalable layers for each eye's-view by using the concept of Spatio-Temporal scalability. The experimental results show the efficiency of proposed coding scheme by comparison with already known methods and the advantages of disparity estimation in terms of scalability overhead. According to the experimental results, we expect the proposed functionalities will play a key role in establishing highly flexible stereoscopic video codec for ubiquitous display environment where devices and network connections are heterogeneous.

Structural Genomic View of Microbial Genomes

  • Moon, Tae-Sung;Lee, Jin-Kak;Han, Won-Seok;Choi, Han-Su;Han, Min-Su;Eom, Ki-Dong;Lee, Min-Kyung;Yoon, Chang-No
    • Proceedings of the Microbiological Society of Korea Conference
    • /
    • 2006.05a
    • /
    • pp.76-79
    • /
    • 2006
  • At present, hundreds of microbial genomes have been sequenced, and hundreds more are currently in the sequencing pipeline. As the amount of genome data is expanding, researchers are much in need of tools that can process huge amount of sequence data. Here, we will discuss about several bioinformatics tools and their applications.

  • PDF

Process Analysis of Precision Press Forming by the Finite Element Method (유한요소법을 활용한 정밀전자부품 성형공정 해석)

  • 양순종;변상규;최홍석;하석준;강범수
    • Proceedings of the Korean Society for Technology of Plasticity Conference
    • /
    • 1997.10a
    • /
    • pp.53-56
    • /
    • 1997
  • The multistage precision forming process for aperture of electronic guns consists mainly of drawing and swaging operations. The multistage forming sequence is analyzed in view of production industry, and based on the industrial investigation. The processes are simulated by the finite element code MARC. The elastic recovery, strain and stress distribution, and the die forces are summarized.

  • PDF

Developing a Dynamic Materialized View Index for Efficiently Discovering Usable Views for Progressive Queries

  • Zhu, Chao;Zhu, Qiang;Zuzarte, Calisto;Ma, Wenbin
    • Journal of Information Processing Systems
    • /
    • v.9 no.4
    • /
    • pp.511-537
    • /
    • 2013
  • Numerous data intensive applications demand the efficient processing of a new type of query, which is called a progressive query (PQ). A PQ consists of a set of unpredictable but inter-related step-queries (SQ) that are specified by its user in a sequence of steps. A conventional DBMS was not designed to efficiently process such PQs. In our earlier work, we introduced a materialized view based approach for efficiently processing PQs, where the focus was on selecting promising views for materialization. The problem of how to efficiently find usable views from the materialized set in order to answer the SQs for a PQ remains open. In this paper, we present a new index technique, called the Dynamic Materialized View Index (DMVI), to rapidly discover usable views for answering a given SQ. The structure of the proposed index is a special ordered tree where the SQ domain tables are used as search keys and some bitmaps are kept at the leaf nodes for refined filtering. A two-level priority rule is adopted to order domain tables in the tree, which facilitates the efficient maintenance of the tree by taking into account the dynamic characteristics of various types of materialized views for PQs. The bitmap encoding methods and the strategies/algorithms to construct, search, and maintain the DMVI are suggested. The extensive experimental results demonstrate that our index technique is quite promising in improving the performance of the materialized view based query processing approach for PQs.

Illumination Mismatch Compensation Algorithm based on Layered Histogram Matching by Using Depth Information (깊이 정보에 따른 레이어별 히스토그램 매칭을 이용한 조명 불일치 보상 기법)

  • Lee, Dong-Seok;Yoo, Ji-Sang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.8C
    • /
    • pp.651-660
    • /
    • 2010
  • In this paper, we implement an efficient histogram-based prefiltering to compensate the illumination mismatches in regions between neighboring views. In multi-view video, such illumination disharmony can primarily occur on account of different camera location and orientation and an imperfect camera calibration. This discrepancy can cause the performance decrease of multi-view video coding(MVC) algorithm. A histogram matching algorithm can be exploited to make up for these differences in a prefiltering step. Once all camera frames of a multi-view sequence are adjusted to a predefined reference through the histogram matching, the coding efficiency of MVC is improved. However general frames of multi-view video sequence are composed of several regions with different color composition and their histogram distribution which are mutually independent of each other. In addition, the location and depth of these objects from sequeuces captured from different cameras can be different with different frames. Thus we propose a new algorithm which classify a image into several subpartitions by its depth information first and then histogram matching is performed for each region individually. Experimental results show that the compression ratio for the proposed algorithm is improved comparing with the conventional image-based algorithms.

Genomic Distribution of Simple Sequence Repeats in Brassica rapa

  • Hong, Chang Pyo;Piao, Zhong Yun;Kang, Tae Wook;Batley, Jacqueline;Yang, Tae-Jin;Hur, Yoon-Kang;Bhak, Jong;Park, Beom-Seok;Edwards, David;Lim, Yong Pyo
    • Molecules and Cells
    • /
    • v.23 no.3
    • /
    • pp.349-356
    • /
    • 2007
  • Simple Sequence Repeats (SSRs) represent short tandem duplications found within all eukaryotic organisms. To examine the distribution of SSRs in the genome of Brassica rapa ssp. pekinensis, SSRs from different genomic regions representing 17.7 Mb of genomic sequence were surveyed. SSRs appear more abundant in non-coding regions (86.6%) than in coding regions (13.4%). Comparison of SSR densities in different genomic regions demonstrated that SSR density was greatest within the 5'-flanking regions of the predicted genes. The proportion of different repeat motifs varied between genomic regions, with trinucleotide SSRs more prevalent in predicted coding regions, reflecting the codon structure in these regions. SSRs were also preferentially associated with gene-rich regions, with peri-centromeric heterochromatin SSRs mostly associated with retrotransposons. These results indicate that the distribution of SSRs in the genome is non-random. Comparison of SSR abundance between B. rapa and the closely related species Arabidopsis thaliana suggests a greater abundance of SSRs in B. rapa, which may be due to the proposed genome triplication. Our results provide a comprehensive view of SSR genomic distribution and evolution in Brassica for comparison with the sequenced genomes of A. thaliana and Oryza sativa.