• The KIPS Transactions:PartB
• /
• v.18B no.5
• /
• pp.255-264
• /
• 2011

In this paper, we propose a forward vehicle detection algorithm using column detection and bird's-eye view mapping based on stereo vision. The algorithm can detect forward vehicles robustly in real complex traffic situations. The algorithm consists of the three steps, namely road feature-based column detection, bird's-eye view mapping-based obstacle segmentation, obstacle area remerging and vehicle verification. First, we extract a road feature using maximum frequent values in v-disparity map. And we perform a column detection using the road feature as a new criterion. The road feature is more appropriate criterion than the median value because it is not affected by a road traffic situation, for example the changing of obstacle size or the number of obstacles. But there are still multiple obstacles in the obstacle areas. Thus, we perform a bird's-eye view mapping-based obstacle segmentation to divide obstacle accurately. We can segment obstacle easily because a bird's-eye view mapping can represent the position of obstacle on planar plane using depth map and camera information. Additionally, we perform obstacle area remerging processing because a segmented obstacle area may be same obstacle. Finally, we verify the obstacles whether those are vehicles or not using a depth map and gray image. We conduct experiments to prove the vehicle detection performance by applying our algorithm to real complex traffic situations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.12
• /
• pp.1054-1064
• /
• 2012

HDR (high dynamic range) tone mapping algorithms are used in image processing that reduces the dynamic range of an image to be displayed on LDR (low dynamic range) devices properly. The retinex is one of the tone mapping algorithms to provide dynamic range compression, color constancy, and color rendition. It has been developed through multi-scale methods and luminance-based methods. Retinex algorithms still have drawbacks such as the emphasized noise and desaturation. In this paper, we propose a multi scale tone mapping algorithm for enhancement of contrast, saturation, and noise of HDR rendered images based on visual brightness functions. In the proposed algorithm, HSV color space has been used for preserving the hue and saturation of images. And the algorithm includes the estimation of minimum and maximum luminance level and a visual gamma function for the variation of viewing conditions. And subjective and objective evaluations show that proposed algorithm is better than existing algorithms. The proposed algorithm is expected to image quality enhancement in some fields that require a improvement of the dynamic range due to the changes in the viewing condition.

• Journal of applied mathematics & informatics
• /
• v.28 no.1_2
• /
• pp.13-30
• /
• 2010

Let C be a nonempty closed convex subset of a real Hilbert space H. Consider the following iterative algorithm given by $x_0\;{\in}\;C$ arbitrarily chosen, $x_{n+1}\;=\;{\alpha}_n{\gamma}f(W_nx_n)+{\beta}_nx_n+((1-{\beta}_n)I-{\alpha}_nA)W_nP_C(I-s_nB)x_n$, ${\forall}_n\;{\geq}\;0$, where $\gamma$ > 0, B : C $\rightarrow$ H is a $\beta$-inverse-strongly monotone mapping, f is a contraction of H into itself with a coefficient $\alpha$ (0 < $\alpha$ < 1), $P_C$ is a projection of H onto C, A is a strongly positive linear bounded operator on H and $W_n$ is the W-mapping generated by a finite family of nonexpansive mappings $T_1$, $T_2$, ${\ldots}$, $T_N$ and {$\lambda_{n,1}$}, {$\lambda_{n,2}$}, ${\ldots}$, {$\lambda_{n,N}$}. Nonexpansivity of each $T_i$ ensures the nonexpansivity of $W_n$. We prove that the sequence {$x_n$} generated by the above iterative algorithm converges strongly to a common fixed point $q\;{\in}\;F$ := $\bigcap^N_{i=1}F(T_i)\;\bigcap\;VI(C,\;B)$ which solves the variational inequality $\langle({\gamma}f\;-\;A)q,\;p\;-\;q{\rangle}\;{\leq}\;0$ for all $p\;{\in}\;F$. Using this result, we consider the problem of finding a common fixed point of a finite family of nonexpansive mappings and a strictly pseudocontractive mapping and the problem of finding a common element of the set of common fixed points of a finite family of nonexpansive mappings and the set of zeros of an inverse-strongly monotone mapping. The results obtained in this paper extend and improve the several recent results in this area.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.7
• /
• pp.131-139
• /
• 2013

To overcome the limitations in performance and power consumption of traditional electrical interconnection based network-on-chips (NoCs), a hybrid optical network-on-chip (HONoC) architecture using optical interconnects is emerging. However, the HONoC architecture should use circuit-switching scheme owing to the overhead by optical devices, which worsens the latency unfairness problem caused by frequent path collisions. This resultingly exert a bad influence in overall performance of the system. In this paper, we propose a new task mapping algorithm for optimizing latency by reducing path collisions. The proposed algorithm allocates a task to a certain processing element (PE) for the purpose of minimizing path collisions and worst case latencies. Compared to the random mapping technique and the bandwidth-constrained mapping technique, simulation results show the reduction in latency by 43% and 61% in average for each $4{\times}4$ and $8{\times}8$ mesh topology, respectively.

• Journal of the Korean Society for Library and Information Science
• /
• v.41 no.2
• /
• pp.335-357
• /
• 2007

There has been many studies representing intellectual structures with multidimensional scaling(MDS) However MDS configuration is limited in representing local details and explicit structures. In this paper, we identified two components of MDS mapping approach; one is MDS algorithm and the other is preparation of data matrix. Various combinations of the two components of MDS mapping are compared through some measures of fit. It is revealed that the conventional approach composed of ALSCAL algorithm and Euclidean distance matrix calculated from Pearson's correlation matrix is the worst of the compared MDS mapping approaches. Otherwise the best approach to make MDS map is composed of PROXSCAL algorithm and z-scored Euclidean distance matrix calculated from Pearson's correlation matrix. These results suggest that we could obtain more detailed and explicit map of a knowledge domain through careful considerations on the process of MDS mapping.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.45 no.6
• /
• pp.95-101
• /
• 2008

In this paper, we present a new smoothing algorithm for variable depth mapping for real time stereoscopic image for 3D display. Proposed algorithm is based on the physical concept, called Laplacian equation and we also discuss the mapping of the depth from scene to displayed image. The approach to solve the problem in stereoscopic image which we adopt in this paper is similar to multi-region algorithm which was proposed by N.Holliman. The main difference thing in our algorithm compared with the N.Holliman's multi-region algorithm is that we use the Laplacian equation by considering the distance between viewer and object. We implement the real time stereoscopic image generation method for OpenGL on the circular polarized LCD screen to demonstrate its real functioning in the visual sensory system in human brain. Even though we make and use artificial objects by using OpenGL to simulate the proposed algorithm we assure that this technology may be applied to stereoscopic camera system not only for personal computer system but also for public broad cast system.

• Journal of the Society of Naval Architects of Korea
• /
• v.53 no.2
• /
• pp.115-126
• /
• 2016

In the process of ship building, it is known that the maintenance of working period and saving cost are one of the important part during the logistics of blocks transportation. Precise operational planning inside the shipyard plays a big role for a smooth transportation of blocks. But many problems arise in the process of block transportation such as the inevitable road damage during the transportation of the blocks, unpredictable stockyard utilization of the road associated with a particular lot number, addition of unplanned blocks. Therefore, operational plan needs to be re-established frequently in real time for an efficient block management. In order to find the shortest path between lot numbers, there are several representative methods such as Floyd algorithm that has the characteristics of many-to-many mapping, Dijkstra algorithm that has the characteristic of one-to-many mapping, and the A* algorithm which has the one-to-one mapping, but many authors have published without the mutual comparisons of these algorithms. In this study, some appropriate comparison have been reviewed about the advantages and disadvantages of these algorithms in terms of precision and cost analysis of calculating the paths and planning system to operate the transporters. The flexible operating plan is proposed to handle a situation such as damaged path, changing process during block transportation. In addition, an operational algorithm of a vacant transporter is proposed to cover the shortest path in a minimum time considering the situation of transporter rotation for practical use.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.49 no.8
• /
• pp.1-9
• /
• 2012

Quantum-Inspired Evolutionary Algorithm(QEA) contains sufficient data-level parallelism to be naturally accelerated on GPUs. For an efficient reduction of execution time, however, careful task-mapping should be done to properly reflect the characteristics of CPU and GPU. Furthermore, when deciding which part of the application should run on GPU, we need to consider the data transfer between CPU and GPU memory spaces as well as the data-level parallelism. In addition, the usage of zero-copy host memory, proper choice of the execution configuration, and thread organization considering memory coalescing is important to further reduce the execution time. With all these techniques, we could run QEA 3.69 times faster on average in comparison with the multi-threading CPU for the case of 0-1 knapsack problem with 30,000 items.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.13 no.2
• /
• pp.197-208
• /
• 2000

Choi et al./sup 1)/ presented the total Lagrangian formulation based upon the degenerated shell element. Geometrically correct formulation is developed by updating the direction of normal vectors and taking into account the second order rotation terms in the incremental displacement field. Assumed strain concept is adopted in order to overcome the shear locking phenomena and to eliminate the spurious zero energy mode. In this paper, for the ultimate strength analysis of stiffened shell structures considering effects of residual stresses, the return mapping algorithm based on the consistent elasto-plastic tangent modulus is applied to anisotropic shell structures. In addition, the load/displacement incremental scheme is adopted for non-linear F.E. analysis. Based on such methodology, the computer program is developed and numerical examples to demonstrate the accuracy and the effectiveness of the proposed shell element are presented and compared with the results in literatures.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.3
• /
• pp.35-46
• /
• 1999

In this paper, we propose a new CPLD technology mapping algorithm improving run-time under time constraint. In our technology mapping algorithm. a given logic equation is constructed as the DAG type. then the DAG is reconstructed by replicating the node that outdegree is more than or equal to 2. As a result, it makes delay time and the number of CLBs, run-time to be minimized. Also. after the number of multi-level is defined and cost of each nodes is calculated, the graph is partitioned in order to fit to k that is the number of OR term within Cl.B. The partitioned nodes are merged through collapsing and bin packing is performed in order to fit to the number of OR term within CLB. In the results of experiments to MCNC circuits for logic synthesis benchmark, we can shows that proposed technology mapping algorithm reduces run-time much more than the TMCPLD.