• Journal of KIISE:Software and Applications
• /
• v.31 no.4
• /
• pp.516-524
• /
• 2004

In this paper, the initial value problem in clustering using K-means or Fuzzy-c-means is considered to reduce the number of iterations. Conventionally the initial values in clustering using K-means or Fuzzy-c-means are chosen randomly, which sometimes brings the results that the process of clustering converges to undesired center points. The choice of intial value has been one of the well-known subjects to be solved. The system of clustering using K-means or Fuzzy-c-means is sensitive to the choice of intial values. As an approach to the problem, the uniform partitioning method is employed to extract the optimal initial point for each clustering of data. Experimental results are presented to demonstrate the superiority of the proposed method, which reduces the number of iterations for the central points of clustering groups.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2359-2368
• /
• 1999

In this paper we propose a 2D FLIR image-based 3D target recognition system which performs group-to-ground vehicle recognition using the target contour and its degree of reliability extracted from FLIR image. First we extract target from background in FLIR image. Then we define contour points of the extracted target which have high edge gradient magnitude and brightness value as reliable contour point and make reliable contour by grouping all reliable contour points. After that we extract corresponding reliable contours from model contour image and perform comparison between scene and model features which are calculated by DST(discrete sine transform) of reliable contours. Experiment shows that the proposed algorithm work well and even in case of imperfect target extraction it showed better performance then conventional 2D contour-based matching algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7B
• /
• pp.647-659
• /
• 2003

LPM(Longest Prefix Matching)searching in If address lookup is a major bottleneck of IP packet processing in the high speed router. In the conventional lookup table for the LPM searching in CAM(Content Addressable Memory) the complexity of fast update take 0(1). In this paper, we designed pipeline architecture for fast update of 0(1) cycle of lookup table and high throughput and low area complexity on LPM searching. Lookup-table architecture was designed by CAM(Content Addressable Memory)away that uses 1bit RAM(Random Access Memory)cell. It has three pipeline stages. Its LPM searching rate is affected by both the number of key field blocks in stage 1 and stage 2, and distribution of matching Point. The RTL(Register Transistor Level) design is carried out using Verilog-HDL. The functional verification is thoroughly done at the gate level using 0.35${\mu}{\textrm}{m}$ CMOS SEC standard cell library.

• The KIPS Transactions:PartB
• /
• v.11B no.2
• /
• pp.149-158
• /
• 2004

This study proposes a method for segmentation and recognition of traffic signs using shape information and edge image in real image. It first segments traffic sign candidate regions by connected component algorithm from binary images, obtained by utilizing the RGB color ratio of each pixel in the image, and then extracts actual traffic signs based on their symmetries on X- and Y-axes. Histogram equalization is performed for unsegmented candidate regions caused by low contrast in the image. In the recognition stage, it utilizes shape information including projection profiles on X- and Y-axes, moment, and the number of crossings and distance which concentric circular patterns and 8-directional rays from region center intersects with edges of traffic signs. It finally performs recognition by measuring similarity with the templates in the database. It will be shown from several experimental results that the system is robust to environmental factors, such as light and weather condition.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.56-68
• /
• 2006

For tracing tag locations, the trajectories should be modeled and indexed in radio frequency identification (RFID) systems. The trajectory of a tag can be represented as a line that connects two spatiotemporal locations captured when the tag enters and leaves the vicinity of a reader. If a tag enters but does not leave a reader, its trajectory is represented only as a point captured at entry. Because the information that a tag stays in a reader is missing from the trajectory represented only as a point, it is impossible to find the tag that remains in a reader. To solve this problem we propose the data model in which trajectories are defined as time-parameterized intervals and new index scheme called the Time Parameterized Interval R-tree. We also propose new insert and split algorithms that reduce the area of nodes to enable efficient query processing. We evaluate the performance of the proposed index scheme and compare it with previous indexes on various datasets.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.8
• /
• pp.1505-1510
• /
• 2008

In large-scale wireless sensor networks, the deployed nodes cannot be replaced or recharged after first deployment. Also, dead nodes maγ lead to the partition of whole networks. While performing data dissemination under a battery power constraint, energy efficiency is a key design factor of routing protocol. As a solution for the efficient data dissemination, in this paper, we propose a protocol namely Hierarchical Data Dissemination (HDD) which provides scalable and efficient data delivery to multiple sources and mobile sinks. HDD uses the facts that sink nodes are central gathering Points and source-centric data forwarding paths are constructed and it is maintained with two-tier communications. The performance of HDD is compared with TTDD about the energy consumption, data delivery time and data success ration. The extensive simulation results show that HDD Routing Protocol outperforms TIDD by more than $1.5{\sim}3times$ on energy consumption.

• Korean Journal of Remote Sensing
• /
• v.26 no.1
• /
• pp.9-20
• /
• 2010

The LIDAR data can be efficiently utilized for automatic reconstruction of 3D models of objects on the terrain and the terrain itself. In this paper, we attempted to generate simulated waveforms of FW (Full-Waveform) LIDAR (LIght Detection And Ranging). We performed the geometric modeling of the sensor and objects, and the radiometric modeling of the waveform intensity. First, we compute the origins and directions of the sub-beams by considering the divergence effects of a laser beam. We then searched for the locations at which the sub-beams intersected with the objects, such as ground, buildings and trees. Finally, we generate the individual waveforms of the reflected sub-beams and the waveform of the entire beam by summing the individual ones. With the experimental results, we confirmed the waveforms were reasonably generated, showing the characteristics of the surfaces the beam interacted with.

• Journal of the Korean Society of Hazard Mitigation
• /
• v.11 no.3
• /
• pp.157-163
• /
• 2011

In this study, after the target basin was divided into both overland and channel grids, the travel time from center of each grid cell to watershed's outlet was calculated based on the manning equation. Through this process, volumetric discharge was calculated according to the isochrones and finally, the direct runoff hydrograph was estimated considering watershed's hydrodynamic characteristics. Sanseong subwatershed located in main stream of Bocheong basin was selected as a target basin. The model parameters are only two: area threshold and channel velocity correction factor; the optimized values were estimated at 3,800 and 3.3, respectively. The developed model based on the tuned parameters led to well-matching results between observed and calculated hydrographs (mean of absolute error of peak discharge: 3.41%, mean of absolute error of peak time: 0.67 hr). Moreover, the analysis results regarding histogram of travel time-contribution area demonstrates that the proposed model characterizes relatively well hydrodynamic characteristics of the catchment due to effective rainfall.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.15 no.4
• /
• pp.40-50
• /
• 2019

In recent years, it is important to visualize an accurate human body model for the low-end system in the medical imaging field where augmented reality technology and virtual reality technology are used. Decreasing the geometry of a model causes a difference from the original shape and considers the difference as an error. So, the error should be minimized while reducing geometry. In this study, the organ areas of a human body in the tomographic images such as CT or MRI is segmented and 3D geometric model is generated, thereby implementing the reconstruction method of multiple resolution level-of-detail model. In the experiment, a virtual reality platform was constructed to verify the shape of the reconstructed model, targeting the spine area. The 3D human body model and patient information can be verified using the virtual reality platform.

• Cross-Cultural Studies
• /
• v.46
• /
• pp.63-84
• /
• 2017

This paper analyzes Gloria Anzaldua's borderland proposal through her work Borderlands/La Frontera (1987). One of the strong trends of US geographical imagination started from the concept of 'city upon a hill'. It left an important footprint in the American history. In the area of international political history, it was the starting point of the isolationism policy. But, this imagination is contradictory because it has exercised the bordering power that demarcates the border and overpasses it as needed. Anzaldua's geographic proposal consists of transformation of the border into the borderlands. This is a challenge to the bordering power and a challenge to the geographical imagination that has led to isolationism, and ultimately a history war. This is not only a nationalist war aimed at the Chicano's restoration but also a war that can measure the American society's possibility of change in the future.