• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.4
• /
• pp.1171-1187
• /
• 2012

A depth adjustment method for visual fatigue reduction for depth-image-based rendering (DIBR) system is proposed. One important aspect of the method is that no calibration parameters are needed for adjustment. By analyzing 3D image warping, the perceived depth is expressed as a function of three adjustable parameters: virtual view number, scale factor and depth value of zero parallax setting (ZPS) plane. Adjusting these three parameters according to the proposed parameter modification algorithm when performing 3D image warping can effectively change the perceived depth of stereo pairs generated in DIBR system. As the depth adjustment is performed in simple 3D image warping equations, the proposed method is facilitative for hardware implementation. Experimental results show that the proposed depth adjustment method provides an improvement in visual comfort of stereo pairs as well as generating comfortable stereoscopic images with different perceived depths that people desire.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.7
• /
• pp.628-632
• /
• 2001

We propose time-frequency (TF) tools for analyzing linear time-varying (LTV) systems and nonstationary random processes. Obtained warping the narrowband Weyl symbol (WS) and spreading function (SF), the new TF tools are useful for analyzing LTV systems and random processes characterized by generalized frequency shifts, This new Weyl symbol (WS) is useful in wideband signal analysis. We also propose WS an tools for analyzing systems which produce dispersive frequency shifts on the signal. We obtain these generalized, frequency-shift covariant WS by warping conventional, narrowband WS. Using the new, generalized WS, we provide a formulation for the Weyl correspondence for linear systems with instantaneous of linear signal transformation as weighted superpositions of non-linear frequency shifts on the signal. Application examples in signal and detection demonstrate the advantages of our new results.

• Communications of the Korean Mathematical Society
• /
• v.36 no.4
• /
• pp.783-800
• /
• 2021

We prove the non-existence of warped product GCR-lightlike submanifolds of the type K_⊥ × _λ K_T such that K_T is a holomorphic submanifold and K_⊥ is a totally real submanifold in an indefinite Kaehler manifold $\tilde{K}$. Further, the existence of GCR-lightlike warped product submanifolds of the type K_T × _λ K_⊥ is obtained by establishing a characterization theorem in terms of the shape operator and the warping function in an indefinite Kaehler manifold. Consequently, we find some necessary and sufficient conditions for an isometrically immersed GCR-lightlike submanifold in an indefinite Kaehler manifold to be a GCR-lightlike warped product, in terms of the canonical structures f and ω. Moreover, we also derive a geometric estimate for the second fundamental form of GCR-lightlike warped product submanifolds, in terms of the Hessian of the warping function λ.

• Honam Mathematical Journal
• /
• v.43 no.2
• /
• pp.289-304
• /
• 2021

In this paper, we establish several geometric characterizations focusing on the relationship between the squared norm of the second fundamental form and the warping function of SCR-lightlike warped product submanifolds in an indefinite Kaehler manifold. In particular, we find an estimate for the squared norm of the second fundamental form h in terms of the Hessian of the warping function λ for SCR-lightlike warped product submanifolds of an indefinite complex space form. Consequently, we derive an optimal inequality, namely $${\parallel}h{\parallel}^2{\geq}2q\{{\Delta}(ln{\lambda})+{\parallel}{\nabla}(ln{\lambda}){\parallel}^2+\frac{c}{2}p\}$$, for SCR-lightlike warped product submanifolds in an indefinite complex space form. We also provide one non-trivial example for this class of warped products in an indefinite Kaehler manifold.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1994.06c
• /
• pp.133-137
• /
• 1994

In this paper, a method for designing an optimal weight function for the weighted cepstral distance measure is proposed. A conventional weight function or cepstral lifter is obtained eperimentally depending on the spectral components to be emphasized. The proposed method minimizes the error between word reference patterns and the traning data. To compare the proposed optimal weight function with conventional function, speech recognition systems based on Dpynamic Time Warping and Hidden Markov Models were constructed to conduct speaker independent isolated word necogination eperiment. Results show that the proposed method gives better performance than conventional weight functions.

• The KIPS Transactions:PartD
• /
• v.9D no.2
• /
• pp.173-184
• /
• 2002

This paper discuss an index-based subsequence matching that supports time warping in large sequence databases. Time warping enables finding sequences with similar patterns even when they are of different lengths. In earlier work, Kim et al. suggested an efficient method for whole matching under time warping. This method constructs a multidimensional index on a set of feature vectors, which are invariant to time warping, from data sequences. For filtering at feature space, it also applies a lower-bound function, which consistently underestimates the time warping distance as well as satisfies the triangular inequality. In this paper, we incorporate the prefix-querying approach based on sliding windows into the earlier approach. For indexing, we extract a feature vector from every subsequence inside a sliding window and construct a multidimensional index using a feature vector as indexing attributes. For query processing, we perform a series of index searches using the feature vectors of qualifying query prefixes. Our approach provides effective and scalable subsequence matching even with a large volume of a database. We also prove that our approach does not incur false dismissal. To verify the superiority of our approach, we perform extensive experiments. The results reveal that our approach achieves significant speedup with real-world S&P 500 stock data and with very large synthetic data.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.4
• /
• pp.29-37
• /
• 2014

Since multi-view video exists a number of camera color image and depth image, it has a huge of data. Thus, a new compression technique is indispensable for reducing this data. Recently, the effective compression encoding technique for multi-view video that used in layered depth image concepts is a remarkable. This method uses several view point of depth information and warping function, synthesizes multi-view color and depth image, becomes one data structure. In this paper we use actual distance for solving overlap in layered depth image that reduce required data for reconstructing in color-based transform. In experimental results, we confirmed high compression performance and good quality of reconstructed image.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.501-512
• /
• 2003

This paper proposes an indexing technique for fast retrieval of similar image subsequences using the multi-dimensional time warping distance. The time warping distance is a more suitable similarity measure than Lp distance in many applications where sequences may be of different lengths and/or different sampling rates. Our indexing scheme employs a disk-based suffix tree as an index structure and uses a lower-bound distance function to filter out dissimilar subsequences without false dismissals. It applies the normaliration for an easier control of relative weighting of feature dimensions and the discretization to compress the index tree. Experiments on medical and synthetic image sequences verify that the proposed method significantly outperforms the naive method and scales well in a large volume of image sequence databases.

• Journal of the Korea Computer Graphics Society
• /
• v.21 no.5
• /
• pp.1-10
• /
• 2015

This study proposes a method of developing authoring tool that can easily and intuitively generate diverse digital leaves that compose virtual landscape. The main system of the proposed authoring tool consists of deformation method for the contour of leaf blade based on image warping, procedural modeling of leaf vein and visualization method based on mathematical model that expresses the color and brightness of leaves. First, the proposed authoring tool receives leaf input image and searches for contour information on the leaf blades. It then designs leaf blade deformation method that can generate diverse shapes of leaf blades in an intuitive structure using feature-based image warping. Based on the computed leaf blade contour, the system implements the generalized procedural modeling method suitable for the authoring tool that generates natural vein patterns appropriate for the leaf blade shape. Finally, the system applies visualization function that can express color and brightness of leaves and their changes over time using a mathematical model based on convolution sums of divisor functions. This paper provides texture support function so that the digital leaves that were generated using the proposed authoring tool can be used in a variety of three-dimensional digital contents field.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.1
• /
• pp.215-222
• /
• 2015

We show that homology group on a contact CR-warped product submanifold in odd dimensional sphere is zero under certain conditions in terms of warping function and the dimension of the submanifold.