• Title/Summary/Keyword: Intermediate Problem Method

Search Result 130, Processing Time 0.023 seconds

Spatial Multilevel Optical Flow Architecture-based Dynamic Motion Estimation in Vehicular Traffic Scenarios

  • Fuentes, Alvaro;Yoon, Sook;Park, Dong Sun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.12
    • /
    • pp.5978-5999
    • /
    • 2018
  • Pedestrian detection is a challenging area in the intelligent vehicles domain. During the last years, many works have been proposed to efficiently detect motion in images. However, the problem becomes more complex when it comes to detecting moving areas while the vehicle is also moving. This paper presents a variational optical flow-based method for motion estimation in vehicular traffic scenarios. We introduce a framework for detecting motion areas with small and large displacements by computing optical flow using a multilevel architecture. The flow field is estimated at the shortest level and then successively computed until the largest level. We include a filtering parameter and a warping process using bicubic interpolation to combine the intermediate flow fields computed at each level during optimization to gain better performance. Furthermore, we find that by including a penalization function, our system is able to effectively reduce the presence of outliers and deal with all expected circumstances in real scenes. Experimental results are performed on various image sequences from Daimler Pedestrian Dataset that includes urban traffic scenarios. Our evaluation demonstrates that despite the complexity of the evaluated scenes, the motion areas with both moving and static camera can be effectively identified.

Online Partial Evaluation of Actions (액션의 온라인 부분계산)

  • Gang, Hyeon-Gu;Do, Gyeong-Gu
    • Journal of KIISE:Software and Applications
    • /
    • v.26 no.12
    • /
    • pp.1531-1541
    • /
    • 1999
  • 프로그래밍 언어의 의미를 정형적으로 표기하는 기법인 액션의미론을 기반으로 한 컴파일러 생성기는 프로그래밍언어의 액션의미구조가 주어지면 그 언어의 컴파일러를 자동으로 생성한다. 생성된 컴파일러는 먼저 원시 프로그램을 그에 상응하는 액션 프로그램으로 확장한 후, 목적 프로그램으로 컴파일 한다. 여기서 액션 프로그램은 일종의 중간코드로 쓰이므로, 효율적인 목적코드를 생성하기 위해서 중간코드의 성능향상이 필요하다. 본 논문에서는 액션 프로그램을 부분계산을 통해 효율적인 코드로 자동 변환해 주는 온라인 액션 부분계산기를 설계하고 구현한다. 선행 연구된 오프라인 방식에서 전역분석을 하지 않고는 불가능했던 요약캡슐의 몸통, 펼치기의 몸통에 대한 부분계산이 온라인 방법을 사용하면 가능함을 보이고, 명령형 액션의 부분계산도 추가적으로 수행할 수 있도록 확장한다. Abstract Action Semantics is a framework for formally defining the semantics of programming languages. Action semantics-directed compiler generators take an action semantics definition of a programming language and automatically generate a compiler of the language. The generated compiler first expands a source program into an action denotation of the program, and then compiles it to a target code. In these compiler-generation systems, it is important to statically process the expanded action denotation - used as an intermediate code - as much as possible so that the generated compiler can produce better target code. In this paper, we develop an automatic action-transformation method based on online partial evaluation. The previous off-line method was rather weak because it could not partially evaluate actions inside the body of abstraction and unfolding-action without performing separate global analysis. The proposed online method remedies the problem, thus naturally improves the quality of residual actions. Moreover, we also extend the method to partially evaluate imperative actions.

Fault-Tolerant Adaptive Routing : Improved RIFP by using SCP in Mesh Multicomputers (적응적 오류 허용 라우팅 : SCP를 이용한 메쉬 구조에서의 RIFP 기법 개선)

  • 정성우;김성천
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.11
    • /
    • pp.603-609
    • /
    • 2003
  • Adaptive routing methods are studied for effective routing in many topologies where occurrence of the faulty nodes are inevitable. Mesh topology provides simplicity in implementing these methods. Many routing methods for mesh are able to tolerate a large number of faults enclosed by a rectangular faulty block. But they consider even good nodes in the faulty block as faulty nodes. Hence, it results the degradation of node utilization. This problem is solved by a method which transmits messages to destinations within faulty blocks via multiple “intermediate nodes”. It also divides faulty block into multiple expanded meshes. With these expanded meshes, DAG(Directed Acyclic Graph) is formed and a message is able to be routed by the shortest path according to the DAG. Therefore, the additional number of hops can be resulted. We propose a method that reduces the number of hops by searching direct paths from the destination node to the border of the faulty block. This path is called SCP(Short-Cut Path). If the path and the traversing message is on the same side of outside border of the faulty block, the message will cut into the path found by our method. It also reduces the message traverse latency between the source and the destination node.

Segmentation and Transition Techniques for Plausible Dance Motion Generation (자연스러운 춤 동작 생성을 위한 분절화와 전이기법)

  • Kang, Kyung-Kyu;Choung, Yu-Jean;Han, Kwang-Pa;Kim, Dong-Ho
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.8
    • /
    • pp.407-415
    • /
    • 2008
  • This paper presents novel segmentation and transition techniques for dancing motion synthesis. The segmentation method for dancing motions is based on Laban Movement Analysis (LMA). We assume a dance sequence as a set of small dancing motions. To segment a dancing motion is a subjective, psychological, and complex problem, so we extract the shape factor of LMA from a dance motion and observe shape's changes to find the boundaries of dance segments. We also introduce a transition method that meets constraints on the feet. This method that is based on a linear interpolation modifies the intermediate posture motion after analyzing footprint positions. The posture could be a key-frame between source motion and target motion on the transition. With the proposed techniques, it would be easy for multimedia applications to generate plausible dance motions.

Homogeneity of XEN Cells Is Critical for Generation of Chemically Induced Pluripotent Stem Cells

  • Dahee Jeong;Yukyeong Lee;Seung-Won Lee;Seokbeom Ham;Minseong Lee;Na Young Choi;Guangming Wu;Hans R. Scholer;Kinarm Ko
    • Molecules and Cells
    • /
    • v.46 no.4
    • /
    • pp.209-218
    • /
    • 2023
  • In induced pluripotent stem cells (iPSCs), pluripotency is induced artificially by introducing the transcription factors Oct4, Sox2, Klf4, and c-Myc. When a transgene is introduced using a viral vector, the transgene may be integrated into the host genome and cause a mutation and cancer. No integration occurs when an episomal vector is used, but this method has a limitation in that remnants of the virus or vector remain in the cell, which limits the use of such iPSCs in therapeutic applications. Chemical reprogramming, which relies on treatment with small-molecule compounds to induce pluripotency, can overcome this problem. In this method, reprogramming is induced according to the gene expression pattern of extra-embryonic endoderm (XEN) cells, which are used as an intermediate stage in pluripotency induction. Therefore, iPSCs can be induced only from established XEN cells. We induced XEN cells using small molecules that modulate a signaling pathway and affect epigenetic modifications, and devised a culture method which can produce homogeneous XEN cells. At least 4 passages were required to establish morphologically homogeneous chemically induced XEN (CiXEN) cells, whose properties were similar to those of XEN cells, as revealed through cellular and molecular characterization. Chemically iPSCs derived from CiXEN cells showed characteristics similar to those of mouse embryonic stem cells. Our results show that the homogeneity of CiXEN cells is critical for the efficient induction of pluripotency by chemicals.

A Numerical Method for Nonlinear Wave-Making Phenomena (비선형 조파현상의 수치해법)

  • Jang-Whan Kim;Kwang-June Bai
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.30 no.1
    • /
    • pp.65-72
    • /
    • 1993
  • A numerical method for nonlinear free-surface-wave problem is developed in this paper. The final goal of this study is to simulate the towing tank experiment of a ship model and to partially replace the experiment by the numerical model. The exact problem in the scope of potential flow theory is formulated by a variational principle based on the classical Hamilton's principle. A localized finite element method is used in the present numerical computations which made use of the following two notable steps. The first step is an efficient treatment of the numerical radiation condition by using the intermediate nonlinear-to-linear transition buffer subdomain between the fully nonlinear and linear subdomains. The second is the use of a modal analysis in the final stage of the solution procedures, which enables us to reduce the computation time drastically. With these improvements the present method can treat a much larger computational domain than that was possible previously. A pressure patch on the free surface was chosen as an example. From the present computed results we could investigate the effect of nonlinearity on the down-stream wave pattern more clearly than others, because much larger computational domain was treated. We found, specifically, the widening of the Kelvin angle and the increase of the wave numbers and the magnitude of wave profiles.

  • PDF

Dynamic Analysis based on AOP for Checking Security Vulnerability (보안 취약점 검사를 위한 AOP 기반의 동적 분석)

  • Seo, Kwang-Ik;Choi, Eun-Man
    • Journal of KIISE:Software and Applications
    • /
    • v.37 no.10
    • /
    • pp.773-778
    • /
    • 2010
  • OWASP announced most of vulnerabilities result from the data injection by user in 2010 after 2007. Because the contaminated input data is determined at runtime, those data should be checked dynamically. To analyze data and its flow at runtime, dynamic analysis method usually inserts instrument into source code. Intermediate code insertion makes it difficult to manage and extend the code so that the instrument code would be spreaded out according to increase of analysis coverage and volume of code under analysis. In addition, the coupling gets strong between instrument modules and target modules. Therefore developers will struggle against modify or extend the analysis code as instrument. To solve these problem, this paper defines vulnerabilities as a concern using AOP, and suggest the flexible and extensible analysis method to insertion and deletion without increase of coupling.

Depth map temporal consistency compensation using motion estimation (움직임 추정을 통한 깊이 지도의 시간적 일관성 보상 기법)

  • Hyun, Jeeho;Yoo, Jisang
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.2
    • /
    • pp.438-446
    • /
    • 2013
  • Generally, a camera isn't located at the center of display in a tele-presence system and it causes an incorrect eye contact between speakers which reduce the realistic feeling during the conversation. To solve this incorrect eye contact problem, we newly propose an intermediate view reconstruction algorithm using both a color camera and a depth camera and applying for the depth image based rendering (DIBR) algorithm. In the proposed algorithm, an efficient hole filling method using the arithmetic mean value of neighbor pixels and an efficient boundary noise removal method by expanding the edge region of depth image are included. We show that the generated eye-contacted image has good quality through experiments.

Generation of an eye-contacted view using color and depth cameras (컬러와 깊이 카메라를 이용한 시점 일치 영상 생성 기법)

  • Hyun, Jee-Ho;Han, Jae-Young;Won, Jong-Pil;Yoo, Ji-Sang
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.8
    • /
    • pp.1642-1652
    • /
    • 2012
  • Generally, a camera isn't located at the center of display in a tele-presence system and it causes an incorrect eye contact between speakers which reduce the realistic feeling during the conversation. To solve this incorrect eye contact problem, we newly propose an intermediate view reconstruction algorithm using both a color camera and a depth camera and applying for the depth image based rendering (DIBR) algorithm. In the proposed algorithm, an efficient hole filling method using the arithmetic mean value of neighbor pixels and an efficient boundary noise removal method by expanding the edge region of depth image are included. We show that the generated eye-contacted image has good quality through experiments.

Estimating the Regularizing Parameters for Belief Propagation Based Stereo Matching Algorithm (Belief Propagation 기반 스테레오 정합을 위한 정합 파라미터의 추정방식 제안)

  • Oh, Kwang-Hee;Lim, Sun-Young;Hahn, Hee-Il
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.1
    • /
    • pp.112-119
    • /
    • 2010
  • This paper defines the probability models for determining the disparity map given stereo images and derives the methods for solving the problem, which is proven to be equivalent to an energy-based stereo matching. Under the assumptions the difference between the pixel on the left image and the corresponding pixel on the right image and the difference between the disparities of the neighboring pixels are exponentially distributed, a recursive approach for estimating the MRF regularizing parameter is proposed. Usually energy-based stereo matching methods are so sensitive to the parameter that it should be carefully determined. The proposed method alternates between estimating the parameter with the intermediate disparity map and estimating the disparity map with the estimated parameter, after computing it with random initial parameter. It is shown that the parameter estimated by the proposed method converges to the optimum and its performance can be improved significantly by adjusting the parameter and modifying the energy term.