• Korean Journal of Computational Design and Engineering
• /
• v.4 no.3
• /
• pp.173-179
• /
• 1999

In reverse engineering, when a shape containing multi-patched surfaces is digitized, the boundaries of these surfaces should be detected. The objective of this paper is to introduce a computationally efficient segmentation technique for extracting edges, ad partitioning the 3D measuring point data based on the location of the boundaries. The procedure begins with the identification of the edge points. An automatic edge-based approach is developed on the basis of local geometry. A parametric quadric surface approximation method is used to estimate the local surface curvature properties. the least-square approximation scheme minimizes the sum of the squares of the actual euclidean distance between the neighborhood data points and the parametric quadric surface. The surface curvatures and the principal directions are computed from the locally approximated surfaces. Edge points are identified as the curvature extremes, and zero-crossing, which are found from the estimated surface curvatures. After edge points are identified, edge-neighborhood chain-coding algorithm is used for forming boundary curves. The original point set is then broke down into subsets, which meet along the boundaries, by scan line algorithm. All point data are applied to each boundary loops to partition the points to different regions. Experimental results are presented to verify the developed method.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.811-814
• /
• 1998

REcent research about current testing($\textrm{I}_{DDQ}$ testing) has been emphasizing that $\textrm{I}_{DDQ}$ testing in addition to the logical voltage testing is necessary to increase the fault coverage. The $\textrm{I}_{DDQ}$. testing can detect physical faults other than the classical stuck-at type fault, which affect reliability. One of the most critical issues in the $\textrm{I}_{DDQ}$ testing is to insert a built-in current sensor (BICS) that can detect abnormal static currents from the power supply or to the ground. This paper presents a new BICS for internal current testing for large CMOS logic circuits. The proposed BICS uses a single phase clock to minimize the hardware overhead. It detects faulty current flowing and converts it into a corresponding logic voltage level to make converts it into a corresponding logic voltage level to make it possible to use the conventional voltage testing techniqeus. By using current mirroring technique, the proposed BICS can work at very high speed. Because the proposed BICS almost does not affects normal operation of CUT(circuit under test), it can be used to a very large circuit without circuit partitioning. By altenating the operational modes, a circuit can be $\textrm{I}_{DDQ}$-tested as a kind of self-testing fashion by using the proposed BICS.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1003-1006
• /
• 2002

In the communications systems with diversity, we are commonly faced on needing of new source coding technique, error resilient coding. The error resilient coding addresses the coding algorithm that has the robustness to unreliability of communications channel. In recent years, many error resilient coding techniques were proposed such as data partitioning, resynchronization, error detection, concealment, reference picture selection and multiple description coding (MDC). Especially, the MDC using correlating transform explicitly adds correlation between two descriptions to enable the estimation of one set from the other. However, in the conventional correlating transform method, there is a critical problem that decoder must know statistics of original image. In this paper, we propose an enhanced method, the MDC using whitening transform that is not necessary additional statistical information to decode image because the DCT coefficients to apply whitening transform to an image have uni-variance statistics. Our experimental results show that the proposed method achieves a good trade-off between the coding efficiency and the reconstruction quality. In the proposed method, the PSNR of images reconstructed from two descriptions is about 0.7dB higher than conventional method at the 1.0 BPP and from only one description is about 1,8dB higher at the same rate.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.3 s.174
• /
• pp.593-602
• /
• 2000

The shape optimization is performed to minimize the judder of ventilated disc brake rotor that is induced by the thermal deformation of the disc. A three-dimensional finite element is developed to analyze the coupled system of temperature and displacement field, and the thermal conductivity and mechanical stiffness matrices are simultaneously taken into account. To reduce computing time, an equivalent heat transfer rate is introduced approximating the heat transfer rate on the disc surface. A deformation factor is introduced to describe the thermal deformation causing the judder. The deformation factor is chosen as an objective function in the optimization process. Consequently an optimum design is then performed minimizing the deformation factor with the design variables of the shape of the disc. The optimum design procedure presented in this study is proven to be an effective method of minimizing the judder, and it reduces the thermal deformation by 23% of the initial geometry.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.3239-3267
• /
• 2018

Image and video dehazing is a popular topic in the field of computer vision and digital image processing. A fast, optimized dehazing algorithm was recently proposed that enhances contrast and reduces flickering artifacts in a dehazed video sequence by minimizing a cost function that makes transmission values spatially and temporally coherent. However, its fixed-size block partitioning leads to block effects. The temporal cost function also suffers from the temporal non-coherence of newly appearing objects in a scene. Further, the weak edges in a hazy image are not addressed. Hence, a video dehazing algorithm based on well designed spectral clustering is proposed. To avoid block artifacts, the spectral clustering is customized to segment static scenes to ensure the same target has the same transmission value. Assuming that edge images dehazed with optimized transmission values have richer detail than before restoration, an edge intensity function is added to the spatial consistency cost model. Atmospheric light is estimated using a modified quadtree search. Different temporal transmission models are established for newly appearing objects, static backgrounds, and moving objects. The experimental results demonstrate that the new method provides higher dehazing quality and lower time complexity than the previous technique.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.7
• /
• pp.78-91
• /
• 1998

This paper presents modular design techniques of multiple-valued logic functions about the function decomposition method and input variable management method. The function decomposition method takes avantage of the property of the column multiplicity in a single-column variable partitioning. Due to the increased number of identical modules, we can achieve a simpler circuit design by using a single T-gate, which can eliminate some of the control functions in the module libraty types. The input variable management method is to reduce the complexity of the input variables by proposing the look up table which assign input variables to a code. In this case as the number of sub-functions increase the code-length and the size of the code-assignment table grow. We identify some situations where shard input variables among sub-functions can be further reduced by a simplicication technique. According to the result of adapting this method to a function, we have demonstrated the superiority of the proposed methods which is bing decreased to about 12% of interconnection and about 16% of T-gate numbers compare with th eexisting for th enon-symmetric and irregular function realization.

• The KIPS Transactions:PartD
• /
• v.10D no.1
• /
• pp.117-124
• /
• 2003

The system implemented in this paper partitions and stores specimen data captured by a light microscope on distributed or parallel systems. Users ran observe images on computers as we use a physical microscope. Based on the client-server computing model, the system consists of client, coordinator, and data manager. Three components communicate messages. For retrieving images, we implemented the client program with necessary functions for educational applications such at image mark and text annotation, and defined the communication protocol. We performed the experiment for introducing a tape storage which stores a large volume of data. The experiment results showed performance improvement by data partitioning and indexing technique.

• Communications for Statistical Applications and Methods
• /
• v.19 no.2
• /
• pp.293-301
• /
• 2012

Quantile regression proposed by Koenker and Bassett (1978) is a statistical technique that estimates conditional quantiles. The advantage of using quantile regression is the robustness in response to large outliers compared to ordinary least squares(OLS) regression. A regression tree approach has been applied to OLS problems to fit flexible models. Loh (2002) proposed the GUIDE algorithm that has a negligible selection bias and relatively low computational cost. Quantile regression can be regarded as an analogue of OLS, therefore it can also be applied to GUIDE regression tree method. Chaudhuri and Loh (2002) proposed a nonparametric quantile regression method that blends key features of piecewise polynomial quantile regression and tree-structured regression based on adaptive recursive partitioning. Lee and Lee (2006) investigated wage determinants in the Korean labor market using the Korean Labor and Income Panel Study(KLIPS). Following Lee and Lee, we fit three kinds of quantile regression tree models to KLIPS data with respect to the quantiles, 0.05, 0.2, 0.5, 0.8, and 0.95. Among the three models, multiple linear piecewise quantile regression model forms the shortest tree structure, while the piecewise constant quantile regression model has a deeper tree structure with more terminal nodes in general. Age, gender, marriage status, and education seem to be the determinants of the wage level throughout the quantiles; in addition, education experience appears as the important determinant of the wage level in the highly paid group.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.3
• /
• pp.919-940
• /
• 2012

Video on Demand (VOD) is a multimedia service which allows a remote user to select and then view video at his convenience at any time he wants, which makes the VOD become an important technology for many applications. Numerous periodic VOD broadcasting protocols have been proposed to support a large number of receivers. Broadcasting is an efficient transmission scheme to provide on-demand service for very popular movies. This paper proposes a new broadcasting scheme called Popularity Cushion Staggered Broadcasting (PCSB). The proposed scheme improves the Periodic Broadcasting (PB) protocols in the latest mobile VOD system, which is called MobiVoD system. It also, reduces the maximum waiting time of the mobile node, by partitioning the $1^{st}$ segment of the whole video and storing it in the Local Media Forwarder (LMF) exactly in the Pool of RAM (PoR), and then transmitting them when the mobile nodes miss the $1^{st}$ broadcasted segment. The results show that the PCSB is more efficient and better than the all types of broadcasting and caching techniques in the MobiVoD system. Furthermore, these results exhibits that system performance is stable under high dynamics of the system and the viewer's waiting time are less than the previous system.

• The Korean Journal of Applied Statistics
• /
• v.30 no.4
• /
• pp.555-566
• /
• 2017

For multivariate datasets with large number of variables, classical dimensional reduction methods such as principal component analysis may not be effective for data visualization. The underlying reason is that the dimensionality of the space of variables is often larger than two or three, while the visualization to the human eye is most effective with two or three dimensions. This paper proposes a working procedure which first partitions the variables into several "latent" clusters, explores individual data subsets, and finally integrates findings. We use R pakacage "ClustOfVar" for partitioning variables around latent dimensions and the principal component biplot method to visualize within-cluster patterns. Additionally, we use the technique for embedding supplementary variables to figure out the relationships between within-cluster variables and outside variables.