• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.5
• /
• pp.312-321
• /
• 2003

In this paper, we implement robot which are ability to recognize obstacles and moving automatically to destination. we present two results in this paper; hardware implementation of image processing board and software implementation of visual feedback algorithm for a self-controlled robot. In the first part, the mobile robot depends on commands from a control board which is doing image processing part. We have studied the self controlled mobile robot system equipped with a CCD camera for a long time. This robot system consists of a image processing board implemented with DSPs, a stepping motor, a CCD camera. We will propose an algorithm in which commands are delivered for the robot to move in the planned path. The distance that the robot is supposed to move is calculated on the basis of the absolute coordinate and the coordinate of the target spot. And the image signal acquired by the CCD camera mounted on the robot is captured at every sampling time in order for the robot to automatically avoid the obstacle and finally to reach the destination. The image processing board consists of DSP (TMS320VC33), ADV611, SAA7111, ADV7l76A, CPLD(EPM7256ATC144), and SRAM memories. In the second part, the visual feedback control has two types of vision algorithms: obstacle avoidance and path planning. The first algorithm is cell, part of the image divided by blob analysis. We will do image preprocessing to improve the input image. This image preprocessing consists of filtering, edge detection, NOR converting, and threshold-ing. This major image processing includes labeling, segmentation, and pixel density calculation. In the second algorithm, after an image frame went through preprocessing (edge detection, converting, thresholding), the histogram is measured vertically (the y-axis direction). Then, the binary histogram of the image shows waveforms with only black and white variations. Here we use the fact that since obstacles appear as sectional diagrams as if they were walls, there is no variation in the histogram. The intensities of the line histogram are measured as vertically at intervals of 20 pixels. So, we can find uniform and nonuniform regions of the waveforms and define the period of uniform waveforms as an obstacle region. We can see that the algorithm is very useful for the robot to move avoiding obstacles.

• Journal of Broadcast Engineering
• /
• v.19 no.4
• /
• pp.521-532
• /
• 2014

ATSC-M/H based hybrid 3DTV, which is one of the service compatible 3DTV system, has considerable quality gap between the left and right views. And CRA(Conditional Replenishment Algorithm) has been proposed to deal with the issue of resolution mismatch and improve the visual quality. In CRA, the disparity vectors of stereoscopic images are estimated. The disparity compensated left view and simply enlarged right view are compared and conditionally selected for generating the enhanced right view. In order to implement CRA, a fast algorithm is strongly required because the disparity vectors need to be obtained at every layer and the complexity of CRA is quite high. In this paper, we adopted SDSP(Small Diamond Search Pattern) instead of full search and predicted the initial position of search pattern by examining the spatio-temporal correlation of disparity vectors and also suggested the SKIP mode to limit the number of processing units. The computer simulation showed that the proposed fast algorithm could greatly reduce the processing time while minimizing the quality degradation of reconstructed right view.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.1
• /
• pp.49-55
• /
• 2007

To improved the multi-resolution fast hierarchical motion estimation by using de-interlacing algorithm that is effective in term of both performance and VLSI implementation, is proposed so as to cover large search area field-based as well as frame based image processing in SoC design. In this paper, we have simulated a various picture mode M=2 or M=3. As a results, the proposed algorithm achieved the motion estimation performance PSNR compare with the full search block matching algorithm, the average performance degradation reached to -0.7dB, which did not affect on the subjective quality of reconstructed images at all. And acquiring the more desirable to adopt design SoC for the fast hierarchical motion estimation, we exploit foreground and background search algorithm (FBSA) base on the dual arithmetic processor element(DAPE). It is possible to estimate the large search area motion displacement using a half of number PE in general operation methods. And the proposed architecture of MHME improve the VLSI design hardware through the proposed FBSA structure with DAPE to remove the local memory. The proposed FBSA which use bit array processing in search area can improve structure as like multiple processor array unit(MPAU).

• Geophysics and Geophysical Exploration
• /
• v.12 no.3
• /
• pp.255-262
• /
• 2009

Conventionally, vertical-seismic-profiling (VSP) survey that provides high-resolution information has mainly performed to obtain the exact depth of the gas hydrate-bearing sediment, which is one of the key factors in the development of the gas hydrate. In this study, we extracted interval velocities and created corridor stacks from the first domestic zero-offset VSP data, which were acquired with three component receivers at UBGH09 borehole in Ulleung Basin where gas hydrate exists. Then we compared the corridor stacks with a CMP stacked section from surface seismic data. First of all, we converted the signals recorded with three component receivers to true vertical and horizontal components by phase rotation, and divided the data into direct waves and reflected waves by wavefield separation processing. The trend of the interval velocity extracted from the zero-offset VSP was similar to that of the sonic log obtained at the same borehole. Because the interval velocity of the gas hydrate-bearing sediment above the BSR was high, and it decreased suddenly through the BSR, we could infer that free gas is accumulated below the BSR. The results of comparing the corridor stacks to the CMP stacked section of the surface seismic data showed that most reflection events agreed well with those in the surface CMP stacked section and that the phase-rotated VSP data corresponded better with the surface seismic data than the VSP data without phase rotation. In addition, by comparing a corridor stack produced from the transverse component with the CMP stacked section of the surface seismic data, we could identify PS mode-converted reflections in the CMP stacked section.

• The KIPS Transactions:PartB
• /
• v.12B no.4 s.100
• /
• pp.487-498
• /
• 2005

Recently, It has focused on decision tree algorithm that can handle large dataset. However, because most of these algorithms for large datasets process data in a batch mode, if new data is added, they have to rebuild the tree from scratch. h more efficient approach to reducing the cost problem of rebuilding is an approach that builds a tree incrementally. Representative algorithms for incremental tree construction methods are BOAT and ITI and most of these algorithms use a local discretization method to handle the numeric data type. However, because a discretization requires sorted numeric data in situation of processing large data sets, a global discretization method that sorts all data only once is more suitable than a local discretization method that sorts in every node. This paper proposes an incremental tree construction method that efficiently rebuilds a tree using a global discretization method to handle the numeric data type. When new data is added, new categories influenced by the data should be recreated, and then the tree structure should be changed in accordance with category changes. This paper proposes a method that extracts sample points and performs discretiration from these sample points to recreate categories efficiently and uses confidence intervals and a tree restructuring method to adjust tree structure to category changes. In this study, an experiment using people database was made to compare the proposed method with the existing one that uses a local discretization.

• The KIPS Transactions:PartD
• /
• v.11D no.4
• /
• pp.783-798
• /
• 2004

An e-business client application in ubiquitous mobile computing environment may become disconnected from the enterprise server due to broken communication connections caused by the limitation of mobile computing environments(limited battery life of the mobile device, low bandwidth communication, incomplete wireless communication infrastructure, etc). It Is even Possible that mobile client application Intentionally operates in disconnected mode to reduce communication cost and the power consumption of the mobile device. We use “data hoarding” as a means of providing local autonomy to allow transactions to be processed and committed on the mobile host despite of disconnection. The key problem to this approach is the synchronization problem that serialize potentially conflicting updates from disconnected clients on master objects of the server database. In this paper, we present a new transaction synchronizing method that splits a transaction into a set of independent component transactions and give the synchronization priority on each component taking the possibility of use and conflicts in the server into consideration. Synchronization is performed component by component based un synchronization priority. After the Preferred component of a no bile transaction succeeds in synchronization with the server, the mobile transaction can pre-commit at server. A pre-committed transaction's updated value is made visible at server before the final commit of the transaction. The synchronization of the component with low synchronization priority can be delayed in adaption to wireless bandwidth and computing resources. As a result, the availability of important data updated by mobile client is increased and it can maximize the utilization of the limited wireless bandwidth and computing resources.

• Management & Information Systems Review
• /
• v.28 no.3
• /
• pp.99-115
• /
• 2009

This research analyzed determining factors of expenditure for processing fee by targeting trade show participants under a microeconomic approach in order to analyze determining factors of the participations of trade shows. As a result, with regard to the participation fees, income and the level of education seemed to be the socioeconomic factors that positively affected visitors in paying admission fees: and age and gender were negative elements. With regard to the participating businesses, the sales and the corporate history of the businesses were the positive elements to their willingness to pay the participation fees: however, the ratio of male and female personnel turned out to be a negative element in incurring the participation fees. The purchase of ticket was a positive mode-of participation factor to the visitors: however, distance tended to be a negative element for the visitors. For the participating businesses, the number of participation tended to be a positive element: however, distance was a negative one. The positive satisfaction factors that affected visitors' willingness to pay the participation fees included exhibited items, location, and schedules for events of the convention: for the participating businesses, the actual sales at the convention, the effects of advertisement and the level of satisfaction for location tended to play positive parts.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1105-1122
• /
• 2004

The organization and company's effort to improve software qualify contributes to the increase of software productivity and quality in some sense. However, it has not been a solution of root causes. This result is caused not because of people or technology, but process in-stitutionalization. Recently SQA (Software Quality Assurance), which provide mechanism to make sure that the software development process and products follow the assigned requirements, plan and standards, is applied to achieve the quality improvements. Several standards and models are developed for SQA activities. However, those standards and mode]s are written in form and do not provide information related to the detailed procedures, methods and outputs. Therefore, the organizations that want to adopt those models or standards have to put a lot of effort to acquire the knowledge about the models and to set up SQA Process that is tailored to meet organization's goal and objectives. In this research, we developed SQA support package to support the organization to develop their SQA process in more convenient and systematic ways. With this package, the organizations can establish SQA Process by tailoring those features necessary to reflect organization's characteristics. We expect this package contribute the organizations in a way that it reduce the effort and cost for establishing SQA process.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.7C
• /
• pp.421-427
• /
• 2011

The importance of the real-time object recognition and tracking field has been growing steadily due to rapid advancement in the computer vision applications industry. As is well known, the mean-shift algorithm is widely used in robust real-time object tracking systems. Since the mentioned algorithm is easy to implement and efficient in object tracking computation, many say it is suitable to be applied to real-time object tracking systems. However, one of the major drawbacks of this algorithm is that it always converges to a local mode, failing to perform well in a cluttered environment. In this paper, an Optical Flow-based algorithm which fits for real-time recognition of multiple moving objects is proposed. Also in the tests, the newly proposed method contributed to raising the similarity of multiple moving objects, the similarity was as high as 0.96, up 13.4% over that of the mean-shift algorithm. Meanwhile, the level of pixel errors from using the new method keenly decreased by more than 50% over that from applying the mean-shift algorithm. If the data processing speed in the video surveillance systems can be reduced further, owing to improved algorithms for faster moving object recognition and tracking functions, we will be able to expect much more efficient intelligent systems in this industrial arena.

• The KIPS Transactions:PartC
• /
• v.14C no.5
• /
• pp.431-438
• /
• 2007

RFID system is core technology that construct ubiquitous environment for replacement of barcode technology. Use ratio of RFID system rapidly increase because the technology has many good points such as identification speed, storage space, convenience etc. But low-cost tag operates easily by query of reader, so the system happened user privacy violent problem by tag information exposure. The system studied many ways for security application, but operation capability of low-cost tag is about $5K{\sim}10K$ gates, but only $250{\sim}3K$ gates allocated security part. So it is difficult to apply security to the system. Therefore, this scheme uses dividing 64 bits and reduces arithmetic, so proposed scheme provide mutual authentication that can apply to low-cost RFID system. Existing methods divide by 4 and used 96 bits. However, that reduces 32 bits length for lightweight and reduced from communication number of times of 7 times to 5 times. Also, because offer security by random number than existing scheme that generate two random numbers, that is more efficient. However, uses hash function for integrity that was not offered by XOR arithmetic and added extension of proposed scheme. Extended scheme is not offered efficiency than methods that use XOR arithmetic, but identification distance is mode that is proposed secure so that can use in for RFID system.