• Title/Summary/Keyword: vectors

Search Result 3,881, Processing Time 0.03 seconds

Joint Optimization of the Motion Estimation Module and the Up/Down Scaler in Transcoders television (트랜스코더의 해상도 변환 모듈과 움직임 추정 모듈의 공동 최적화)

  • Han, Jong-Ki;Kwak, Sang-Min;Jun, Dong-San;Kim, Jae-Gon
    • Journal of Broadcast Engineering
    • /
    • v.10 no.3
    • /
    • pp.270-285
    • /
    • 2005
  • A joint design scheme is proposed to optimize the up/down scaler and the motion vector estimation module in the transcoder system. The proposed scheme first optimizes the resolution scaler for a fixed motion vector, and then a new motion vector is estimated for the fixed scaler. These two steps are iteratively repeated until they reach a local optimum solution. In the optimization of the scaler, we derive an adaptive version of a cubic convolution interpolator to enlarge or reduce digital images by arbitrary scaling factors. The adaptation is performed at each macroblock of an image. In order to estimate the optimal motion vector, a temporary motion vector is composed from the given motion vectors. Then the motion vector is refined over a narrow search range. It is well-known that this refinement scheme provides the comparable performance compared to the full search method. Simulation results show that a jointly optimized system based on the proposed algorithms outperforms the conventional systems. We can also see that the algorithms exhibit significant improvement in the minimization of information loss compared with other techniques.

Face recognition using PCA and face direction information (PCA와 얼굴방향 정보를 이용한 얼굴인식)

  • Kim, Seung-Jae
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.10 no.6
    • /
    • pp.609-616
    • /
    • 2017
  • In this paper, we propose an algorithm to obtain more stable and high recognition rate by using left and right rotation information of input image in order to obtain a stable recognition rate in face recognition. The proposed algorithm uses the facial image as the input information in the web camera environment to reduce the size of the image and normalize the information about the brightness and color to obtain the improved recognition rate. We apply Principal Component Analysis (PCA) to the detected candidate regions to obtain feature vectors and classify faces. Also, In order to reduce the error rate range of the recognition rate, a set of data with the left and right $45^{\circ}$ rotation information is constructed considering the directionality of the input face image, and each feature vector is obtained with PCA. In order to obtain a stable recognition rate with the obtained feature vector, it is after scattered in the eigenspace and the final face is recognized by comparing euclidean distant distances to each feature. The PCA-based feature vector is low-dimensional data, but there is no problem in expressing the face, and the recognition speed can be fast because of the small amount of calculation. The method proposed in this paper can improve the safety and accuracy of recognition and recognition rate faster than other algorithms, and can be used for real-time recognition system.

Bitmap Indexes and Query Processing Strategies for Relational XML Twig Queries (관계형 XML 가지 패턴 질의를 위한 비트맵 인덱스와 질의 처리 기법)

  • Lee, Kyong-Ha;Moon, Bong-Ki;Lee, Kyu-Chul
    • Journal of KIISE:Databases
    • /
    • v.37 no.3
    • /
    • pp.146-164
    • /
    • 2010
  • Due to an increasing volume of XML data, it is considered prudent to store XML data on an industry-strength database system instead of relying on a domain specific application or a file system. For shredded XML data stored in relational tables, however, it may not be straightforward to apply existing algorithms for twig query processing, since most of the algorithms require XML data to be accessed in a form of streams of elements grouped by their tags and sorted in a particular order. In order to support XML query processing within the common framework of relational database systems, we first propose several bitmap indexes and their strategies for supporting holistic twig joining on XML data stored in relational tables. Since bitmap indexes are well supported in most of the commercial and open-source database systems, the proposed bitmapped indexes and twig query processing strategies can be incorporated into relational query processing framework with more ease. The proposed query processing strategies are efficient in terms of both time and space, because the compressed bitmap indexes stay compressed during data access. In addition, we propose a hybrid index which computes twig query solutions with only bit-vectors, without accessing labeled XML elements stored in the relational tables.

AMSEA: Advanced Multi-level Successive Elimination Algorithms for Motion Estimation (움직임 추정을 위한 개선된 다단계 연속 제거 알고리즘)

  • Jung, Soo-Mok;Park, Myong-Soon
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.1_2
    • /
    • pp.98-113
    • /
    • 2002
  • In this paper, we present advanced algorithms to reduce the computations of block matching algorithms for motion estimation in video coding. Advanced multi-level successive elimination algorithms(AMSEA) are based on the Multi-level successive elimination algorithm(MSEA)[1]. The first algorithm is that when we calculate the sum of absolute difference (SAD) between the sum norms of sub-blocks in MSEA, we use the partial distortion elimination technique. By using the first algorithm, we can reduce the computations of MSEA further. In the second algorithm, we calculate SAD adaptively from large value to small value according to the absolute difference values between pixels of blocks. By using the second algorithm, the partial distortion elimination in SAD calculation can occur early. So, the computations of MSEA can be reduced. In the third algorithm, we can estimate the elimination level of MSEA. Accordingly, the computations of the MSEA related to the level lower than the estimated level can be reduced. The fourth algorithm is a very fast block matching algorithm with nearly 100% motion estimation accuracy. Experimental results show that AMSEA are very efficient algorithms for the estimation of motion vectors.

MPEG Video Segmentation using Two-stage Neural Networks and Hierarchical Frame Search (2단계 신경망과 계층적 프레임 탐색 방법을 이용한 MPEG 비디오 분할)

  • Kim, Joo-Min;Choi, Yeong-Woo;Chung, Ku-Sik
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.1_2
    • /
    • pp.114-125
    • /
    • 2002
  • In this paper, we are proposing a hierarchical segmentation method that first segments the video data into units of shots by detecting cut and dissolve, and then decides types of camera operations or object movements in each shot. In our previous work[1], each picture group is divided into one of the three detailed categories, Shot(in case of scene change), Move(in case of camera operation or object movement) and Static(in case of almost no change between images), by analysing DC(Direct Current) component of I(Intra) frame. In this process, we have designed two-stage hierarchical neural network with inputs of various multiple features combined. Then, the system detects the accurate shot position, types of camera operations or object movements by searching P(Predicted), B(Bi-directional) frames of the current picture group selectively and hierarchically. Also, the statistical distributions of macro block types in P or B frames are used for the accurate detection of cut position, and another neural network with inputs of macro block types and motion vectors method can reduce the processing time by using only DC coefficients of I frames without decoding and by searching P, B frames selectively and hierarchically. The proposed method classified the picture groups in the accuracy of 93.9-100.0% and the cuts in the accuracy of 96.1-100.0% with three different together is used to detect dissolve, types of camera operations and object movements. The proposed types of video data. Also, it classified the types of camera movements or object movements in the accuracy of 90.13% and 89.28% with two different types of video data.

A Semi-Noniterative VQ Design Algorithm for Text Dependent Speaker Recognition (문맥종속 화자인식을 위한 준비반복 벡터 양자기 설계 알고리즘)

  • Lim, Dong-Chul;Lee, Haing-Sei
    • The KIPS Transactions:PartB
    • /
    • v.10B no.1
    • /
    • pp.67-72
    • /
    • 2003
  • In this paper, we study the enhancement of VQ (Vector Quantization) design for text dependent speaker recognition. In a concrete way, we present the non-Iterative method which makes a vector quantization codebook and this method Is nut Iterative learning so that the computational complexity is epochally reduced. The proposed semi-noniterative VQ design method contrasts with the existing design method which uses the iterative learning algorithm for every training speaker. The characteristics of a semi-noniterative VQ design is as follows. First, the proposed method performs the iterative learning only for the reference speaker, but the existing method performs the iterative learning for every speaker. Second, the quantization region of the non-reference speaker is equivalent for a quantization region of the reference speaker. And the quantization point of the non-reference speaker is the optimal point for the statistical distribution of the non-reference speaker In the numerical experiment, we use the 12th met-cepstrum feature vectors of 20 speakers and compare it with the existing method, changing the codebook size from 2 to 32. The recognition rate of the proposed method is 100% for suitable codebook size and adequate training data. It is equal to the recognition rate of the existing method. Therefore the proposed semi-noniterative VQ design method is, reducing computational complexity and maintaining the recognition rate, new alternative proposal.

Elimination of Redundant Input Information and Parameters during Neural Network Training (신경망 학습 과정중 불필요한 입력 정보 및 파라미터들의 제거)

  • Won, Yong-Gwan;Park, Gwang-Gyu
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.3
    • /
    • pp.439-448
    • /
    • 1996
  • Extraction and selection of the informative features play a central role in pattern recognition. This paper describes a modified back-propagation algorithm that performs selection of the informative features and trains a neural network simultaneously. The algorithm is mainly composed of three repetitive steps : training, connection pruning, and input unit elimination. Afer initial training, the connections that have small magnitude are first pruned. Any unit that has a small number of connections to the hidden units is deleted,which is equivalent to excluding the feature corresponding to that unit.If the error increases,the network is retraned,again followed by connection pruning and input unit elimination.As a result,the algorithm selects the most im-portant features in the measurement space without a transformation to another space.Also,the selected features are the most-informative ones for the classification,because feature selection is tightly coupled with the classifi-cation performance.This algorithm helps avoid measurement of redundant or less informative features,which may be expensive.Furthermore,the final network does not include redundant parameters,i.e.,weights and biases,that may cause degradation of classification performance.In applications,the algorithm preserves the most informative features and significantly reduces the dimension of the feature vectors whiout performance degradation.

  • PDF

Development of SCAR Marker for Discriminating between Violet Flowered Lines and White Flowered Lines in Chinese Bellflower (Platycodon grandiflorum A.) (청도라지와 백도라지의 구분을 위한 SCAR 마커 개발)

  • Park, Chun-Geon;Bang, Kyong-Hwan;Kim, Ok-Tae;Jin, Dong-Chun;Kim, Dong-Hwi;Sung, Jung-Sook;Seong, Nak-Sul;Park, Hee-Woon;Lee, Sang-Chul
    • Korean Journal of Medicinal Crop Science
    • /
    • v.15 no.1
    • /
    • pp.1-5
    • /
    • 2007
  • To develop a convenient method for discriminating between violet flowered lines and white flowered lines in Chinese bellflower, RAPD analysis was carried out and SCAR markers were generated. Eighteen specific RAPD bands were obtained from 6 OPERON primer sets. Two out of eighteen RAPD bands were cloned into pGEM-T-Easy vectors and then subjected to the nucleotide sequence analysis. PgR1 and PgR2 DNA fragment, each specific for violet and white flowered lines, consist of 887 bp and 863 bp sequences, respectively. Two SCAR markers were developed from RAPD clones: SPgR1 (355 bp) from PgR1 and SPgR2 (493 bp) from PgR2. One (SPgR2) of these two markers was useful to differentiate between violet flowered lines and white flowered lines in Chinese bellflower.

Prevalence of Toxocariasis and Its Risk Factors in Patients with Eosinophilia in Korea

  • Song, Hyun Beom;Lee, Deokho;Jin, Yan;Kang, Jinwoo;Cho, Shin-Hyeong;Park, Min Sun;Park, Jin-Ho;Song, Woo-Jung;Kang, Hye-Ryun;Lee, Sang Hyub;Hong, Sung-Tae;Choi, Min-Ho
    • Parasites, Hosts and Diseases
    • /
    • v.58 no.4
    • /
    • pp.413-419
    • /
    • 2020
  • Eosinophilia occurs commonly in many diseases including allergic diseases and helminthic infections. Toxocariasis has been suggested as one cause of eosinophilia. The present study was undertaken to examine the prevalence of toxocariasis in patients with eosinophilia and to identify the risk factors for toxocariasis. This prospective cohort study recruited a total of 81 patients with eosinophilia (34 males and 47 females) who visited the outpatient clinic at Seoul National University Hospital from January 2017 to February 2018 and agreed to participate in this study. The prevalence of toxocariasis was examined by T. canis-specific ELISA, and the various risk factors for toxocariasis were evaluated by a questionnaire survey. Among 81 patients with eosinophilia, 18 were positive for anti-T. canis antibodies (22.2%); 88.9% were male (16/18) and 11.1% were female (2/18). Multivariate statistical analysis revealed that males (OR 21.876, 95% CI: 1.667-287.144) with a history of consuming the raw meat or livers of animals (OR 5.899, 95% CI: 1.004-34.669) and a heavy alcohol-drinking habit (OR 8.767, 95% CI: 1.018-75.497) were at higher risk of toxocariasis in patients with eosinophilia. Toxocariasis should be considered a potential cause of eosinophilia when the patient has a history of eating the raw meat or livers of animals in Korea. A single course of albendazole is recommended to reduce the migration of Toxocara larvae in serologically positive cases with eosinophilia.

Gene Therapy Using GM-CSF Gene Transferred by a Defective Infectious Single-cycle Herpes Virus in Micro-residual Organotropic Head and Neck Squamous Cell Cancer Model (향장기성 두경부 편평세포암종의 미세잔존암 모델에서 GM-CSF 유전자를 이입시킨 제한복제성 헤르페스바이러스 벡터를 이용한 종양백신의 유전자 치료)

  • Kim Se-Heon;Choi Eun-Chang;Kim Han-Su;Chang Jung-Hyun;Kim Ji-Hoon;Kim Kwang-Moon
    • Korean Journal of Head & Neck Oncology
    • /
    • v.19 no.1
    • /
    • pp.25-33
    • /
    • 2003
  • Background and Objectives: The Herpes Simplex type 2 Defective Infectious Single Cycle virus (DISC virus) is attenuated virus originally produced as viral vaccines but are also efficient gene transfer vehicle. The main goals of this study were to examine the efficiencies of the gene transfer using DISC vectors for various head and neck squamous cell carcinoma cell lines and to evaluate the efficacy of vaccination with DISC virus carrying a immunomodulatory genes (GM-CSF) as cancer therapy in a organotopic oral cavity squamous cell cancer model. Materials and Methods : We determinated the gene transfer efficiency of DISC virus by x-gal stain method and proved gene and protein expression of DISC-GMCSF transfected SCCVII cells by RT-PCR and ELISA method. Also we evaluated the ex vivo vaccination effects of SCCVII/GMCSF (DISC-GMCSF transfected SCCVII vaccine) vaccine on preventing the recurrence of micro-residual tumor. After the vaccination of SCCVII/GMCSF, specific cytotoxic T-cell responses was evaluated by CTL assay. Results: At an MOI of 10 DISC virus showed 64-88% of transfection rates in various head and neck squamous cancer cell lines. SCCVII cells transduced by DISC virus vector (MOI=10) carrying the GM-CSF gene, produced 4.5 nanogram quantities of GM-CSF per $10^6$ cells. In vivo vaccination using tumor cells transduced ex vivo with DISC-GMCSF resulted in better protection rate against subsequent tumor recurrence in organotopic oral cavity cancer model. Although tumor free survival rate was not statistically significantly increased in vaccination group (p=0.078), tumor specific cytotocic T-cell responses were significantly increased in SCCVII/GMCSF vaccination group. Conclusion: These data demonstrate that; 1) The DISC virus vector is capable of efficient gene transfer to various head and neck squamous cancer cell lines, 2) GM-CSF secreting genetically modified tumor vaccine (SCCVII/GMCSF) efficiently protected against tumor recurrence in organotopic micro-residual oral cavity cancer model and produced tumor specific cytotoxic T-cell response. DISC virus-mediated, cytokine gene transfer may prove to be useful as a clinical therapy for head and neck cancers.