• Journal of Korea Multimedia Society
• /
• v.8 no.12
• /
• pp.1572-1580
• /
• 2005

The common requirements for watermarking are usually invisibility, robustness, and capacity. We proposed the watermarking for 3D mesh model based on projection onto convex sets for invisibility and robustness among requirements. As such, a 3D mesh model is projected alternatively onto two convex sets until it converge a point. The robustness convex set is designed to be able to embed watermark into the distance distribution of vertices. The invisibility convex set is designed for the watermark to be invisible based on the limit range of vertex movement. The watermark can be extracted using the decision values and index that the watermark was embedded with. Experimental results verify that the watermarked mesh model has both robustness against mesh simplification, cropping, affine transformations, and vertex randomization and invisibility.

• International Journal of Computer Science & Network Security
• /
• v.24 no.1
• /
• pp.85-94
• /
• 2024

In this paper, we present the very first time the generalized notion of (α, β, γ, δ) - convex (concave) function in mixed kind, which is the generalization of (α, β) - convex (concave) functions in 1^st and 2^nd kind, (s, r) - convex (concave) functions in mixed kind, s - convex (concave) functions in 1^st and 2^nd kind, p - convex (concave) functions, quasi convex(concave) functions and the class of convex (concave) functions. We would like to state the well-known Ostrowski inequality via SVN-Riemann Integrals for (α, β, γ, δ) - convex (concave) function in mixed kind. Moreover we establish some SVN-Ostrowski type inequalities for the class of functions whose derivatives in absolute values at certain powers are (α, β, γ, δ)-convex (concave) functions in mixed kind by using different techniques including Hölder's inequality and power mean inequality. Also, various established results would be captured as special cases with respect to convexity of function.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.3
• /
• pp.369-374
• /
• 2004

A cluster merging algorithm that merges convex clusters resulted by the Fuzzy Convex Clustering(FCC) method into non-convex clusters was proposed. This was achieved by proposing a fast and reliable distance measure between two convex clusters using Support Vector Machines(SVM) to improve accuracy and speed over other existing conventional methods. In doing so, it was possible to reduce cluster number without losing its representation of the data. In this paper, results for several data sets are given to show the validity of our distance measure and algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3A
• /
• pp.311-318
• /
• 2008

We propose new pulse shapes for FCC-compliant ultra-wideband (UWB) radios. The projections onto convex sets (POCS) technique is used to optimize temporal and spectral shapes of UWB pulses under the constraints of all of the desired UWB signal properties: efficient spectral utilization under the FCC spectral mask, time-limitedness, and good autocorrelation. Simulation results show that for all values of the pulse duration, the new pulse shapes not only meet the FCC spectral mask most efficiently, but also have nearly the same autocorrelation functions. It is also observed that our truncated (i.e., strictly time-limited) pulse shapes outperform the truncated Gaussian monocycle in the BER performance of binary TH-PPM systems for the same pulse durations. The POCS technique provides an effective method for designing UWB pulse shapes in terms of its inherent design flexibility and joint optimization capability.

• Communications for Statistical Applications and Methods
• /
• v.27 no.1
• /
• pp.129-140
• /
• 2020

In this paper, we introduce an efficient algorithm for the non-convex penalized multinomial logistic regression that can be uniformly applied to a class of non-convex penalties. The class includes most non-convex penalties such as the smoothly clipped absolute deviation, minimax concave and bridge penalties. The algorithm is developed based on the concave-convex procedure and modified local quadratic approximation algorithm. However, usual quadratic approximation may slow down computational speed since the dimension of the Hessian matrix depends on the number of categories of the output variable. For this issue, we use a uniform bound of the Hessian matrix in the quadratic approximation. The algorithm is available from the R package ncpen developed by the authors. Numerical studies via simulations and real data sets are provided for illustration.

• Bulletin of the Korean Mathematical Society
• /
• v.36 no.1
• /
• pp.203-207
• /
• 1999

In this paper, we find a condition of an open subset of the affine space which admits a cocompact affine action. To do it, the asymptotic flag of an open convex subset is introduced and some applications to affine manifolds are presented.

• Journal of the Chungcheong Mathematical Society
• /
• v.26 no.3
• /
• pp.533-539
• /
• 2013

In this paper, using the E-convexity, we introduce the generalized E-KKM map, and next prove the generalized E-KKM theorem which generalizes the KKM theorem due to Fan [4]. As an application, a fixed point theorem in E-convex sets is given.

• Honam Mathematical Journal
• /
• v.31 no.3
• /
• pp.315-321
• /
• 2009

Erd$\"{o}$s posed the problem of determining the minimum number g(n) such that any set of g(n) points in general position in the plane contains an empty convex n-gon. In 1978, Harborth proved that g(5) = 10. We reprove the result in a geometric approach.

• Journal of the Chungcheong Mathematical Society
• /
• v.27 no.1
• /
• pp.105-112
• /
• 2014

In this paper, we first introduce an R-E-KKM map in the E-convex settings, and next we prove an R-E-KKM theorem which generalizes the KKM theorem and the best proximity theorem simultaneously. As applications, a best proximity theorem and a fixed point theorem in E-convex sets are given.

• Journal of applied mathematics & informatics
• /
• v.15 no.1_2
• /
• pp.277-284
• /
• 2004

An m-transversal to a family of convex sets in the plane is an m-point set which intersects every members of the family. One of Grubaum's conjectures says that a planar family of translates of a convex compact set has a 3-transversal provided that any two of its members intersect. Recently the conjecture has been proved affirmatively (see [4]). In the present paper we provide a different and straightforward proof for the conjecture for the family of translates of a closed trapezoid in the plane and give several concrete 3-transversals.