• Title/Summary/Keyword: Chen algorithm

Search Result 480, Processing Time 0.063 seconds

DCT/DFT Hybrid Algorithm using Simple Element Inverse (단순 엘레멘트 인버스를 이용한 DCT/DFT 하이브리드 알고리즘)

  • Lee, Kwang-Jae;Park, Dae-Chul;Lee, Moon-Ho;Sin, Tae-Chol;Chen, Zhu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.6C
    • /
    • pp.594-599
    • /
    • 2007
  • In this paper, we present new representation of DCT/DFT matrices via one hybrid architecture. Based on a element inverse matrix factorization algorithm, we show that the DCT and DFT have a same recursive computational pattern, and we can develop an hybrid architecture by using some diagonal matrices.

RGBW Transflective TFT LCDs with Adjustable Reflective Color Gamut by Image Processing Algorithm

  • Yang, Tun-Chun;Hung, Kuo-Yung;Pei, Chih-Chun;Hu, Chih-Jen;Chang, Chih-Ming;Chen, Po-Lun;Lin, Kun-Yu
    • 한국정보디스플레이학회:학술대회논문집
    • /
    • 2006.08a
    • /
    • pp.209-214
    • /
    • 2006
  • Adjustable reflective color gamut RGBW transflective liquid crystal display (ARC RGBW TRLCD) applied simple manufacture process and image processing algorithm to achieve high brightness and good color performance both in transmissive and reflective mode. With appropriate modification higher transmittance but no color distortion happens in transmissive mode. Moreover, base on superior reflectance total brightness and color gamut also can be modified under different ambience. It provides the flexibility not only for any environments but also for variant personal hobbies. It is the best technique used both at indoor and outdoor.

  • PDF

A Study on Computing Pit Excavation Volume by Terrain Surface Approximation (지형곡면해석에 의한 토공량 계산에 관한 연구)

  • 문두열;정범석
    • Journal of Ocean Engineering and Technology
    • /
    • v.16 no.6
    • /
    • pp.37-43
    • /
    • 2002
  • The calculation of earthwork plays a major role in the plan or design phase of many civil engineering projects, such as seashore reclamation; and thus, it has become very important to improve upon its accuracy. There have been common drawbacks to earlier methods of ground profiling, such as dialing with sharp corners or the grid points of any tow straight lines. In this paper, we prepose an algorithm for finding a terrain surface using the natural boundary conditions and the both direction spline method, which interpolates the given three-dimensional data by using spline. As a result of this study, the algorithm of the proposed two methods to estimate pit excavation volume should provide a better accuracy than Spot height, Chambers, Chen, or Lin method. Also, the mathematical model mentioned offers maximum accuracy in estimating the volume of a pit excavation.

A PROXIMAL POINT ALGORITHM FOR SOLVING THE GENERAL VARIATIONAL INCLUSIONS WITH M(·, ·)-MONOTONE OPERATORS IN BANACH SPACES

  • Chen, Junmin;Wang, Xian;He, Zhen
    • East Asian mathematical journal
    • /
    • v.29 no.3
    • /
    • pp.315-326
    • /
    • 2013
  • In this paper, a new monotonicity, $M({\cdot},{\cdot})$-monotonicity, is introduced in Banach spaces, and the resolvent operator of an $M({\cdot},{\cdot})$-monotone operator is proved to be single valued and Lipschitz continuous. By using the resolvent operator technique associated with $M({\cdot},{\cdot})$-monotone operators, we construct a proximal point algorithm for solving a class of variational inclusions. And we prove the convergence of the sequences generated by the proximal point algorithms in Banach spaces. The results in this paper extend and improve some known results in the literature.

Collision-free tool orientation optimization in five-axis machining of bladed disk

  • Chen, Li;Xu, Ke;Tang, Kai
    • Journal of Computational Design and Engineering
    • /
    • v.2 no.4
    • /
    • pp.197-205
    • /
    • 2015
  • Bladed disk (BLISK) is a vital part in jet engines with a complicated shape which is exclusively machined on a five-axis machine and requires high accuracy of machining. Poor quality of tool orientation (e.g., false tool positioning and unsmooth tool orientation transition) during the five-axis machining may cause collision and machine vibration, which will debase the machining quality and in the worst case sabotage the BLISK. This paper presents a reference plane based algorithm to generate a set of smoothly aligned tool orientations along a tool path. The proposed method guarantees that no collision would occur anywhere along the tool path, and the overall smoothness is globally optimized. A preliminary simulation verification of the proposed algorithm is conducted on a BLISK model and the tool orientation generated is found to be stable, smooth, and well-formed.

A Collaborative and Predictive Localization Algorithm for Wireless Sensor Networks

  • Liu, Yuan;Chen, Junjie
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.7
    • /
    • pp.3480-3500
    • /
    • 2017
  • Accurate locating for the mobile target remains a challenge in various applications of wireless sensor networks (WSNs). Unfortunately, most of the typical localization algorithms perform well only in the WSN with densely distributed sensor nodes. The non-localizable problem is prone to happening when a target moves into the WSN with sparsely distributed sensor nodes. To solve this problem, we propose a collaborative and predictive localization algorithm (CPLA). The Gaussian mixture model (GMM) is introduced to predict the posterior trajectory for a mobile target by training its prior trajectory. In addition, the collaborative and predictive schemes are designed to solve the non-localizable problems in the two-anchor nodes locating, one-anchor node locating and non-anchor node locating situations. Simulation results prove that the CPLA exhibits higher localization accuracy than other tested predictive localization algorithms either in the WSN with sparsely distributed sensor nodes or in the WSN with densely distributed sensor nodes.

Improved Contrast for Threshold Random-grid-based Visual Cryptography

  • Hu, Hao;Shen, Gang;Fu, Zhengxin;Yu, Bin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.7
    • /
    • pp.3401-3420
    • /
    • 2018
  • Pixel expansion and contrast are two major performance parameters for visual cryptography scheme (VCS), which is a type of secret image sharing. Random Grid (RG) is an alternative approach to solve the pixel expansion problem. Chen and Tsao proposed the first (k, n) RG-based VCS, and then Guo et al., Wu et al., Shyu, and Yan et al. significantly improved the contrast in recent years. However, the investigations on improving the contrast of threshold RG-based VCS are not sufficient. In this paper, we develop a contrast-improved algorithm for (k, n) RG-based VCS. Theoretical analysis and experimental results demonstrate that the proposed algorithm outperformers the previous threshold algorithms with better visual quality and a higher accuracy of contrast.

A Chinese Spam Filter Using Keyword and Text-in-Image Features

  • Chen, Ying-Nong;Wang, Cheng-Tzu;Lo, Chih-Chung;Han, Chin-Chuan;Fana, Kuo-Chin
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.32-37
    • /
    • 2009
  • Recently, electronic mail(E-mail) is the most popular communication manner in our society. In such conventional environments, spam increasingly congested in Internet. In this paper, Chinese spam could be effectively detected using text and image features. Using text features, keywords and reference templates in Chinese mails are automatically selected using genetic algorithm(GA). In addition, spam containing a promotion image is also filtered out by detecting the text characters in images. Some experimental results are given to show the effectiveness of our proposed method.

  • PDF

STRONG CONVERGENCE OF A NEW ITERATIVE ALGORITHM FOR AVERAGED MAPPINGS IN HILBERT SPACES

  • Yao, Yonghong;Zhou, Haiyun;Chen, Rudong
    • Journal of applied mathematics & informatics
    • /
    • v.28 no.3_4
    • /
    • pp.939-944
    • /
    • 2010
  • Let H be a real Hilbert space. Let T : $H\;{\rightarrow}\;H$ be an averaged mapping with $F(T)\;{\neq}\;{\emptyset}$. Let {$\alpha_n$} be a real numbers in (0, 1). For given $x_0\;{\in}\;H$, let the sequence {$x_n$} be generated iteratively by $x_{n+1}\;=\;(1\;-\;{\alpha}_n)Tx_n$, $n\;{\geq}\;0$. Assume that the following control conditions hold: (i) $lim_{n{\rightarrow}{\infty}}\;{\alpha}_n\;=\;0$; (ii) $\sum^{\infty}_{n=0}\;{\alpha}_n\;=\;{\infty}$. Then {$x_n$} converges strongly to a fixed point of T.

Preconditioned Compressible Navier- Stokes Algorithm for Low Mach Number Flows (예조건화 압축성 알고리즘에 의한 저마하수 유동장 해석기법)

  • Ko Hyun;Yoon Woong-Sup
    • 한국전산유체공학회:학술대회논문집
    • /
    • 1998.05a
    • /
    • pp.35-42
    • /
    • 1998
  • Time marching algorithms applied to compressible Navier-Stokes equation have a convergence problem at low Mach number. It is mainly due to the eigenvalue stiffness and pressure singularity as Mach number approaches to zero. Among the several methods to overcome the shortcomings of time marching scheme, time derivative preconditioning method have been used successfully. In this numerical analysis, we adopted a preconditioner of K.H. Chen and developed a two-dimensional, axisymmetric Navier-Stokes program. The steady state driven cavity flow and backward facing step flow problems were computed to confirm the accuracy and the robustness of preconditioned algorithm for low Mach number flows. And the transonic and supersonic flows insice the JPL axisymmetric nozzle internal flow is exampled to investigate the effects of preconditioning at high Mach number flow regime. Test results showed excellent agreement with the experimental data.

  • PDF