• The Journal of the Acoustical Society of Korea
• /
• v.15 no.5
• /
• pp.107-112
• /
• 1996

In this paper we propose a new fast codebook training algorithm for reducing the searching time of LBG algorithm. For each training data, the proposed algorithm stores the indexes of codewords that are close to that training data in the first iteration. It reduces computation time by searching only those codewords, the indexes of which are stored for each training data. Compared to one of the previous fast training algorithm, FSLBG, it obtains a better codebook with less exccution time. In our experiment, the performance of the codebook generated by the proposed algorithm in terms of peak signal-to-noise ratio(TSNR) is very close to that of LBG algorithm. However, the codewords to be searched for each training data of the proposed algorithm is only about 6%, for a codebook size of 256 and 1.6%, for a codebook size of 1.24, of LBG algorithm.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.32 no.7
• /
• pp.1137-1148
• /
• 2008

The purposes of this study were to investigate the differences in clothing consumption behaviors among female consumer groups in their twenties and to understand the type of consumer group pursuing fast fashion. Questionnaire survey was conducted to 230 female consumers residing in Seoul and Kyung Gi area from June 18 to 29 in 2007, and 178 were used for data analysis. Data analysis were conducted with SPSS 12 program on the reliability test, factor analysis, cluster analysis, correlation analysis, ANOVA, Duncan's multiple range test. Factors analyses were employed for the attitude toward fashion and shopping, and shopping motives. Four factors were formulated for the attitude toward fashion: interest in fashion, fashion-orientation, fashion leadership and fashion conformity. Six factors for the attitude toward shopping were found: information searching, shopping enjoyment, store patronage, impulse buying, brand-orientation and convenience. Buying motives for fashion goods were classified into 3 factors: for matching & occasion, to-be-in-fashion and for necessity. Four clusters were identified based on the attitude toward fashion: the fashion-interested, the fashion-indifferent, fashion leaders and the individuality-oriented. Among the groups, significant differences were found in information searching, shopping enjoyment and store patronage. Fashion leaders tended to spend more for expensive and up-to-dated fashion items, and for higher quantity than other groups. Consequently fashion leaders showed attractive customer characteristics for the fast fashion companies.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.6
• /
• pp.1-9
• /
• 2013

The studies on the shortest path algorithms based on Dijkstra algorithm has been done continuously to decrease the time for searching. $A^*$ algorithm is the most represented one. Although fast searching speed is the major point of $A^*$ algorithm, there are high rates of failing in search of the shortest path, because of complex and irregular networks. The failure of the search means that it either did not find the target node, or found the shortest path, witch is not true. This study proposed $A^*$ algorithm applying method that can reduce searching failure rates, preferentially organizing the relations between the starting node and the targeting node, and appling it in reverse according to the organized path. This proposed method may not build exactly the shortest path, but the entire failure in search of th path would not occur. Following the developed algorithm tested in a real complex networks, it revealed that this algorithm increases the amount of time than the usual $A^*$ algorithm, but the accuracy rates of the shortest paths built is very high.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.5
• /
• pp.36-45
• /
• 2013

This paper developed a new shortest path searching algorithm based on Dijkstra's algorithm and $A^*$ algorithm, so it guarantees to find a shortest path in efficient manner. In this developed algorithm, minimum expected weights implies the value that straight line distance from a visiting node to the target node multiplied by minimum link unit, and this value can be the lowest weights between the two nodes. In behalf of the minimum expected weights, at each traversal step, developed algorithm in this paper is able to decide visiting a new node or retreating to the previously visited node, and results are guaranteed. Newly developed algorithm was tested in a real traffic network and found that the searching time of the algorithm was not as fast as other $A^*$ algorithms, however, it perfectly found a minimum path in any case. Therefore, this developed algorithm will be effective for the domain of searching in a large network such as RGV which operates in wide area.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.4
• /
• pp.52-58
• /
• 2002

This Paper describes the method of real time object tracking using variable searching window. Monitoring systems require real time object tracking in video, efficiencies depend on environment of monitoring target. To get a position of object using a difference between background image and input image, the system extracts contour and centroid of the object. This method track motion of object using variable searching window from size and position of object. The background imgaes and camera are limited as fixed environment. The test result of proposed method Is 17-23FPS, this shows more fast process speed than average(10-14FPS) of existing object tracking method.

• Journal of Korean Society for Geospatial Information Science
• /
• v.7 no.2 s.14
• /
• pp.69-80
• /
• 1999

The purpose of this study is to develop a Bridge Disaster Management System for bridge safety control using Geographic Information Systems(GIS). The constructed database includes several graphic layers such as basemap, road, bridge location, etc. and has related text attributes for 32 bridges and its facilities in Chinju City. Using the language of Visual Basic 5.0, personal computer based Bridge Disaster Management System which has several functions for bridge safety analysis was developed. The developed GIS based Bridge Disaster Management System has the functions of fast and efficient data searching, file management, searching and management of bridge characteristics, bridge related map viewing, searching and management of traffic survey, bridge inspection and repair work results, and evaluating the bridge safety grades, etc..

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.44 no.3
• /
• pp.39-44
• /
• 2007

In this paper, satellite searching and tracking method for the satellite antenna in naval vessels system are proposed. For fast searching satellite, Wide Range Search(WRS) algorithm is proposed where the signal strength of side-lobe is utilized as well as that of main-lobe. Satellite tracking algorithm to stabilize satellite antenna is based on conical-scanning which is accomplished by the use of the sub-reflector located in front of the focus of the reflector. The sub-reflector rotates about a slightly tilted axis by means of a motor and shapes the antenna beam to utilize stabilization. To show the validity of the proposed method, an experimental example is represented.

• Journal of Communications and Networks
• /
• v.18 no.1
• /
• pp.84-94
• /
• 2016

Design of effective cooperative jamming (CJ) algorithm is studied in this paper to maximize the achievable secrecy rate when the total transmit power of the source and multiple trusted terminals is constrained. Recently, the same problem was studied in [1] and an optimal algorithm was proposed involving a one-dimensional exhaustive searching.However, the computational complexity of such exhaustive searching could be very high, which may limit the practical use of the optimal algorithm. We propose an asymptotically optimal algorithm, involving only a fast line searching, which can guarantee to achieve the global optimality when the total transmit power goes to infinity. Numerical results demonstrate that the proposed asymptotically optimal algorithm essentially gives the same performance as the algorithm in [1, (44)] but with much lower computational complexity.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.106.4-106
• /
• 2001

The current research field to find near-optimum solutions explores in a small population, which is coined as Micro-Genetic Algorithms (${\mu}$GAs), with some genetic operators. Just as in the Simple-Genetic Algorithms (SGAs), the ${\mu}$GAs work with encoding population and are implemented serially. The major difference between SGAs and ${\mu}$GAs is how to make reproductive plan for more better searching strategy due to the population choice. This paper is conducted to implement ${\mu}$GAs in order to achieve fast searching for more better evolution and associated cost evaluation in global solution space. To achieve this implementation, the Air-Borne Selection (ABS) for a new reproductive plan is developed as new strategic conception for ${\mu}$GAs. In this paper, it is shown that the ${\mu}$GAs implementation reaches a near-optimal region much earlier than the SGAs implementation. The superior ...

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.1
• /
• pp.25-33
• /
• 1998

This paepr presents an algorithm for searching an object in a fast way which contains a continuous moving object in multi-dimensional spatical databases. This algorithm improves the search method of R-tree for the case that a target object is continuously moving in a spatial database. It starts the searching from the current node instead of the root of R-tree. Thus, the algorithm will find the target object from the entries of current node or sibling nodes in the most cases. The performance analysis shows that it is more efficient than the existing algorithm for R-tree when search windows or target objects are continuously moving.