• Asian-Australasian Journal of Animal Sciences
• /
• v.31 no.12
• /
• pp.1852-1862
• /
• 2018

Objective: The purpose of this study was to investigate a single step genome-wide association study (ssGWAS) for identifying genomic regions affecting reproductive traits in Landrace and Large White pigs. Methods: The traits included the number of pigs weaned per sow per year (PWSY), the number of litters per sow per year (LSY), pigs weaned per litters (PWL), born alive per litters (BAL), non-productive day (NPD) and wean to conception interval per litters (W2CL). A total of 321 animals (140 Landrace and 181 Large White pigs) were genotyped with the Illumina Porcine SNP 60k BeadChip, containing 61,177 single nucleotide polymorphisms (SNPs), while multiple traits single-step genomic BLUP method was used to calculate variances of 5 SNP windows for 11,048 Landrace and 13,985 Large White data records. Results: The outcome of ssGWAS on the reproductive traits identified twenty-five and twenty-two SNPs associated with reproductive traits in Landrace and Large White, respectively. Three known genes were identified to be candidate genes in Landrace pigs including retinol binding protein 7, and ubiquitination factor E4B genes for PWL, BAL, W2CL, and PWSY and one gene, solute carrier organic anion transporter family member 6A1, for LSY and NPD. Meanwhile, five genes were identified to be candidate genes in Large White, two of which, aldehyde dehydrogenase 1 family member A3 and leucine rich repeat kinase 1, associated with all of six reproduction traits and three genes; retrotransposon Gag like 4, transient receptor potential cation channel subfamily C member 5, and LHFPL tetraspan subfamily member 1 for five traits except W2CL. Conclusion: The genomic regions identified in this study provided a start-up point for marker assisted selection and estimating genomic breeding values for improving reproductive traits in commercial pig populations.

• Journal of the Institute of Convergence Signal Processing
• /
• v.21 no.2
• /
• pp.55-60
• /
• 2020

In this paper, we propose a fast block matching algorithm of motion estimation using early detection of optimal candidate with high priority and a threshold. Even though so many fast algorithms for motion estimation have been published to reduce computational reduction full search algorithm, still so many works to improve performance of motion estimation are being reported. The proposed algorithm calculates block matching error for each candidate with high priority from previous partial matching error. The proposed algorithm can be applied additionally to most of conventional fast block matching algorithms for more speed up. By doing that, we can find the minimum error point early and get speed up by reducing unnecessary computations of impossible candidates. The proposed algorithm uses smaller computation than conventional fast full search algorithms with the same prediction quality as the full search algorithm. Experimental results shows that the proposed algorithm reduces 30~70% compared with the computation of the PDE and full search algorithms without any degradation of prediction quality and further reduces it with other fast lossy algorithms.

• The Journal of the Acoustical Society of Korea
• /
• v.17 no.2E
• /
• pp.38-46
• /
• 1998

In this paper, we propose a remote speech input device, a new method of user-friendly speech input in spontaneous speech recognition system. We focus the user friendliness on hands-free and microphone independence in speech recognition applications. Our method adopts two algorithms, the automatic speech detection and the microphone array delay-and-sum beamforming (DSBF)-based speech enhancement. The automatic speech detection algorithm is composed of two stages; the detection of speech and nonspeech using the pitch information for the detected speech portion candidate. The DSBF algorithm adopts the time domain cross-correlation method as its time delay estimation. In the performance evaluation, the speech detection algorithm shows within-200 ms start point accuracy of 93%, 99% under 15dB, 20dB, and 25dB signal-to-noise ratio (SNR) environments, respectively and those for the end point are 72%, 89%, and 93% for the corresponding environments, respectively. The classification of speech and nonspeech for the start point detected region of input signal is performed by the pitch information-base method. The percentages of correct classification for speech and nonspeech input are 99% and 90%, respectively. The eight microphone array-based speech enhancement using the DSBF algorithm shows the maximum SNR gaing of 6dB over a single microphone and the error reductin of more than 15% in the spontaneous speech recognition domain.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.2
• /
• pp.820-829
• /
• 2017

Vegetable oil dielectrics have been used in transformers as green alternatives to mineral insulating oils for about twenty years, because of their advantages of non-toxic, biodegradability, and renewability. However, the viscosity of vegetable oils is more than 3 times of mineral oils, which means a poor heat dissipation capacity. To get low-viscosity dielectrics, transesterification and purification were performed to prepare vegetable oil methyl esters in this study. Electrical and physical properties were determined to investigate their potential as dielectrics. The results showed that the methyl ester products had good dielectric strengths, high water saturation and enough fire resistance. The viscosities (at $40^{\circ}C$) were 0.2 times less than FR3 fluid, and 0.7 times less than mineral oil, which indicated superior cooling capacity as we expected. With the assistance of 0.5 wt% pour point depressants, canola oil methyl ester exhibited the lowest pour point ($-26^{\circ}C$) among the products which was lower than FR3 fluid ($-21^{\circ}C$) and 25# mineral oil ($-23^{\circ}C$). Thus, canola oil methyl ester was the best candidate as a low-viscosity vegetable oil-based dielectric. The low-viscosity fluid could extend the service life of transformers by its better cooling capacity compared with nature ester dielectrics.

• The Journal of Korea Robotics Society
• /
• v.10 no.1
• /
• pp.33-41
• /
• 2015

Recent developments in robotics and intelligent vehicle area, bring interests of people in an autonomous driving ability and advanced driving assistance system. Especially fully automatic parking ability is one of the key issues of intelligent vehicles, and accurate parked vehicles detection is essential for this issue. In previous researches, many types of sensors are used for detecting vehicles, 2D LiDAR is popular since it offers accurate range information without preprocessing. The L shape feature is most popular 2D feature for vehicle detection, however it has an ambiguity on different objects such as building, bushes and this occurs misdetection problem. Therefore we propose the accurate vehicle detection method by using a 3D complete vehicle model in 3D point clouds acquired from front inclined 2D LiDAR. The proposed method is decomposed into two steps: vehicle candidate extraction, vehicle detection. By combination of L shape feature and point clouds segmentation, we extract the objects which are highly related to vehicles and apply 3D model to detect vehicles accurately. The method guarantees high detection performance and gives plentiful information for autonomous parking. To evaluate the method, we use various parking situation in complex urban scene data. Experimental results shows the qualitative and quantitative performance efficiently.

• Journal of the Korea Computer Industry Society
• /
• v.9 no.4
• /
• pp.149-156
• /
• 2008

There is the temporal correlation of a animation sequence between the motion vector of current block and the motion vector of previous block. In this paper, we propose the scene change detection algorithm for block matching using the temporal correlation of the animation sequence and the center-biased property of motion vectors. The proposed algorithm determines the location of a better starting point for the search of an exact motion vector using the point of the smallest SAD(sum of absolute difference) value by the predicted motion vector from the same block of the previous frame and the predictor candidate point on each search region. Simulation results show that the proposed algorithm has better detection performance, such as recall rate, then the existing method. The algorithm has the advantage of speed, simplicity and accuracy. In addition, it requires less amount of storage.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.22 no.4
• /
• pp.369-372
• /
• 2017

This paper presents a control scheme for three-level NPC inverters using small DC-link capacitors. To reduce the inverter system volume, the film capacitor with small capacitance is a promising candidate for the DC-link. When small capacitors are applied in a three level inverter, however, the AC ripple component increases in the DC-link NPV (neutral point voltage). In addition, the three-phase input grid currents are distorted when the DC-link capacitors are fed by diode rectifier. In this paper, the additional circuit is applied to compensate for small capacitor systems defect, and the offset voltage injection method is presented for the stabilization in NPV. These two proposed processes evidently ensure the quality improvement of the input grid currents and output load currents. The feasibility of the proposed method is verified by experimental results.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.1
• /
• pp.127-136
• /
• 2009

This paper proposes an on-line mining algorithm of moving trajectory patterns in RFID data streams considering changing characteristics over time and constraints of single-pass data scan. Since RFID, sensor, and mobile network technology have been rapidly developed, many researchers have been recently focused on the study of real-time data gathering from real-world and mining the useful patterns from them. Previous researches for sequential patterns or moving trajectory patterns based on stream data have an extremely time-consum ing problem because of multi-pass database scan and tree traversal, and they also did not consider the time-changing characteristics of stream data. The proposed method preserves the sequential strength of 2-lengths frequent patterns in binary relationship table using the time-evolving graph to exactly reflect changes of RFID data stream from time to time. In addition, in order to solve the problem of the repetitive data scans, the proposed algorithm infers candidate k-lengths moving trajectory patterns beforehand at a time point t, and then extracts the patterns after screening the candidate patterns by only one-pass at a time point t+1. Through the experiment, the proposed method shows the superior performance in respect of time and space complexity than the Apriori-like method according as the reduction ratio of candidate sets is about 7 percent.

• Journal of the Optical Society of Korea
• /
• v.18 no.4
• /
• pp.317-329
• /
• 2014

In vision measurement systems based on structured light, the key point of detection precision is to determine accurately the central position of the projected laser line in the image. The purpose of this research is to extract laser line centers based on a decision function generated to distinguish the real centers from candidate points with a high recognition rate. First, preprocessing of an image adopting a difference image method is conducted to realize image segmentation of the laser line. Second, the feature points in an integral pixel level are selected as the initiating light line centers by the eigenvalues of the Hessian matrix. Third, according to the light intensity distribution of a laser line obeying a Gaussian distribution in transverse section and a constant distribution in longitudinal section, a normalized model of Hessian matrix eigenvalues for the candidate centers of the laser line is presented to balance reasonably the two eigenvalues that indicate the variation tendencies of the second-order partial derivatives of the Gaussian function and constant function, respectively. The proposed model integrates a Gaussian recognition function and a sinusoidal recognition function. The Gaussian recognition function estimates the characteristic that one eigenvalue approaches zero, and enhances the sensitivity of the decision function to that characteristic, which corresponds to the longitudinal direction of the laser line. The sinusoidal recognition function evaluates the feature that the other eigenvalue is negative with a large absolute value, making the decision function more sensitive to that feature, which is related to the transverse direction of the laser line. In the proposed model the decision function is weighted for higher values to the real centers synthetically, considering the properties in the longitudinal and transverse directions of the laser line. Moreover, this method provides a decision value from 0 to 1 for arbitrary candidate centers, which yields a normalized measure for different laser lines in different images. The normalized results of pixels close to 1 are determined to be the real centers by progressive scanning of the image columns. Finally, the zero point of a second-order Taylor expansion in the eigenvector's direction is employed to refine further the extraction results of the central points at the subpixel level. The experimental results show that the method based on this normalization model accurately extracts the coordinates of laser line centers and obtains a higher recognition rate in two group experiments.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.11 no.6
• /
• pp.361-367
• /
• 2016

In this paper, we propose an improved single view metrology (SVM) algorithm to accurately measure the height of objects. In order to accurately measure the size of objects, vanishing points have to be correctly estimated. There are two methods to estimate vanishing points. First, the user has to choose some horizontal and vertical lines in real world. Then, the user finds the cross points of the lines. Second, the user can obtain the vanishing points by using software algorithm such as [6-9]. In the former method, the user has to choose the lines manually to obtain accurate vanishing points. On the other hand, the latter method uses software algorithm to automatically obtain vanishing points. In this paper, we apply image resizing and edge sharpening as a pre-processing to the algorithm in order to improve performance. The estimated vanishing points algorithm create four vanishing point candidates: two points are horizontal candidates and the other two points are vertical candidates. However, a common image has two horizontal vanishing points and one vertical vanishing point. Thus, we eliminate a vertical vanishing point candidate by analyzing the histogram of angle distribution of vanishing point candidates. Experimental results show that the proposed algorithm outperforms conventional methods, [6] and [7]. In addition, the algorithm obtains similar performance with manual method with less than 5% of the measurement error.