• Title/Summary/Keyword: Fast Restoration

Search Result 139, Processing Time 0.033 seconds

Development of Electrical Stimulator for Restoration of Locomotion in Paraplegic Patients (하반신마비 환자에서 보행기능의 복원을 위한 전기자극법의 개발)

  • 박병림;김민선
    • Journal of Biomedical Engineering Research
    • /
    • v.15 no.4
    • /
    • pp.429-438
    • /
    • 1994
  • An electrical stimulator was designed to induce locomotion for paraplegic patients caused by central nervous system injury. Optimal stimulus parameters, which can minimize muscle fatigue and can achieve effective muscle contraction were determined in slow and fast muscles in Sprague-Dawley rats. Stimulus patterns of our stimulator were designed to simulate eleclromyographic activity monitored during locomotion of normal subjects. Muscle types of the lower extremity were classified according to their mechanical property of contraction, which are slow muscle (msoleus m.) and fast muscle (medial gastrocnemius m., rectus femoris m., vastus lateralis m.). Optimal parameters of electrical stimulation for slow muscles were 20 Hz, 0.2 ms square pulse. For fast muscle, 40 Hz, 0.3 ms square pulse was optimal to produce repeated contraction. Higher'stimulus intensity was required when synergistic muscles were stimulated simultaneously than when they were stimulated individually. Electrical stimulation for each muscle was designed to generate bipedal locomotion, so that individual muscles alternate contraction and relaxation to simulate stance and swing phases. Portable electrical stimulator with 16 channels built in microprocessor was constructed and applied to paraplegic patients due to lumbar cord injury. The electrical slimulator restored partially gait function in paraplegic patients.

  • PDF

Fast Patch Retrieval for Example-based Super Resolution by Multi-phase Candidate Reduction (단계적 후보 축소에 의한 예제기반 초해상도 영상복원을 위한 고속 패치 검색)

  • Park, Gyu-Ro;Kim, In-Jung
    • Journal of KIISE:Software and Applications
    • /
    • v.37 no.4
    • /
    • pp.264-272
    • /
    • 2010
  • Example-based super resolution is a method to restore a high resolution image from low resolution images through training and retrieval of image patches. It is not only good in its performance but also available for a single frame low-resolution image. However, its time complexity is very high because it requires lots of comparisons to retrieve image patches in restoration process. In order to improve the restoration speed, an efficient patch retrieval algorithm is essential. In this paper, we applied various high-dimensional feature retrieval methods, available for the patch retrieval, to a practical example-based super resolution system and compared their speed. As well, we propose to apply the multi-phase candidate reduction approach to the patch retrieval process, which was successfully applied in character recognition fields but not used for the super resolution. In the experiments, LSH was the fastest among conventional methods. The multi-phase candidate reduction method, proposed in this paper, was even faster than LSH: For $1024{\times}1024$ images, it was 3.12 times faster than LSH.

Germination Percentage and Speed under International Seed Testing Association Conditions of Main Herbaceous Plants Used on the Slope (국제종자검정협회(ISTA) 변온조건에서 비탈면 복원용 주요 초화류의 발아율 및 발아속도)

  • Park, Jin-A;Shim, Sang-Ryul
    • Journal of the Korean Society of Environmental Restoration Technology
    • /
    • v.21 no.3
    • /
    • pp.47-56
    • /
    • 2018
  • Research was initiated to investigate germination characteristics and germination pattern of 14 herbaceous plant entries used on the road slope during 30 days. An alternative germination condition for 14 herbaceous plant entries required by International Seed Testing Association(ISTA) was applied in the experiment, consisting of 8-hr light at $25^{\circ}C$ and 16-hr dark at $15^{\circ}C$. Significant differences were observed in the first germination rate(0.3%~40.7%)and in the final germination rate(7.7%~93.3%). Days to the first germination(2~8days), days to the 30% germination(2~6days) and days to the peak germination(6~18days) were different among 14 herbaceous plant entries in the study. From this result, we could find out higher final germination rate of 14 herbaceous plant entries in the following order; First, forage crops and cool-season turfgrasses; Second, herbeceous flowers; Third, wild plants. We could also divide germination rate among 14 herbaceous plant entries as 6 groups(I;very high, II;high, III;medium high, IV;medium low, V;low, VI;very low) based on the final germination rate and divide germination speed as 5 groups(A;very fast, B;fast, C;normal, D;slow, E;very slow)based on days to the peak germination. Considering germination characteristics and pattern of 14 herbaceous plant entries Medicago sativa, Lolium perenne, Festuca arundinacea and Cosmos sulphureus were regard as dominating species while Lespedeza cuneata, Silene armeria, Lotus corniculatus var.japonicus, Coreopsis tinctoria and Centaurea cyanus as competitive species following dominating species. However, Chrysanthemum burbankii, Pennisetum alopecuroides, Chrysanthemum boreale., Artemisia princeps var. orientalis and Arundinella hirta were not almost expected to emerge.

Failure Restoration of Mobility Databases by Learning and Prediction of User Mobility in Mobile Communication System (이동 통신 시스템에서 사용자 이동성의 학습과 예측에 의한 이동성 데이타베이스의 실채 회복)

  • Gil, Joon-Min;Hwang, Chong-Sun;Jeong, Young-Sik
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.4
    • /
    • pp.412-427
    • /
    • 2002
  • This paper proposes a restoration scheme based on mobility learning and prediction in the presence of the failure of mobility databases in mobile communication systems. In mobile communication systems, mobility databases must maintain the current location information of users to provide a fast connection for them. However, the failure of mobility databases may cause some location information to be lost. As a result, without an explicit restoration procedure, incoming calls to users may be rejected. Therefore, an explicit restoration scheme against the failure of mobility databases is needed to guarantee continuous service availability to users. Introducing mobility learning and prediction into the restoration process allows systems to locate users after a failure of mobility databases. In failure-free operations, the movement patterns of users are learned by a Neuro-Fuzzy Inference System (NFIS). After a failure, an inference process of the NFIS is initiated and the users' future location is predicted. This is used to locate lost users after a failure. This proposal differs from previous approaches using checkpoint because it does not need a backup process nor additional storage space to store checkpoint information. In addition, simulations show that our proposal can reduce the cost needed to restore the location records of lost users after a failure when compared to the checkpointing scheme

Selection of Tolerant Species among Korean Major Woody Plants to Restore Yeocheon Industrial Complex Area (여천공업단지의 복원을 위한 우리나라 주요 목본식물 중 내성종의 선발)

  • 유영한;이창석;김준호
    • The Korean Journal of Ecology
    • /
    • v.21 no.4
    • /
    • pp.337-344
    • /
    • 1998
  • To select tolerant species among the Korean major woody plants for restoring disturbed ecosystems by air and soil pollution, we transplanted the seedlings of 56 species in control and polluted sites within Yeocheon industrial complex area, and compared their aboveground growth characteristics such as total branch length, total leaf weight, and maximum photozynthetic rate. Tolerant species growting better in polluted site than in control site was Quercus variabilis, Pinus thunbergii, Q. aliena, P. densiflora, Styrax japonica, Alnus firma, Celtis sinensis, Elaeagnus umbellata, Q. serrata, japonica, Sorbus alnifolia, and Q. acutissimia in local tree occuring within polluted area group (80%), Ailanthus altissima in street tree group (20%), Populus tomentiglandulosa and A. hirsuta var. sibirica in fast growing tree group (50%), Acer ginala and Abies holophylla in late successional tree group (20%), Betulla platyphylla var. japonica, Acer truncatum, A. palmatum, Syringa dilatata, and Rosa multifora in garden tree group (38%), and Q. rubura, and Robinia pseudoacacia in foreign restoring tree group (20%), respectively. The remaining plant species, 37 species (57% of total species), were classified into sensitive species to pollution. Those tolerant species can be utilized for restoration of the degraded ecosystem in this polluted area.

  • PDF

A Restoration Method for Geometric Distortions to Improve Scanned Books Identification (스캔 도서 식별 성능 향상을 위한 기하하적 왜곡 복원 방법)

  • Kim, Doyoung;Lee, Sang-Hoon;Jadhav, Sagar;Lee, Sanghoon
    • Journal of Broadcast Engineering
    • /
    • v.20 no.3
    • /
    • pp.379-387
    • /
    • 2015
  • In recent years, copyright violations from illegal copying and distribution of e-comic contents have become an important issue. Fingerprinting techniques have been emerged to provide a fast and reliable identification method of identifying e-comic contents. When illegally scanned or camera captured comic contents are distributed, they suffer from distortions. So the fingerprint differs from the original version. This paper presents a restoration framework for correcting geometric distortions in distorted comics to improve the comic content identification.

Super-Resolution Iris Image Restoration using Single Image for Iris Recognition

  • Shin, Kwang-Yong;Kang, Byung-Jun;Park, Kang-Ryoung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.2
    • /
    • pp.117-137
    • /
    • 2010
  • Iris recognition is a biometric technique which uses unique iris patterns between the pupil and sclera. The advantage of iris recognition lies in high recognition accuracy; however, for good performance, it requires the diameter of the iris to be greater than 200 pixels in an input image. So, a conventional iris system uses a camera with a costly and bulky zoom lens. To overcome this problem, we propose a new method to restore a low resolution iris image into a high resolution image using a single image. This study has three novelties compared to previous works: (i) To obtain a high resolution iris image, we only use a single iris image. This can solve the problems of conventional restoration methods with multiple images, which need considerable processing time for image capturing and registration. (ii) By using bilinear interpolation and a constrained least squares (CLS) filter based on the degradation model, we obtain a high resolution iris image with high recognition performance at fast speed. (iii) We select the optimized parameters of the CLS filter and degradation model according to the zoom factor of the image in terms of recognition accuracy. Experimental results showed that the accuracy of iris recognition was enhanced using the proposed method.

Variable Aggregation in the ILP Design of WDM Networks with Dedicated Protection

  • Tornatore, Massimo;Maier, Guido;Pattavina, Achille
    • Journal of Communications and Networks
    • /
    • v.9 no.4
    • /
    • pp.419-427
    • /
    • 2007
  • In wavelength-division-multiplexing(WDM) networks a link failure may cause the failure of several high-bit-rate optical channels, thereby leading to large data loss. Recently, various protection and restoration mechanisms have been proposed to efficiently deal with this problem in mesh networks. Among them, dedicated path protection(DPP) is a promising candidate because of its ultra-fast restoration time and robustness. In this work we investigate the issue of planning and optimization of WDM networks with DPP. Integer linear programming(ILP), in particular, is one of the most common exact method to solve the design optimization problem for protected WDM networks. Traditional ILP formalizations to solve this problem rely on the classical flow or route formulation approaches, but both these approaches suffer from a excessively high computational burden. In this paper, we present a variable-aggregation method that has the ability of significantly reducing the complexity of the traditional flow formulation. We compare also the computational burden of flow formulation with variable aggregation both with the classical flow and route formulations. The comparison is carried out by applying the three alternative methods to the optimization of two case-study networks.

Design and Implementation of Linear Protection Switching for Fast Restoration in Carrier-class Ethernet Networks (캐리어 이더넷 망에서 빠른 절체를 위한 선형 프로텍션 스위칭 기능 설계 및 구현)

  • Ahn, Kye-Hyun;Kim, Kwang-Joon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.9B
    • /
    • pp.883-891
    • /
    • 2009
  • This paper proposes Ethernet linear protection switching technology in order to provide the SONET/SDH-like resiliency over Metro Ethernet Networks. The proposed design is made of an architecture with a control processor board and several data processing boards, where the control processor board is independent of data processing board, providing a flexible solution for carrier Ethernet system. However, it leads an increasing message delay between inter-processors. In this paper, we implement and confirm a restoration of failed transport connections withing 50 millisecond in spite of increasing message delay between the control processing board and data processing board providing carrier-class network survivability.

Service Restoration In Distribution Networks Using Cyclic Best-First Search (순환적 최적우선탐색을 이용한 배전계통의 정전복구)

  • Choi, Sang-Yule
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.18 no.5
    • /
    • pp.162-168
    • /
    • 2004
  • Service restoration is an emergency control in distribution control centers to restore out-of-service area as soon as possible when a fault occurs in distribution networks. Therefore, it requires fast computation time and high quality solutions for load balancing. In this paper, a load balance index and heuristic guided best-first search are proposed for these problem. The proposed algorithm consists of two parts. One is to set up a decision tree to represent the various switching operations available. Another is to identify the most effective the set of switches using proposed search technique and a feeder load balance index. Test results on the KEPCO's 108 bus distribution system show that the performance is efficient and robust.