• Proceedings of the KSR Conference
• /
• 2010.06a
• /
• pp.933-941
• /
• 2010

KORAIL has improved profitability through abolition of nonprofitable route and withdraw rolling stocks, operated at that route. as a part of that process, most sections of commuters' train are gone. presently, gyeongui-line and gyeongwon-line's commuter's trains are operated. Despite the abolition, there are demands for commuters' train. so, nonprofitable route operation policies are needed to meet the demands and connect seamlessly to KTX. In this study, we consider the overall operation policies and problems of commuters' train in the past. and then, we analyze foreign nonprofitable route, connected with high speed train, operation policies and search for the development suggestions for applying to the nonprofitable route between Iksan - jeonju section at Honam and joenra line.

• Nuclear Engineering and Technology
• /
• v.41 no.1
• /
• pp.113-124
• /
• 2009

The line shape functions for the Doppler-broadened gamma ray spectrum are considered in the $^{10}B(n,{\alpha}{\gamma})^7Li$ reaction occurring in a surrounding medium where the excited $^7Li$ nucleus is slowed down and stopped before decay. The phenomenological form of the stopping power was used for the broadening effect. Convolution with the detailed response of a germanium detector is taken into consideration for the simplest case of solely electronic stopping. A numerical study for the analysis of $^{10}B$ by thermal neutron capture is conducted by performing a parametric search and fitting the measured spectrum in a least-squares approach. In comparison with the previous numerical approach using the same analysis, the computational speed is increased and reliable information concerning the stopping power of the medium is obtained while estimating the uncertainty. Implementation of the routine analysis of $^{10}B$ is facilitated on a recent version of the gamma ray spectrum analysis package HyperGam.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.6
• /
• pp.1166-1191
• /
• 2011

This paper presents an adaptive active tracking system with sector based scanning for a single PTZ camera. Dividing sectors on an image reduces the search space to shorten selection time so that the system can cover many targets. Upon the selection of a target, the system estimates the target trajectory to predict the zooming location with a finite amount of time for camera movement. Advanced estimation techniques using probabilistic reason suffer from the unknown object dynamics and the inaccurate estimation compromises the zooming level to prevent tracking failure. The proposed system uses the simple piecewise estimation with a few frames to cope with fast moving objects and/or slow camera movements. The target is tracked in multiple steps and the zooming time for each step is determined by maximizing the zooming level within the expected variation of object velocity and detection. The number of zooming steps is adaptively determined according to target speed. In addition, the iterative estimation of a zooming location with camera movement time compensates for the target prediction error due to the difference between speeds of a target and a camera. The effectiveness of the proposed method is validated by simulations and real time experiments.

• Journal of Sensor Science and Technology
• /
• v.6 no.2
• /
• pp.123-130
• /
• 1997

In this paper, we present an original stereo vision system which comprises two process: 1. An image segmentation algorithm based on new concept called declivity and using automatic thresholds. 2. A new stereo matching algorithm based on an optimal path search. This path is obtained by dynamic programming method which uses the threshold values calculated during the segmentation process. At present, a complete depth map of indoor scene only needs about 3 s on a Sun workstation IPX, and this time will be reduced to a few tenth of second on a specialised architecture based on several DSPs which is currently under consideration.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.6
• /
• pp.11-17
• /
• 2008

This paper proposes the USN node location recognition method with low power, which is the modified centroid method. The conventional Zigbee node location recognition is used to the three RSSI values from three beacons, respectively. When a person move with node, the moving speed of USN node doesn't fast. Therefore, one among three positions used to the value that it is a previous value. This method doesn't large the error in terms of the exact position. Using hand-off method, we get about 30% power advantage than the conventional centroid method. And Our monitoring system add the function that it is possible to search for the node region by color.

• Management Science and Financial Engineering
• /
• v.12 no.2
• /
• pp.87-110
• /
• 2006

In a hierarchical road network, all roads can be classified according to their attributes such as speed limit, number of lanes, etc. By splitting the whole road network into the subnetworks of the highlevel and low-level roads, we can reduce the size of the network to be calculated at once, and find a path in the way that drivers usually adopt when searching out a travel route. To exploit the hierarchical property of road networks, we define a convenient path and propose an algorithm for finding convenient paths. We introduce a parameter indicating the driver's tolerance to the difference between the length of a convenient path and that of a shortest convenient path. From this parameter, we can determine how far we have to search for the entering and exiting gateway. We also propose some techniques for reducing the number of pairs of entries and exits to be searched in a road network. A result of the computational experiment on a real road network is given to show the efficiency of the proposed algorithm.

• Journal of Korea Multimedia Society
• /
• v.8 no.8
• /
• pp.1134-1141
• /
• 2005

With ever more popularity of video web-publishing, popular content is being compressed, reformatted and modified, resulting in excessive content duplication. Such overlapped data can cause problem of search speed and rate of searching. However, duplicated data on other site can provide alternatives while specific site cause problem. This paper proposes the efficient method, for retrieving. similar video data in large database. In this research we have used the method to compare summarized video image instead of the raw video data, and detected similar videos through clustering in that dimension feature vector through PCA(principle component analysis). We show that our proposed method is efficient and accurate through our experiment.

• Journal of Korea Multimedia Society
• /
• v.8 no.9
• /
• pp.1195-1207
• /
• 2005

In this paper, we describe image matching techniques which is automatically retrieving the exact matching area using geometry-phase information. We proposed a Matching Method which is rapidly estimating the correspondent points between adjacent images that included big-rotation and top-bottom movement element. It is a method that reduce computation quantity to be required to find an exact correspondent position using geometry-phase information of extracted points in images and DT map which set the distance value among feature points and other points on the basis of each feature point of a image. The proposed method shows good performance especially in the part to search a exact correspondent position between adjacent images that included big-rotation and top-bottom movement element.

• Korean Journal of Computational Design and Engineering
• /
• v.10 no.3
• /
• pp.168-178
• /
• 2005

The Delaunay triangular net is primarily characterized by a balance of the whole by improving divided triangular patches into a regular triangle, which closely resembles an equiangular triangle. A triangular net occurring in certain, point-clustered, data is unique and can always create the same triangular net. Due to such unique characteristics, Delaunay triangulation is used in various fields., such as shape reconstruction, solid modeling and volume rendering. There are many algorithms available for Delaunay triangulation but, efficient sequential algorithms are rare. When these grids involve a set of points whose distribution are not well proportioned, the execution speed becomes slower than in a well-proportioned grid. In order to make up for this weakness, the ids are divided into sub-grids when the sets are integrated inside the grid. A method for finding a mate in an incremental construction algorithm is to first search the area with a higher possibility of forming a regular triangular net, while the existing method is to find a set of points inside the grid that includes the circumscribed sphere, increasing the radius of the circumscribed sphere to a certain extent. Therefore, due to its more efficient searching performance, it takes a shorer time to form a triangular net than general incremental algorithms.

• Journal of Korea Multimedia Society
• /
• v.14 no.8
• /
• pp.965-980
• /
• 2011

In this paper, the use of conditional Fuzzy C-Means (CFCM) aimed at estimation of desired states of an unknown digital communication channel is investigated for blind channel equalization. In the proposed CFCM, a collection of clustered centers is treated as a set of pre-defined desired channel states, and used to extract channel output states. By considering the combinations of the extracted channel output states, all possible sets of desired channel states are constructed. The set of desired states characterized by the maximal value of the Bayesian fitness function is subsequently selected for the next fuzzy clustering epoch. This modification of CFCM makes it possible to search for the optimal desired channel states of an unknown channel. Finally, given the desired channel states, the Bayesian equalizer is implemented to reconstruct transmitted symbols. In a series of simulations, binary signals are generated at random with Gaussian noise, and both linear and nonlinear channels are evaluated. The experimental studies demonstrate that the performance (being expressed in terms of accuracy and speed) of the proposed CFCM is superior to the performance of the existing method exploiting the "conventional" Fuzzy C-Means (FCM).