• Title/Summary/Keyword: $a^*$ 값

Search Result 36,461, Processing Time 0.06 seconds

Indexing Algorithm Using Dynamic Threshold (동적임계값을 이용한 인덱싱 알고리즘)

  • 이문우;박종운;장종환
    • Journal of the Korea Computer Industry Society
    • /
    • v.2 no.3
    • /
    • pp.389-396
    • /
    • 2001
  • In detection of a scene change of the moving pictures which has massive information capacity, the temporal sampling method has a faster searching speed and lower missing scene change detection than the sequential searching method for the whole moving pictures, yet employed searching algorithm and detection interval greatly affect missing frame and searching precision. In this study, the whole moving pictures were primarily retrieved threshold by the temporal difference of histogram scene change detection method. We suggested a dynamic threshold algorithm using cut detection interval and derived an equation formula to determine optimal primary retrieval threshold which can cut detection interval computation. Experimental results show that the proposed dynamic threshold algorithm using cut detection interval method works up about 30 percent in precision of performance than the sequential searching method.

  • PDF

Genetic Algorithm Based Attribute Value Taxonomy Generation for Learning Classifiers with Missing Data (유전자 알고리즘 기반의 불완전 데이터 학습을 위한 속성값계층구조의 생성)

  • Joo Jin-U;Yang Ji-Hoon
    • The KIPS Transactions:PartB
    • /
    • v.13B no.2 s.105
    • /
    • pp.133-138
    • /
    • 2006
  • Learning with Attribute Value Taxonomies (AVT) has shown that it is possible to construct accurate, compact and robust classifiers from a partially missing dataset (dataset that contains attribute values specified with different level of precision). Yet, in many cases AVTs are generated from experts or people with specialized knowledge in their domain. Unfortunately these user-provided AVTs can be time-consuming to construct and misguided during the AVT building process. Moreover experts are occasionally unavailable to provide an AVT for a particular domain. Against these backgrounds, this paper introduces an AVT generating method called GA-AVT-Learner, which finds a near optimal AVT with a given training dataset using a genetic algorithm. This paper conducted experiments generating AVTs through GA-AVT-Learner with a variety of real world datasets. We compared these AVTs with other types of AVTs such as HAC-AVTs and user-provided AVTs. Through the experiments we have proved that GA-AVT-Learner provides AVTs that yield more accurate and compact classifiers and improve performance in learning missing data.

Complexity Reduction of HEVC SAO Intra Modes By Adjustment of Offset Values (HEVC SAO 인트라 모드 오프셋 값 조정을 통한 복잡도 감소)

  • Mun, Ji-Hun;Choi, Jung-Ah;Ho, Yo-Sung
    • Journal of Broadcast Engineering
    • /
    • v.19 no.3
    • /
    • pp.355-361
    • /
    • 2014
  • In this paper, we propose a complexity reduction method of sample adaptive offset (SAO), which is an in-loop filter in high-efficiency video coding (HEVC). In the conventional SAO, an offset value is calculated for each coding tree block (CTB) to minimize the error between the original and reconstructed images. In order to determine the optimal offset value, all offset candidates are examined and the offset value that leads to the smallest rate-distortion cost is chosen. Thus, SAO occupies a significant amount of the computational complexity in the HEVC encoder. In the proposed method, we determine the least-used band (LUB) by considering the statistical characteristics of offset values and without processing the offset value included in the LUB. Also, in the offset value decision stage, we check only a certain number of candidates rather than all of them. Experimental results show that the proposed method reduces the encoding time by approximately 8.15% without yielding a significant loss in terms of coding efficiency.

A New Learning Algorithm for Rare Class Classification (희귀 목적값 분류를 위한 학습 알고리즘)

  • Lee, Kwang-Ho;Lee, Chang-Hwan
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2006.11a
    • /
    • pp.39-42
    • /
    • 2006
  • 본 논문에서는 데이터 마이닝에서 발생되는 희귀 데이터를 분석하기 위한 희귀 목적값 분석의 새로운 알고리즘을 제시한다. 이를 위하여 속성들이 가지는 속성의 가중치 값과 속성값이 목적 속성에 미치는 가중치값을 정보이론에 입각하여 가중치 계산을 하고, 계산된 가중치값을 사용하여 스코어링 함으로써 희귀 목적값에 속한 데이터 예측/분류에 사용하는 방법을 제시하였다. 실험을 통해 본 알고리즘의 성능을 입증함은 물론 제안된 알고리즘이 희귀 데이터의 분류/학습에 좀 더 효과적이다는 것을 보였다.

  • PDF

A Performance Evaluation of Value Predictors in a Superscalar Processor (슈퍼스칼라 프로세서에서 값 예측기의 성능평가)

  • 전병찬;박희룡;이상정
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.10c
    • /
    • pp.10-12
    • /
    • 2001
  • 와이드 이슈 슈퍼스칼라 프로세서에서 값 예측기는 한 명령어의 결과를 미리 예측하여 명령들 간의 데이터 종속관계를 극복하고 실행함으로써 명령어 수준 병렬성(Instruction Level Parallesim ILP)을 향상시키는 기법이다. 본 논문에서는 명령어 수준 병렬성을 이용하여 성능을 향상시키기 위하여 데이터 값을 미리 예측하여 병렬로 이슈하고 수행하는 값 예측기의 성능을 비교분석 한다. 먼저 값 예측기 종류별로 성능을 측정한다 그리고 테이블의 갱신시점, 트레이스 캐시 유무 및 명령윈도우 크기에 따른 값 예측기의 성능영향을 평가분석 한다. 성능분석 결과 최근 값 예측기가 간소한 하드웨어 구성에도 불구하고 우수한 성능을 보였다. 그리고 예측테이블 갱신시점과 트레이스캐시의 사용이 값 예측기의 성능향상에 영향을 주었다.

  • PDF

Variable Dynamic Threshold Method for Video Cut Detection (동영상 컷 검출을 위한 가변형 동적 임계값 기법)

  • 염성주;김우생
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.4A
    • /
    • pp.356-363
    • /
    • 2002
  • Video scene segmentation is fundamental role for content based video analysis and many kinds of scene segmentation schemes have been proposed in previous researches. However, there is a problem, which is to find optimal threshold value according to various kinds of movies and its content because only fixed single threshold value usually used for cut detection. In this paper, we proposed the variable dynamic threshold method, which change the threshold value by a probability distribution of cut detection interval and information of frame feature differences and cut detection interval in previous cut detection is used to determine the next cut detection. For this, we present a cut detection algorithm and a parameter generation method to change the threshold value in runtime. We also show the proposed method, which can minimize fault alarm rate than the existing methods efficiently by experimental results.

Semi-supervised SAR Image Classification with Threshold Learning Module (임계값 학습 모듈을 적용한 준지도 SAR 이미지 분류)

  • Jae-Jun Do;Sunok Kim
    • The Journal of Bigdata
    • /
    • v.8 no.2
    • /
    • pp.177-187
    • /
    • 2023
  • Semi-supervised learning (SSL) is an effective approach to training models using a small amount of labeled data and a larger amount of unlabeled data. However, many papers in the field use a fixed threshold when applying pseudo-labels without considering the feature-wise differences among images of different classes. In this paper, we propose a SSL method for synthetic aperture radar (SAR) image classification that applies different thresholds for each class instead of using a single fixed threshold for all classes. We propose a threshold learning module into the model, considering the differences in feature distributions among classes, to dynamically learn thresholds for each class. We compare the application of a SSL SAR image classification method using different thresholds and examined the advantages of employing class-specific thresholds.

An Automatic Cut Detection Algorithm Using Median Filter And Neural Network (중간값 필터와 신경망 회로를 사용한 자동 컷 검출 알고리즘)

  • Jun, Seung-Chul;Park, Sung-Han
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.4
    • /
    • pp.381-387
    • /
    • 2002
  • In this paper, an efficient method to find shot boundaries in the MPEG video stream data is proposed. For this purpose, we first assume that the histogram difference value(HDV) and pixel difference value(PDV) as an one dimensional signal and apply the median filter to these signals. The output of the median filter is subtracted from the original signal to produce the median filtered difference(MFD). The MFD is a criterion of shot boundary. In addition a neural network is employed and trained to find exactly cut boundary. The proposed algorithm shows that the cut boundaries are well extracted, especially in a dynamic video.

Contrast Sensitivity as a Function of Spatial Frequency for 12 Year Old Child-Eye (눈의 공간주파수와 대비 민감도 함수(CSF) 특성에 대한 연구)

  • Kim, Yong Geun;Park, Sang-An
    • Journal of Korean Ophthalmic Optics Society
    • /
    • v.4 no.1
    • /
    • pp.63-68
    • /
    • 1999
  • It was made of a chart by new method to be measured the contrast sensitivity for a spatial frequency, and the mean luminance of a lattice frequency was made to three forms of 25, 50, 75% and let it to be ready a CS value from 0 to $10^3$. As a result of measuring of the CS value for a spatial frequency on a target of 12 year old students, CS value decreased of according to down the average luminance value and also the peak position shift to low spatial frequency. The low visioned person decreased the CS value in side of high frequency or in space of total frequency. By the lattice adaptation, a measured CS value was decreased in circumstance regions of adapted space frequency.

  • PDF

A Method Processing Missing Values for Data Mining based on Artificial Neural Network (데이터 마이닝을 위한 신경망 이용 결측 값 처리 방법)

  • 성지애;류정우;김명원
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.04c
    • /
    • pp.446-448
    • /
    • 2003
  • 실세계의 많은 데이터는 결측 값들을 포항하고 있기 때문에 데이터 마이닝 시스템에 완벽한 데이터를 제공하기는 불가능하다. 또한 결측 값이 존재하는 대용량의 데이터를 추천시스템에 적용하여 분석하고자 할 경우, 정확성이 떨어지는 결과를 초래할 수 있다. 따라서 데이터에 결측 값이 존재할 경우 입력 데이터를 사전에 보간하는 전처리 방법이 필요하다. 이러한 기존의 보간 전처리 방법에는 결측 값 속성을 삭제하거나 대치하는 방범이 대표적이나. 삭제 방법은 결측 값이 존재하는 데이터를 제거하는 방법으로 중요속성 삭제 및 데이터 손실을 유발하는 단점이 있어 일반적으로 결측 값을 다른 값으로 처리하는 대치 방범이 널리 사용된다. 본 논문에서는 전처리 방법 중 결측 값을 처리하는 가장 일반적인 대치 방법과 신경망을 이용한 평가 예측 처리 방법을 소개한다. 또한 신경망을 이용 결측 값을 대치하는 새로운 모델을 제안하고, 각각의 결측 값 처리방법을 비교 분석한다.

  • PDF