• Title/Summary/Keyword: Convex Sets

Search Result 113, Processing Time 0.021 seconds

Weighted Edge Adaptive POCS Demosaicking Algorithm (Edge 가중치를 이용한 적응적인 POCS Demosaicking 알고리즘)

  • Park, Jong-Soo;Lee, Seong-Won
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.3
    • /
    • pp.46-54
    • /
    • 2008
  • Most commercial CCD/CMOS image sensors have CFA(Color Filter Array) where each pixel gathers light of a selective color to reduce the sensor size and cost. There are many algorithms proposed to reconstruct the original clolr image by adopting pettern recognition of regularization methods to name a few. However the resulting image still suffer from errors such as flase color, zipper effect. In this paper we propose an adaptive edge weight demosaicking algorithm that is based on POCS(Projection Onto Convex Sets) not only to improve the entire image's PSNR but also to reduce the edge region's errors that affect subjective image quality. As a result, the proposed algorithm reconstruct better quality images especially at the edge region.

An optimization technique for simultaneous reduction of PAPR and out-of-band power in NC-OFDM-based cognitive radio systems

  • Kaliki, Sravan Kumar;Golla, Shiva Prasad;Kurukundu, Rama Naidu
    • ETRI Journal
    • /
    • v.43 no.1
    • /
    • pp.7-16
    • /
    • 2021
  • Noncontiguous orthogonal frequency division multiplexing (NC-OFDM)-based cognitive radio (CR) systems achieve highly efficient spectrum utilization by transmitting unlicensed users' data on subcarriers of licensed users' data when they are free. However, there are two disadvantages to the NC-OFDM system: out-of-band power (OBP) and a high peak-to-average power ratio (PAPR). OBP arises due to side lobes of an NC-OFDM signal in the frequency domain, and it interferes with the spectrum for unlicensed users. A high PAPR occurs due to the inverse fast Fourier transform (IFFT) block used in an NC-OFDM system, and it induces nonlinear effects in power amplifiers. In this study, we propose an algorithm called "Alternative Projections onto Convex and Non-Convex Sets" that reduces the OBP and PAPR simultaneously. The alternate projections are performed onto these sets to form an iteration, and it converges to the specified limits of in-band-power, peak amplitude, and OBP. Furthermore, simulations show that the bit error rate performance is not degraded while reducing OBP and PAPR.

Postprocessing of Inter-Frame Coded Images Based on Convex Projection and Regularization (POCS와 정규화를 기반으로한 프레임간 압출 영사의 후처리)

  • Kim, Seong-Jin;Jeong, Si-Chang;Hwang, In-Gyeong;Baek, Jun-Gi
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.3
    • /
    • pp.58-65
    • /
    • 2002
  • In order to reduce blocking artifacts in inter-frame coded images, we propose a new image restoration algorithm, which directly processes differential images before reconstruction. We note that blocking artifact in inter-frame coded images is caused by both 8$\times$8 DCT and 16$\times$16 macroblock based motion compensation, while that of intra-coded images is caused by 8$\times$8 DCT only. According to the observation, we Propose a new degradation model for differential images and the corresponding restoration algorithm that utilizes additional constraints and convex sets for discontinuity inside blocks. The proposed restoration algorithm is a modified version of standard regularization that incorporate!; spatially adaptive lowpass filtering with consideration of edge directions by utilizing a part of DCT coefficients. Most of video coding standard adopt a hybrid structure of block-based motion compensation and block discrete cosine transform (BDCT). By this reason, blocking artifacts are occurred on both block boundary and block interior For more complete removal of both kinds of blocking artifacts, the restored differential image must satisfy two constraints, such as, directional discontinuities on block boundary and block interior Those constraints have been used for defining convex sets for restoring differential images.

ON A GENERALIZED BERGE STRONG EQUILIBRIUM

  • Kim, Won Kyu
    • Communications of the Korean Mathematical Society
    • /
    • v.29 no.2
    • /
    • pp.367-377
    • /
    • 2014
  • In this paper, we first introduce a generalized concept of Berge strong equilibrium for a generalized game $\mathcal{G}=(X_i;T_i,f_i)_{i{\in}I}$ of normal form, and using a fixed point theorem for compact acyclic maps in admissible convex sets, we establish the existence theorem of generalized Berge strong equilibrium for the game $\mathcal{G}$ with acyclic values. Also, we have demonstrated by examples that our new approach is useful to produce generalized Berge strong equilibria.

CONNECTEDNESS AND COMPACTNESS OF WEAK EFFICIENT SOLUTIONS FOR VECTOR EQUILIBRIUM PROBLEMS

  • Long, Xian Jun;Peng, Jian Wen
    • Bulletin of the Korean Mathematical Society
    • /
    • v.48 no.6
    • /
    • pp.1225-1233
    • /
    • 2011
  • In this paper, without assumption of monotonicity, we study the compactness and the connectedness of the weakly efficient solutions set to vector equilibrium problems by using scalarization method in locally convex spaces. Our results improve the corresponding results in [X. H. Gong, Connectedness of the solution sets and scalarization for vector equilibrium problems, J. Optim. Theory Appl. 133 (2007), 151-161].

A study on the parameter estimate using selective recursive least square (SRLS을 이용한 파라미터 추정에 관한 연구)

  • 유치형;이재하;정찬수
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1989.10a
    • /
    • pp.441-444
    • /
    • 1989
  • This correspondence presents a recursive estimation algorithm which, unlike conventional ones; updates the estimates only when a sufficient improvement can be obtained with a bounded noise assumption, the resulting sequence of estimates is a sequence of convex sets(ellipsoids) in the parameter space. For the cases studied, the algorithm use less than 20 percent of the. data to update, the estimate and still acquired good accuracy for spectral estimation.

  • PDF

How to Use CAS to Solve Certain Minmax Problems (어떤 최대최소문제들에 대한 컴퓨터대수체계(CAS)의 이용)

  • Kim, Seon-Hong
    • Journal of Integrative Natural Science
    • /
    • v.3 no.4
    • /
    • pp.241-245
    • /
    • 2010
  • In this paper, we study how to use CAS to solve certain minmax problems. More specifically, we reduce some to the problems about the packing of certain convex sets in the plane, and use Recognize algorithm to obtain good hypotheses for results. This method can be widely used to solve same types of mathematical problems.

Approximate solution of fuzzy quadratic Riccati differential equations

  • Tapaswini, Smita;Chakraverty, S.
    • Coupled systems mechanics
    • /
    • v.2 no.3
    • /
    • pp.255-269
    • /
    • 2013
  • This paper targets to investigate the solution of fuzzy quadratic Riccati differential equations with various types of fuzzy environment using Homotopy Perturbation Method (HPM). Fuzzy convex normalized sets are used for the fuzzy parameter and variables. Obtained results are depicted in term of plots to show the efficiency of the proposed method.