• Title/Summary/Keyword: 크기조절알고리듬

Search Result 20, Processing Time 0.024 seconds

An Active Block Matching Algorithm by Adapts Search Area and Weights of Features Dynamically (탐색 영역과 특징의 가중치를 동적으로 조절하는 활동적 블록 정합 알고리듬)

  • Jang, Seok-Woo;Choe, Hyeong-Il
    • Journal of KIISE:Software and Applications
    • /
    • v.27 no.12
    • /
    • pp.1193-1201
    • /
    • 2000
  • 본 논문에서는 탐색 영역과 특징의 가중치를 동적으로 조절하여 블록 단위의 움직임 벡터를 추출하는 활동적 블록 정합 알고리듬을 제안한다. 본 논문에서 제안하는 알고리듬은 탐색 영역의 중심 위치를 결정하기 위해 시간에 따른 블록의 동작 변화는 작다고 가정한다. 그리고 탐색 영역의 크기는 공간적으로 인접한 블록들의 신뢰도에 따라 조절된다. 또한 본 논문에서 제안하는 알고리듬은 다중 특징을 사용하는 블록 정합 알고리듬으로 블록 정합 시 특징의 기여 정도를 나타내는 가중치를 블록 안에서 각 특징이 가지는 구분력에 따라 자동으로 설정하는 정합 유사 함수를 사용한다. 실험 결과는 본 논문에서 제안한 블록 정합 알고리듬이 기존의 알고리듬 보다 정확하게 움직임 벡터를 추출함을 보여준다.

  • PDF

Advanced JPEG bit rate control for the mobile multimedia device (이동형 멀티미디어 기기를 위한 개선된 JPEG 비트율 조절 알고리즘)

  • Yang, Yoon-Gi;Lee, Chang-Su;Kim, Jin-Yul
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.5
    • /
    • pp.579-587
    • /
    • 2008
  • Typically, the file sizes of JPEG compressed images with various complexity differ from images regardless of same image size. So, it is not easy to estimate the remaining image counts that should be stored in the limited storage equipped with the digital camera. To solve the problem, the bit rate control employs the modification of quantization table. The previous work assumed that there is linear relation between image activity and modification factor of quantization table, but in this paper, more accurate functional relations based on statistics are employed to improve the bit rate control accuracy. Computer simulations reveals that the standard deviation of the bit rate error of the proposed scheme is 50% less than that of the conventional method.

  • PDF

Topology Optimization of Plane Structures with Multi-Frequency Cases (다진동수를 고려한 평면구조물의 위상최적화)

  • Lee, Sang-Jin;Bae, Jung-Eun;Park, Gyeong-Im
    • Proceeding of KASS Symposium
    • /
    • 2006.05a
    • /
    • pp.233-238
    • /
    • 2006
  • This paper provides a new topology optimization technique which is intended to maximize the fundamental frequency with simultaneous consideration of other natural frequencies in the form of multi-frequency problems. The modal strain energy is considered as the objective function to be minimized and the initial volume of structures is used as the constraint function. The resizing algorithm based on the optimality criteria is adopted to update the hole size existing inside the material. From numerical tests, the proposed technique is found to be very effective to maximize the fundamental frequency of the structure and it can also successfully consider several higher mode effects into the optimum topology of structure through the introduction of weights.

  • PDF

The Natural Frequency Maximization of Beam Structures by using Modal Strain Energy based Topology Optimization Technique (모드변형에너지를 기저로 하는 위상최적화기법을 사용한 보의 고유진동수 최대화)

  • Lee, Sang-Jin;Bae, Jung-Eun
    • Journal of Korean Association for Spatial Structures
    • /
    • v.7 no.4
    • /
    • pp.89-96
    • /
    • 2007
  • The fundamental frequency maximization of beam structures is carried out by using strain energy based topology optimization technique. It mainly uses the modal strain energy distributions induced by the mode shapes of the structures. The modal strain energy to be minimized is employed as the objective function and the initial volume of structures is adopted as the constraint function. The resizing algorithm devised from the optimality criteria method is used to update the hole size of the cell existing in each finite element. The beams with three different boundary conditions are used to investigate the optimum topologies against natural mode shapes. From numerical test, it is found to be that the optimum topologies of the beams produced by the adopted technique have hugh increases in some values of natural frequencies and especially the technique is very effective to maximize the fundamental frequency of the structures.

  • PDF

Topology Optimization of General Plate Structures by Using Unsymmetric Layered Artificial Material Model (비대칭 층을 가지는 인공재료모델을 이용한 일반 평판구조물의 위상최적화)

  • Park, Gyeong-Im;Lee, Sang-Jin
    • Journal of Korean Association for Spatial Structures
    • /
    • v.7 no.5
    • /
    • pp.67-74
    • /
    • 2007
  • The unsymmetrically layered artificial material model is consistently introduced to find the optimum topologies of the plate structures. Reissner-Mindlin (RM) plate theory is adopted to formulate the present 9-node plate element considering the first-order shear deformation of the plates. In the topology optimization process, the strain energy to be minimized is employed as the objective function and the initial volume of structures is adopted as the constraint function. In addition, the resizing algorithm based on the optimality criteria is used to update the hole size introduced in the proposed artificial material model. Several numerical examples are rallied out to investigate the performance of the proposed technique. From numerical results, the proposed topology optimization techniques are found to be very effective to produce the optimum topology of plate structures. In particular, the proposed unsymmetric stiffening layer model make it possible to produce more realistic stiffener design of the plate structures.

  • PDF

Image Enhancement Using Homomorphic Transformation and Multiscale Decomposition (호모모프변환과 다중 스케일 분해를 이용한 영상향상)

  • Ahn, Sang-Ho;Kim, Ki-Hong;Kim, Young-Choon;Kwon, Ki-Ryong;Seo, Yong-Su
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.8
    • /
    • pp.1046-1057
    • /
    • 2004
  • An image enhancement method using both homomorphic transformation and multiscale decomposition is proposed. The original image is first transformed to homomorphic domain by taking the logarithm, is then separated to multiscales. These multiscales are combined with weighting. The combined signal is exponentially transformed back into intensity domain. In homomorphic domain, the magnitude control of low frequency component make change the dynamic range, and the magnitude control of the other frequency components contribute to enhancement of the contrast. The "${\AA}$ trous" algorithm, which has a simple and efficient scheme, is used for multiscale decomposition. The performance of proposed method is verified by simulation.

  • PDF

Input Power Normalization of Zero-Error Probability based Algorithms (영오차 확률 기반 알고리즘의 입력 정력 정규화)

  • Kim, Chong-il;Kim, Namyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.1
    • /
    • pp.1-7
    • /
    • 2017
  • The maximum zero error probability (MZEP) algorithm outperforms MSE (mean squared error)-based algorithms in impulsive noise environment. The magnitude controlled input (MCI) which is inherent in that algorithm is known to plays the role in keeping the algorithm undisturbed from impulsive noise. In this paper, a new approach to normalize the step size of the MZEP with average power of the MCI is proposed. In the simulation under impulsive noise with the impulse incident rate of 0.03, the performance enhancement in steady state MSE of the proposed algorithm, compared to the MZEP, is shown to be by about 2 dB.

Step Size Normalization for Maximum Cross-Correntropy Algorithms (최대 상호코렌트로피 알고리듬을 위한 스텝사이즈 정규화)

  • Kim, Namyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.9
    • /
    • pp.995-1000
    • /
    • 2016
  • The maximum cross-correntropy (MCC) algorithm with a set of random symbols keeps its optimum weights undisturbed from impulsive noise unlike MSE-based algorithms and its main factor has been known to be the input magnitude controller (IMC) that adjusts the input intensity according to error power. In this paper, a normalization of the step size of the MCC algorithm by the power of IMC output is proposed. The IMC output power is tracked recursively through a single-pole low-pass filter. In the simulation under impulsive noise with two different multipath channels, the steady state MSE and convergence speed of the proposed algorithm is found to be enhanced by about 1 dB and 500 samples, respectively, compared to the conventional MCC algorithm.

Efficient MAC Protocol for Achieving Fairness in Wireless Ad-hoc Networks under the DCF (Wireless Ad-hoc 망의 DCF환경에서 Fairness 구현을 위한 효과적인 MAC 프로토콜)

  • 임희선;박승권
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.8A
    • /
    • pp.928-936
    • /
    • 2004
  • This paper proposes simple and effective Contention Window (CW) adjusting algorithm to solve the fairness problem of the IEEE 802.11 under the Distributed Coordination Function (DCF). This adjusting algorithm can support variable packet length as well as both RTS/CTS access method and hidden nodes. Simulation results show that fairness problem can be very severe in the original MAC protocol of the wireless network. In case of implement our algorithm, fair sharing was enlarged prominently and the fairness sharing was improved about maximum 30%.

Fast RSST Algorithm Using Link Classification and Elimination Technique (가지 분류 및 제거기법을 이용한 고속 RSST 알고리듬)

  • Hong, Won-Hak
    • 전자공학회논문지 IE
    • /
    • v.43 no.4
    • /
    • pp.43-51
    • /
    • 2006
  • Segmentation method using RSST has many advantages in extracting of accurate region boundaries and controlling the resolution of segmented result and so on. In this paper, we propose three fast RSST algorithms for image segmentation. In first method, we classify links according to weight size for fast link search. In the second method, very similar links before RSST construction are eliminated. In third method, the links of very small regions which are not important for human eye are eliminated. As a result, the total times elapsed for segmentation are reduced by about 10 $\sim$ 40 times, and reconstructed images based on the segmentation results show little degradation of PSNR and visual quality.