• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10b
• /
• pp.54-59
• /
• 1993

This paper presents a method of estimating 3-D surface geometrical features that are necessary for 3-D object recognition and image interpretation. The features, such as surface needle maps and curvatures, are computed from range or intensity images. In general, the range and intensity images are prone to noises, and hence the features computed by differentiation calculi on such a noisy image are hardly applicable to industrial recognition tasks. In our approach, we try to obtain a more accurate estimate of the features by using a least-squares minimization procedure subject to local curvature consistency constraints. The algorithm is robust with respect to noises and is completely independent of the viewpoint at which the image is taken. The performance of the ajgoritlim is evaluated using both synthetic data and real intensity images.

• Journal of the Korea Construction Safety Engineering Association
• /
• s.52
• /
• pp.58-66
• /
• 2011

This study presents an algorithm to select the best alternative plane among various bridge superstructure types (Steel box girder, Rational girder, PSC-I girder) using Value Engineering (VE). Economical efficiency, landscape, constructability, maintenance, stability, function of bridge superstructure were taken into consideration in the designing of bridge. Economical efficiency was evaluated for each alternative plan with optimal design considering Life Cycle Cost (LCC), Repair and rehabilitation histories and some factors were set to get reasonable results. In the application of Analytic Hierarchy Process (AHP), consistency of Pairwise Comparisons Matrix was evaluated and the best plan was determined.

• Journal of the Korean Society of Safety
• /
• v.24 no.6
• /
• pp.79-85
• /
• 2009

This study presents an algorithm to select the best alternative plane among various bridge superstructure types(Steel box girder, Rational girder, PSC-I girder) using Value Engineering(VE). Economical efficiency, landscape, constructability, maintenance, stability, function of bridge superstructure were taken into consideration in the designing of bridge. Economical efficiency was evaluated for each alternative plan with optimal design considering Life Cycle Cost(LCC). Repair and rehabilitation histories and some factors were set to get reasonable results. In the application of Analytic Hierarchy Process(AHP), consistency of Pairwise Comparisons Matrix was evaluated and the best plan was determined.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.22 no.1
• /
• pp.61-73
• /
• 2012

The paper presents the novel approach to solve some problems occurred in application of the genetic algorithm to the determination of the optimal tire pattern sequence in order to reduce the tire air-pumping noise which is generated by the repeated compression and expansion of the air cavity between tire pattern and road surface. The genetic algorithm has been used to find the optimal tire pattern sequence having a low level of tire air-pumping noise using the image based air-pumping model. In the genetic algorithm used in the previous researches, there are some problems in the encoding structure and the selection of objective function. The paper proposed single encoding element with five integers, divergent objective function based on evolutionary process and the optimal evolutionary rate based on Shannon entropy to solve the problems. The results of the proposed genetic algorithm with evolutionary process are compared with those of the randomized algorithm without evolutionary process on the two-dimensional normal distribution. It is confirmed that the genetic algorithm is more effective to reduce the peak value of the predicted tire air-pumping noise and the consistency and cohesion of the obtained simulation results are also improved in terms of probability.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2310-2326
• /
• 2000

Client-server DBMS based on a data-shipping model can exploit e1ient resources effectively by allowing inter-transaction caching. However, inter-transaction caching raises the need of transactional cache consistency maintenancetTCCM protocol. since each client is able to cache a portion of the database dynamically. Deferred locking(DL) is a new detection-based TCCM scheme designed on the basis of a primary copy locking algorithm. In DL, a number of lock ,ujuests and a data shipping request are combined into a single message packet to minimize the communication overhead required for consistency checking. Lsing a simulation model. the performance of the prolxlsed scheme is compared with those of two representative detection based schemes, the adaptive optimistic concurrency control and the caching two-phase locking. The performance results indicate that DL improves the overall system throughput with a reasonable transaction abort ratio over other detection - based schemes.

• Journal of Broadcast Engineering
• /
• v.27 no.2
• /
• pp.207-215
• /
• 2022

The latest volumetric technology's high geometrical accuracy and realism ensure a high degree of correspondence between the real object and the captured 3D model. Nevertheless, since the 3D model obtained in this way constitutes a sequence as a completely independent 3D model between frames, the consistency of the model surface structure (geometry) is not guaranteed for every frame, and the density of vertices is very high. It can be seen that the interconnection node (Edge) becomes very complicated. 3D models created using this technology are inherently different from models created in movie or video game production pipelines and are not suitable for direct use in applications such as real-time rendering, animation and simulation, and compression. In contrast, our method achieves consistency in the quality of the volumetric 3D model sequence by linking re-meshing, which ensures high consistency of the 3D model surface structure between frames and the gradual deformation and texture transfer through correspondence and matching of non-rigid surfaces. And It maintains the consistency of volumetric 3D model sequence quality and provides post-processing automation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.2
• /
• pp.438-446
• /
• 2013

Generally, a camera isn't located at the center of display in a tele-presence system and it causes an incorrect eye contact between speakers which reduce the realistic feeling during the conversation. To solve this incorrect eye contact problem, we newly propose an intermediate view reconstruction algorithm using both a color camera and a depth camera and applying for the depth image based rendering (DIBR) algorithm. In the proposed algorithm, an efficient hole filling method using the arithmetic mean value of neighbor pixels and an efficient boundary noise removal method by expanding the edge region of depth image are included. We show that the generated eye-contacted image has good quality through experiments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11A
• /
• pp.1946-1956
• /
• 2001

In this paper, we propose a novel 2-D partial matching algorithm based on model-based stochastic analysis of feature correspondences in a relation vector space, which is quite robust to shape variations as well as invariant to geometric transformations. We represent an object using the ARG (Attributed Relational Graph) model with features of a set of relation vectors. In addition, we statistically model the partial occlusion or noise as the distortion of the relation vector distribution in the relation vector space. Our partial matching algorithm consists of two-phases. First, a finite number of candidate sets areselected by using logical constraint embedding local and structural consistency Second, the feature loss detection is done iteratively by error detection and voting scheme thorough the error analysis of relation vector space. Experimental results on real images demonstrate that the proposed algorithm is quite robust to noise and localize target objects correctly even inseverely noisy and occluded scenes.

• Journal of KIISE:Software and Applications
• /
• v.31 no.2
• /
• pp.203-212
• /
• 2004

The watermarking is a method to achieve the copyright protection of multimedia contents. Among several media, the left documents show very peculiar properties: block/line/word patterning, clear separation between foreground and background areas. So algorithms specific to the text documents are required that meet those properties. This paper proposes a novel watermarking algorithm for the grayscale text document images. The algorithm inserts the watermark signals through the edge direction histograms. A concept of sub-image consistency is developed that the sub-images have similar shapes in terms of edge direction histograms. Using Korean, Chinese, and English document images, the concept is evaluated and proven to be valid over a wide range of document images. To insert watermark signals, the edge direction histogram is modified slightly. The experiments were performed on various document images and the algorithm was evaluated in terms of imperceptibility and robustness.

• Journal of the Korean Statistical Society
• /
• v.18 no.1
• /
• pp.13-25
• /
• 1989

This paper suggests a classification rule with unequal covariance matrices when a patterned incomplete data are involved in the discriminant analysis. This is an extension of Geisser's (1966) result to the case of missing observations. For the calssificaiton rule, we introduce an algorithm which contains data augmentation step and Monte Carlo integration step and show that the algorithm yields a consistant estimator of true classification probability. The proposed method is compared to the complete observation vector method through a Monte Carlo study. The results show that the suggested method, in general, performs better than the complete observation vector method which ignores those vectors of observation with one or more missing values from the analysis. The results also verify the consistency of the algorithm.