• Bulletin of the Korean Mathematical Society
• /
• v.57 no.4
• /
• pp.851-864
• /
• 2020

This paper gives a sparse domination for the iterated commutators of multilinear pseudo-differential operators with the symbol σ belonging to the Hörmander class, and establishes the quantitative bounds of the Bloom type estimates for such commutators. Moreover, the C_p estimates for the corresponding multilinear pseudo-differential operators are also obtained.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.4
• /
• pp.2109-2123
• /
• 2017

This paper presents a super-resolution reconstruction method based on sparse representation for two-dimensional bar code images. Considering the features of two-dimensional bar code images, Kirsch and LBP (local binary pattern) operators are used to extract the edge gradient and texture features. Feature extraction is constituted based on these two features and additional two second-order derivatives. By joint dictionary learning of the low-resolution and high-resolution image patch pairs, the sparse representation of corresponding patches is the same. In addition, the global constraint is exerted on the initial estimation of high-resolution image which makes the reconstructed result closer to the real one. The experimental results demonstrate the effectiveness of the proposed algorithm for two-dimensional bar code images by comparing with other reconstruction algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2468-2483
• /
• 2017

The construction of completely random sensing matrices of Compressive Sensing requires a large number of random numbers while that of deterministic sensing operators often needs complex mathematical operations. Thus both of them have difficulty in acquiring large signals efficiently. This paper focuses on the enhancement of the practicability of the structurally random matrices and proposes a semi-deterministic sensing matrix called Partial Kronecker product of Identity and Hadamard (PKIH) matrix. The proposed matrix can be viewed as a sub matrix of a well-structured, sparse, and orthogonal matrix. Only the row index is selected at random and the positions of the entries of each row are determined by a deterministic sequence. Therefore, the PKIH significantly decreases the requirement of random numbers, which has a complex generating algorithm, in matrix construction and further reduces the complexity of sampling. Besides, in order to process large signals, the corresponding fast sampling algorithm is developed, which can be easily parallelized and realized in hardware. Simulation results illustrate that the proposed sensing matrix maintains almost the same performance but with at least 50% less random numbers comparing with the popular sampling matrices. Meanwhile, it saved roughly 15%-35% processing time in comparison to that of the SRM matrices.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.6
• /
• pp.1791-1809
• /
• 2018

Let T be the singular integral operator with nonsmooth kernel which was introduced by Duong and McIntosh, and $T_q(q{\in}(1,{\infty}))$ be the vector-valued operator defined by $T_qf(x)=({\sum}_{k=1}^{\infty}{\mid}T\;f_k(x){\mid}^q)^{1/q}$. In this paper, by proving certain weak type endpoint estimate of L log L type for the grand maximal operator of T, the author establishes some quantitative weighted bounds for $T_q$ and the corresponding vector-valued maximal singular integral operator.

• Korean Journal of Construction Engineering and Management
• /
• v.5 no.5 s.21
• /
• pp.163-171
• /
• 2004

This research investigates a Modeling Spell Checker that, similarly to Word Spell Checker for word processing software, would conform as-built 3D models to standard construction rules. The work is focused on the study of pipe-spools. Specifically pipe diameters and coplanarity are checked and corrected by the Modeling Spell Checker, and elbows are deduced and modeled to complete models. Experiments have been conducted by scanning scenes of increasing levels of complexity regarding the number of pipes, the types of elbows and the number of planes constituting pipe-spools. For building models of pipes from sensed data, a modeling method, developed at the University of Texas at Austin, that is based on the acquisition of sparse point clouds and the human ability to recognize geometric shapes has been used Results show that primitive-based models obtained after scanning construction sites can be corrected and even improved automatically, and, since such models are expected to be used as feedback control models for equipment operators, the higher modeling accuracy achieved with the Modeling Spell Checker could potentially increase the level of safety in construction. Result also show that some improvements are still needed especially regarding the co-planarity of pipes. In addition, results show that the modeling accuracy significantly depends on the primitive modeling method, and improvement of that method would positively impact the modeling spell checker.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.9
• /
• pp.53-62
• /
• 1998

In this paper, a genetic algorithm-based optimization technique for stereo matching is proposed. Stereo matching is an essential process to recover three-dimensional structure of objects. The proposed two-dimensional chromosomes consist fo disparity values. The cost function of each chromosome is composed of the intensity-difference between two images and smoothness of disparity. The crossover and mutation operators in the two-dimensional chromosomes are described. The operations are affected by the disparities of neighbor pixels. The knowledge-augmented operators are shown to result in rapid convergence and stable result. The genetic algorithm for stereo matching is tested on synthetic and natural images. Experimental results of various images show that the proposed algorithm has good performance even if the images have too dense or sparse feature points. severe noise, and repeating pattern.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.29 no.9 s.240
• /
• pp.1049-1056
• /
• 2005

A conservative pressure-based finite-volume numerical method has been developed for computing flow and heat transfer by using an unstructured grid system. The method admits arbitrary convex polyhedra. Care is taken in the discretization and solution procedures to avoid formulations that are cell-shape-specific. A collocated variable arrangement formulation is developed, i.e. all dependent variables such as pressure and velocity are stored at cell centers. Gradients required for the evaluation of diffusion fluxes and for second-order-accurate convective operators are found by a novel second-order accurate spatial discretization. Momentum interpolation is used to prevent pressure checkerboarding and the SIMPLE algorithm is used for pressure-velocity coupling. The resulting set of coupled nonlinear algebraic equations is solved by employing a segregated approach, leading to a decoupled set of linear algebraic equations fer each dependent variable, with a sparse diagonally dominant coefficient matrix. These equations are solved by an iterative preconditioned conjugate gradient solver which retains the sparsity of the coefficient matrix, thus achieving a very efficient use of computer resources.

• Journal of KIISE:Databases
• /
• v.34 no.1
• /
• pp.18-34
• /
• 2007

In order to provide various business analysis methods, OLAP(On-Line Analytical Processing) systems represent their data with multidimensional structures. These multidimensional data are often delivered to users in the horizontal format of tables whose columns are corresponding to values of dimension attributes. Since the horizontal tables nay have a large number of columns, they cannot be stored directly in relational database systems. Furthermore, the tables are likely to have many null values (i.e., sparse tables). In order to manage the horizontal tables efficiently, we can store them as the vertical format of tables which has dimension attribute names as their columns thus transforms the columns of horizontal tables into rows. In this way, every queries for horizontal tables have to be transformed into those for vertical tables. This paper proposed a technique for transforming horizontal table queries into vertical table ones by utilizing not only traditional relational algebraic operators but also the PIVOT operator which recent DBMS versions are providing. For achieving this goal, we designed a relational algebraic expression equivalent to the PIVOT operator and we formally proved their equivalence. Then, we developed a transformation technique for horizontal table queries using the PIVOT operator. We also performed experiments to analyze the performance of the proposed method. From the experimental results, we revealed that the proposed method has better performance than existing methods.

• Journal of Korean Tunnelling and Underground Space Association
• /
• v.23 no.1
• /
• pp.13-24
• /
• 2021

Tunnel boring machine (TBM) is widely used for tunnel excavation in hard rock and soft ground. In the perspective of TBM-based tunneling, one of the main challenges is to drive the machine optimally according to varying geological conditions, which could significantly lead to saving highly expensive costs by reducing the total operation time. Generally, drilling investigations are conducted to survey the geological ground before the TBM tunneling. However, it is difficult to provide the precise ground information over the whole tunnel path to operators because it acquires insufficient samples around the path sparsely and irregularly. To overcome this issue, in this study, we proposed a geological type classification system using the TBM operating data recorded in a 5 s sampling rate. We first categorized the various geological conditions (here, we limit to granite) as three geological types (i.e., rock, soil, and mixed type). Then, we applied the preprocessing methods including outlier rejection, normalization, and extracting input features, etc. We adopted a deep neural network (DNN), which has 6 hidden layers, to classify the geological types based on TBM operating data. We evaluated the classification system using the 10-fold cross-validation. Average classification accuracy presents the 75.4% (here, the total number of data were 388,639 samples). Our experimental results still need to improve accuracy but show that geology information classification technique based on TBM operating data could be utilized in the real environment to complement the sparse ground information.