• Journal of Information Technology Services
• /
• v.12 no.4
• /
• pp.165-174
• /
• 2013

Log scaling which decides a quality grade of log is influence the price of log at the market. It is the one of important works at the field until now. So it remains using a ruler traditionally. This study evaluated the automating program through compared the automating program with using a ruler for log. The automating program used libraries of OpenCV concerning image processing algorithm to measure log diameter for scaling. In addition, it applies two panels of checkered pattern beside a pile of logs and tapes on the surface of a log diameter to find a correct value. We analyzed statistical mean difference of both log diameter and volume. In conclusion, the automating program after applying check panel and taping ins't different using a ruler. Therefore we need to considerate about applying it for improving Forest Administration.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.15-18
• /
• 2000

In this study, we improve the performance of a speech recognition system of visual information depending on lip movements. This paper focuses on the robustness of the word recognition system with the rotation, transition and scaling of the lip images. The different methods of lipreading have been used to estimate the stability of recognition performance. Especially, we work out the special system of the log-polar mapping, which is called Mellin transform with quasi RTS-invariant and related approaches to machine vision. The results of word recognition are reported with HMM (Hidden Markov Model) recognition system.

• Explosives and Blasting
• /
• v.9 no.1
• /
• pp.3-13
• /
• 1991

The cautious blasting works had been used with emulsion explosion electric M/S delay caps. Drill depth was from 3m to 6m with Crawler Drill ${\phi}70mm$ on the calcalious sand stone (soft -modelate -semi hard Rock). The total numbers of test blast were 88. Scale distance were induced 15.52-60.32. It was applied to propagation Law in blasting vibration as follows. Propagtion Law in Blasting Vibration $V=K(\frac{D}{W^b})^n$ were V : Peak partical velocity(cm/sec) D : Distance between explosion and recording sites(m) W : Maximum charge per delay-period of eight milliseconds or more (kg) K : Ground transmission constant, empirically determind on the Rocks, Explosive and drilling pattern ets. b : Charge exponents n : Reduced exponents where the quantity $\frac{D}{W^b}$ is known as the scale distance. Above equation is worked by the U.S Bureau of Mines to determine peak particle velocity. The propagation Law can be catagorized in three groups. Cubic root Scaling charge per delay Square root Scaling of charge per delay Site-specific Scaling of charge Per delay Plots of peak particle velocity versus distoance were made on log-log coordinates. The data are grouped by test and P.P.V. The linear grouping of the data permits their representation by an equation of the form ; $V=K(\frac{D}{W^{\frac{1}{3}})^{-n}$ The value of K(41 or 124) and n(1.41 or 1.66) were determined for each set of data by the method of least squores. Statistical tests showed that a common slope, n, could be used for all data of a given components. Charge and reduction exponents carried out by multiple regressional analysis. It's divided into under loom over loom distance because the frequency is verified by the distance from blast site. Empirical equation of cautious blasting vibration is as follows. Over 30m ------- under l00m ${\cdots\cdots\cdots}{\;}41(D/sqrt[2]{W})^{-1.41}{\;}{\cdots\cdots\cdots\cdots\cdots}{\;}A$ Over 100m ${\cdots\cdots\cdots\cdots\cdots}{\;}121(D/sqrt[3]{W})^{-1.66}{\;}{\cdots\cdots\cdots\cdots\cdots}{\;}B$ where ; V is peak particle velocity In cm / sec D is distance in m and W, maximLlm charge weight per day in kg K value on the above equation has to be more specified for further understaring about the effect of explosives, Rock strength. And Drilling pattern on the vibration levels, it is necessary to carry out more tests.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.4
• /
• pp.616-623
• /
• 2002

The fractal expanded antenna with the configuration of a triangular microstrip patch antenna is presented and analyzed. In the fundamental and higher mode of TFA(Triangular Fractal Antenna), resonant frequencies are controlled by changing the scaling factor. It is observed that increasing scaling factor makes the resonant frequency be spread, and decreasing scaling factor makes it be concentrated. The scaling factor is varied as the expansion and concentration of resonant frequencies. The resonant frequency in each fractal patch element is observed log -periodically. The TFA can be applied to the multiband system.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1140-1145
• /
• 2003

Image normalization is one of the important areas in pattern recognition. Also, log-polar images are useful in the sense that their image data size is reduced dramatically comparing with conventional images and it is possible to develop faster pattern recognition algorithms. Especially, the log-polar image is very similar with the structure of human eyes. However, there are almost no researches on pattern recognition using the log-polar images while a number of researches on visual tracking have been executed. We propose an image normalization technique of log-polar images using momentums applicable for affine-invariant pattern recognition. We handle basic distortions of an image including translation, rotation, scaling, and skew of a log-polar image. The algorithm is experimented in a PC-based real-time vision system successfully.

• Journal of the Korea Institute of Building Construction
• /
• v.22 no.3
• /
• pp.317-326
• /
• 2022

With the development of various technologies in the area of artificial intelligence, a number of studies to application of artificial intelligence technology in the construction field are underway. Diverse technologies have been applied to the task of predicting construction costs, and construction cost prediction technologies applying artificial intelligence technologies have recently been developed. However, it is difficult to secure the vast amount of construction cost data required for machine learning, which has not yet been practically used. In this study, to predict the construction cost, the latest artificial neural network(ANN) method is used to propose a method to improve the construction cost prediction performance. In particular, to improve predictive performance, a log conversion method of target variables and a feature scaling method to eliminate the difference in the relative influence of each column data are applied, and their performance in predicting construction cost is compared and analyzed.

• Journal of the Korean Society of Visualization
• /
• v.18 no.3
• /
• pp.109-115
• /
• 2020

Five layers in mean flow are proposed by using the direct numerical simulation data of turbulent pipe flow up to Reτ = 3008. Viscous sublayer, buffer layer, mesolayer, log layer and core region are investigated. In the buffer layer, the viscous force is counterbalanced by the turbulent inertia from the streamwise mean momentum balance, and a log law occurs here. The overlap layer is composed of the mesolayer and the log layer. Above the buffer layer, the non-negligible viscous force causes the power law, and this region is the mesolayer, where it is the lower part of the overlap layer. At the upper part of the overlap layer, where the viscous force itself becomes naturally negligible, the log layer will appear due to that the acceleration force of the large-scale motions increases as the Reynolds number increases. In the core region, the velocity-defect form is satisfied with the power-law scaling.

• Journal of Communications and Networks
• /
• v.16 no.2
• /
• pp.227-237
• /
• 2014

Throughput scaling laws for two coexisting ad hoc networks with m primary users (PUs) and n secondary users (SUs) randomly distributed in an unit area have been widely studied. Early work showed that the secondary network performs as well as stand-alone networks, namely, the per-node throughput of the secondary networks is ${\Theta}(1/\sqrt{n{\log}n})$. In this paper, we show that by exploiting directional spectrum opportunities in secondary network, the throughput of secondary network can be improved. If the beamwidth of secondary transmitter (TX)'s main lobe is ${\delta}=o(1/{\log}n)$, SUs can achieve a per-node throughput of ${\Theta}(1/\sqrt{n{\log}n})$ for directional transmission and omni reception (DTOR), which is ${\Theta}({\log}n)$ times higher than the throughput with-out directional transmission. On the contrary, if ${\delta}={\omega}(1/{\log}n)$, the throughput gain of SUs is $2{\pi}/{\delta}$ for DTOR compared with the throughput without directional antennas. Similarly, we have derived the throughput for other cases of directional transmission. The connectivity is another critical metric to evaluate the performance of random ad hoc networks. The relation between the number of SUs n and the number of PUs m is assumed to be $n=m^{\beta}$. We show that with the HDP-VDP routing scheme, which is widely employed in the analysis of throughput scaling laws of ad hoc networks, the connectivity of a single SU can be guaranteed when ${\beta}$ > 1, and the connectivity of a single secondary path can be guaranteed when ${\beta}$ > 2. While circumventing routing can improve the connectivity of cognitive radio ad hoc network, we verify that the connectivity of a single SU as well as a single secondary path can be guaranteed when ${\beta}$ > 1. Thus, to achieve the connectivity of secondary networks, the density of SUs should be (asymptotically) bigger than that of PUs.

• ETRI Journal
• /
• v.36 no.4
• /
• pp.591-598
• /
• 2014

This paper proposes a new min-sum algorithm for low-density parity-check decoding. In this paper, we first define the negative and positive effects of the received signal-to-noise ratio (SNR) in the min-sum decoding algorithm. To improve the performance of error correction by considering the negative and positive effects of the received SNR, the proposed algorithm applies adaptive scaling factors not only to extrinsic information but also to a received log-likelihood ratio. We also propose a combined variable and check node architecture to realize the proposed algorithm with low complexity. The simulation results show that the proposed algorithm achieves up to 0.4 dB coding gain with low complexity compared to existing min-sum-based algorithms.

• Journal of Information Processing Systems
• /
• v.7 no.1
• /
• pp.85-92
• /
• 2011

This paper shows an effective partitioning of static global row/column buses for tightly coupled 2D mesh-connected small processor arrays ("mesh", for short). With additional O(n/m (n/m + log m)) time slowdown, it enables the mesh of size $m{\times}m$ with static row/column buses to simulate the mesh of the larger size $n{\times}n$ with reconfigurable row/column buses ($m{\leq}n$). This means that if a problem can be solved in O(T) time by the mesh of size $n{\times}n$ with reconfigurable buses, then the same problem can be solved in O(Tn/m (n/m + log m)) time on the mesh of a smaller size $m{\times}m$ without a reconfigurable function. This time-cost is optimal when the relation $n{\geq}m$ log m holds (e.g., m = $n^{1-\varepsilon}$ for $\varepsilon$ > 0).