Ändra sökning
Avgränsa sökresultatet
6789101112 401 - 450 av 1859
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 401.
    Dornaika, Fadi
    et al.
    Computer Vision Centre, Autonomous University of Barcelona, Edifici O, Campus UAB, Bellaterra, Barcelona, Spain.
    Ahlberg, Jörgen
    Swedish Defence Research Agency (FOI), Linköping, Sweden.
    Fitting 3D Face Models for Tracking and Active Appearance Model Training2006Ingår i: Image and Vision Computing, ISSN 0262-8856, E-ISSN 1872-8138, Vol. 24, nr 9, s. 1010-1024Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In this paper, we consider fitting a 3D deformable face model to continuous video sequences for the tasks of tracking and training. We propose two appearance-based methods that only require a simple statistical facial texture model and do not require any information about an empirical or analytical gradient matrix, since the best search directions are estimated on the fly. The first method computes the fitting using a locally exhaustive and directed search where the 3D head pose and the facial actions are simultaneously estimated. The second method decouples the estimation of these parameters. It computes the 3D head pose using a robust feature-based pose estimator incorporating a facial texture consistency measure. Then, it estimates the facial actions with an exhaustive and directed search. Fitting and tracking experiments demonstrate the feasibility and usefulness of the developed methods. A performance evaluation also shows that the proposed methods can outperform the fitting based on an active appearance model search adopting a pre-computed gradient matrix. Although the proposed schemes are not as fast as the schemes adopting a directed continuous search, they can tackle many disadvantages associated with such approaches.

  • 402. Drazic, Slobodan
    et al.
    Sladoje, Natasa
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för visuell information och interaktion. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion.
    Lindblad, Joakim
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för visuell information och interaktion. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion.
    Estimation of Feret's diameter from pixel coverage representation of a shape2016Ingår i: Pattern Recognition Letters, ISSN 0167-8655, E-ISSN 1872-7344, Vol. 80, s. 37-45Artikel i tidskrift (Refereegranskat)
  • 403.
    Dražić, Slobodan
    et al.
    Faculty of Technical Sciences, University of Novi Sad, Serbia.
    Lindblad, Joakim
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Centrum för bildanalys. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion.
    Sladoje, Natasa
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Centrum för bildanalys. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion. Faculty of Technical Sciences, University of Novi Sad, Serbia.
    Precise Estimation of the Projection of a Shape from a Pixel Coverage Representation2011Ingår i: Proceedings of the 7th IEEE International Symposium on Image and Signal Processing and Analysis (ISPA), IEEE Computer Society, 2011, s. 569-574Konferensbidrag (Refereegranskat)
    Abstract [en]

    Measuring width and diameter of a shape areproblems well studied in the literature. A pixel coverage repre-sentation is one specific type of digital fuzzy representation of acontinuous image object, where the (membership) value of eachpixel is (approximately) equal to the relative area of the pixelwhich is covered by the continuous object. Lately a number ofmethods for shape analysis use pixel coverage for reducing errorof estimation. We introduce a novel method for estimating theprojection of a shape in a given direction. The method is based onutilizing pixel coverage representation of a shape. Performance ofthe method is evaluated by a number of tests on synthetic objects,confirming high precision and applicability for calculation ofdiameter and elongation of a shape.

  • 404.
    Dubba, Krishna Sandeep Reddy
    et al.
    School of Computing, University of Leeds, Leeds, UK.
    Cohn, Anthony G.
    School of Computing, University of Leeds, Leeds, UK.
    Hogg, David C.
    School of Computing, University of Leeds, Leeds, UK.
    Bhatt, Mehul
    Cognitive Systems, SFB/TR 8 Spatial Cognition, University of Bremen, Bremen, Germany.
    Dylla, Frank
    Cognitive Systems, SFB/TR 8 Spatial Cognition, University of Bremen, Bremen, Germany.
    Learning Relational Event Models from Video2015Ingår i: The journal of artificial intelligence research, ISSN 1076-9757, E-ISSN 1943-5037, Vol. 53, s. 41-90Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Event models obtained automatically from video can be used in applications ranging from abnormal event detection to content based video retrieval. When multiple agents are involved in the events, characterizing events naturally suggests encoding interactions as relations. Learning event models from this kind of relational spatio-temporal data using relational learning techniques such as Inductive Logic Programming (ILP) hold promise, but have not been successfully applied to very large datasets which result from video data. In this paper, we present a novel framework REMIND (Relational Event Model INDuction) for supervised relational learning of event models from large video datasets using ILP. Efficiency is achieved through the learning from interpretations setting and using a typing system that exploits the type hierarchy of objects in a domain. The use of types also helps prevent over generalization. Furthermore, we also present a type-refining operator and prove that it is optimal. The learned models can be used for recognizing events from previously unseen videos. We also present an extension to the framework by integrating an abduction step that improves the learning performance when there is noise in the input data. The experimental results on several hours of video data from two challenging real world domains (an airport domain and a physical action verbs domain) suggest that the techniques are suitable to real world scenarios.

  • 405.
    Duberg, Daniel
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Centra, Centrum för autonoma system, CAS.
    Jensfelt, Patric
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Centra, Centrum för autonoma system, CAS.
    The Obstacle-restriction Method for Tele-operation of Unmanned Aerial Vehicles with Restricted Motion2018Ingår i: 2018 15TH INTERNATIONAL CONFERENCE ON CONTROL, AUTOMATION, ROBOTICS AND VISION (ICARCV), IEEE , 2018, s. 266-273Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper presents a collision avoidance method for tele-operated unmanned aerial vehicles (UAVs). The method is designed to assist the operator at all times, such that the operator can focus solely on the main objectives instead of avoiding obstacles. We restrict the altitude to be fixed in a three dimensional environment to simplify the control and operation of the UAV. The method contributes a number of desired properties not found in other collision avoidance systems for tele-operated UAVs. Our method i) can handle situations where there is no input from the user by actively stopping and proceeding to avoid obstacles, ii) allows the operator to slide between prioritizing staying away from objects and getting close to them in a safe way when so required, and iii) provides for intuitive control by not deviating too far from the control input of the operator. We demonstrate the effectiveness of the method in real world experiments with a physical hexacopter in different indoor scenarios. We also present simulation results where we compare controlling the UAV with and without our method activated.

  • 406.
    Durán, Boris
    et al.
    Högskolan i Skövde, Institutionen för kommunikation och information. Högskolan i Skövde, Forskningscentrum för Informationsteknologi.
    Lee, Gauss
    Högskolan i Skövde, Institutionen för kommunikation och information. Högskolan i Skövde, Forskningscentrum för Informationsteknologi.
    Lowe, Robert
    Högskolan i Skövde, Institutionen för kommunikation och information. Högskolan i Skövde, Forskningscentrum för Informationsteknologi.
    Learning a DFT-based sequence with reinforcement learning: A NAO implementation2012Ingår i: Paladyn - Journal of Behavioral Robotics, ISSN 2080-9778, E-ISSN 2081-4836, Vol. 3, nr 4, s. 181-187Artikel i tidskrift (Refereegranskat)
  • 407.
    Dürr, Hans-Bernd
    et al.
    Institute for Systems Theory and Automatic Control, University of Stuttgart.
    Stankovic, Milos S.
    KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre. KTH, Skolan för elektro- och systemteknik (EES), Reglerteknik.
    Johansson, Karl Henrik
    KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre. KTH, Skolan för elektro- och systemteknik (EES), Reglerteknik.
    Distributed Positioning of Autonomous Mobile Sensors with Application to Coverage Control2011Ingår i: Proc. American Control Conference (ACC), IEEE , 2011, s. 4822-4827Konferensbidrag (Refereegranskat)
    Abstract [en]

    We consider problems in multi-agent systems where a network of mobile sensors needs to self-organize such that some global objective function is maximized. To deal with the agents' lack of global information we approach the problem in a game-theoretic framework where agents/players are only able to access local measurements of their own local utility functions whose parameters and detailed analytical forms may be unknown. We then propose a distributed and adaptive algorithm, where each agent applies a local extremum seeking feedback adopted to its specific motion dynamics, and prove its global practical stability, implying that the agents asymptotically reach a configuration that is arbitrary close to the globally optimal one. For the stability analysis we introduce a novel methodology based on a Lie bracket trajectory approximation and combine it with a potential game approach. We apply the proposed algorithm to the sensor coverage problem and solve it in a distributed way where the agents do not need any a priori knowledge about the distribution of the events to be detected and about the detection probabilities of the individual agents. The proposed scheme is illustrated through simulations.

  • 408.
    Echelmeyer, Wolfgang
    et al.
    University of Reutlingen, Reutlingen, Germany.
    Kirchheim, Alice
    School of Science and Technology, Örebro University, Örebro, Sweden.
    Lilienthal, Achim
    Örebro universitet, Institutionen för naturvetenskap och teknik.
    Akbiyik, Hülya
    University of Reutlingen, Reutlingen, Germany.
    Bonini, Marco
    University of Reutlingen, Reutlingen, Germany.
    Performance Indicators for Robotics Systems in Logistics Applications2011Konferensbidrag (Refereegranskat)
    Abstract [en]

    The transfer of research results to market-ready products is often a costly and time-consuming process. In order to generate successful products, researchers must cooperate with industrial companies; both the industrial and academic partners need to have a detailed understanding of the requirements of all parties concerned. Academic researchers need to identify the performance indicators for technical systems within a business environment and be able to apply them.

    Inservice logistics today, nearly all standardized mass goods are unloaded manually with one reason for this being the undefined position and orientation of the goods in the carrier. A study regarding the qualitative and quantitative properties of goods that are transported in containers shows that there is a huge economic relevance for autonomous systems. In 2008, more than 8,4 billion Twenty-foot equivalent units (TEU) were imported and unloaded manually at European ports, corresponding to more than 331,000 billion single goods items.

    Besides the economic relevance, the opinion of market participants is an important factor for the success of new systems on the market. The main outcomes of a study regarding the challenges, opportunities and barriers in robotic-logistics, allow for the estimation of the economic efficiency of performance indicators, performance flexibility and soft factors. The economic efficiency of the performance parameters is applied to the parcel robot – a cognitive system to unload parcels autonomously from containers. In the following article, the results of the study are presented and the resultant conclusions discussed.

  • 409.
    Efremova, Natalia
    et al.
    Plekhanov Russian University, Moskow, Russia.
    Kiselev, Andrey
    Örebro universitet, Institutionen för naturvetenskap och teknik.
    Cognitive Architectures for Optimal Remote Image Representation for Driving a Telepresence Robot2014Konferensbidrag (Refereegranskat)
  • 410. Eidenvall, Lars
    et al.
    Sjöberg, Birgitta Janero
    Linköpings universitet, Institutionen för medicin och hälsa, Klinisk fysiologi. Linköpings universitet, Hälsouniversitetet. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV. Östergötlands Läns Landsting, Hjärt- och Medicincentrum, Fysiologiska kliniken US.
    Ask, Per
    Linköpings universitet, Institutionen för medicinsk teknik, Fysiologisk mätteknik. Linköpings universitet, Tekniska högskolan.
    Loyd, Dan
    Linköpings universitet, Institutionen för ekonomisk och industriell utveckling, Mekanisk värmeteori och strömningslära. Linköpings universitet, Tekniska högskolan.
    Wranne, Bengt
    Linköpings universitet, Institutionen för medicin och vård, Klinisk fysiologi. Linköpings universitet, Hälsouniversitetet. Östergötlands Läns Landsting, Hjärt- och Medicincentrum, Fysiologiska kliniken US.
    Two-dimensional color Doppler flow velocity profiles can be time corrected with an external ECG-delay device.1992Ingår i: Journal of the American Society of Echocardiography, ISSN 0894-7317, E-ISSN 1097-6795, Vol. 5, nr 4, s. 405-413Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Although two-dimensional ultrasound color flow imaging is often considered to be a real-time technique, the acquisition time for two-dimensional color images may be up to 200 msec. Time correction is therefore necessary to obtain correct flow velocity profiles. We have developed a time-correction method in which a specially designed unit detects the QRS complex from the patient and creates a trig pulse that is delayed incrementally in relation to the QRS complex. This trig pulse controls the acquisition of the ultrasound images. A number of consecutively delayed images, with known incremental delay between the sweeps, can thus be stored in the memory of the echocardiograph and transferred digitally to a computer. The time-corrected flow velocity profile is obtained by interpolation of data from the time-delayed profiles. The system was evaluated in a Doppler string phantom test. With this technique it is possible to study time-corrected flow velocity profiles without the need to alter existing ultrasound Doppler equipment.

  • 411.
    Eilertsen, Gabriel
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska fakulteten.
    The high dynamic range imaging pipeline: Tone-mapping, distribution, and single-exposure reconstruction2018Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    Techniques for high dynamic range (HDR) imaging make it possible to capture and store an increased range of luminances and colors as compared to what can be achieved with a conventional camera. This high amount of image information can be used in a wide range of applications, such as HDR displays, image-based lighting, tone-mapping, computer vision, and post-processing operations. HDR imaging has been an important concept in research and development for many years. Within the last couple of years it has also reached the consumer market, e.g. with TV displays that are capable of reproducing an increased dynamic range and peak luminance.

    This thesis presents a set of technical contributions within the field of HDR imaging. First, the area of HDR video tone-mapping is thoroughly reviewed, evaluated and developed upon. A subjective comparison experiment of existing methods is performed, followed by the development of novel techniques that overcome many of the problems evidenced by the evaluation. Second, a largescale objective comparison is presented, which evaluates existing techniques that are involved in HDR video distribution. From the results, a first open-source HDR video codec solution, Luma HDRv, is built using the best performing techniques. Third, a machine learning method is proposed for the purpose of reconstructing an HDR image from one single-exposure low dynamic range (LDR) image. The method is trained on a large set of HDR images, using recent advances in deep learning, and the results increase the quality and performance significantly as compared to existing algorithms.

    The areas for which contributions are presented can be closely inter-linked in the HDR imaging pipeline. Here, the thesis work helps in promoting efficient and high-quality HDR video distribution and display, as well as robust HDR image reconstruction from a single conventional LDR image.

  • 412.
    Eilertsen, Gabriel
    et al.
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Forssén, Per-Erik
    Linköpings universitet, Institutionen för systemteknik, Datorseende. Linköpings universitet, Tekniska fakulteten.
    Unger, Jonas
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska fakulteten.
    BriefMatch: Dense binary feature matching for real-time optical flow estimation2017Ingår i: Proceedings of the Scandinavian Conference on Image Analysis (SCIA17) / [ed] Puneet Sharma, Filippo Maria Bianchi, Springer, 2017, Vol. 10269, s. 221-233Konferensbidrag (Refereegranskat)
    Abstract [en]

    Research in optical flow estimation has to a large extent focused on achieving the best possible quality with no regards to running time. Nevertheless, in a number of important applications the speed is crucial. To address this problem we present BriefMatch, a real-time optical flow method that is suitable for live applications. The method combines binary features with the search strategy from PatchMatch in order to efficiently find a dense correspondence field between images. We show that the BRIEF descriptor provides better candidates (less outlier-prone) in shorter time, when compared to direct pixel comparisons and the Census transform. This allows us to achieve high quality results from a simple filtering of the initially matched candidates. Currently, BriefMatch has the fastest running time on the Middlebury benchmark, while placing highest of all the methods that run in shorter than 0.5 seconds.

  • 413.
    Eilertsen, Gabriel
    et al.
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska fakulteten. IRYSTEC, Canada.
    Mantiuk, Rafal K.
    University of Cambridge, England; IRYSTEC, Canada.
    Unger, Jonas
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska fakulteten. IRYSTEC, Canada.
    REAL-TIME NOISE-AWARE TONE-MAPPING AND ITS USE IN LUMINANCE RETARGETING2016Ingår i: 2016 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP), IEEE , 2016, s. 894-898Konferensbidrag (Refereegranskat)
    Abstract [en]

    With the aid of tone-mapping operators, high dynamic range images can be mapped for reproduction on standard displays. However, for large restrictions in terms of display dynamic range and peak luminance, limitations of the human visual system have significant impact on the visual appearance. In this paper, we use components from the real-time noise-aware tone-mapping to complement an existing method for perceptual matching of image appearance under different luminance levels. The refined luminance retargeting method improves subjective quality on a display with large limitations in dynamic range, as suggested by our subjective evaluation.

  • 414. Ek, Carl Henrik
    et al.
    Jaeckel, P.
    Campbell, Neill
    Melhuish, Chris
    Shared Gaussian Process Latent Variable Models for Handling Ambiguous Facial Expressions2009Ingår i: INTELLIGENT SYSTEMS AND AUTOMATION / [ed] Beji, L; Otmane, S; Abichou, A, 2009, s. 147-153Konferensbidrag (Refereegranskat)
  • 415.
    Ek, Carl Henrik
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC), Datorseende och robotik, CVAP. KTH, Skolan för datavetenskap och kommunikation (CSC), Centra, Centrum för Autonoma System, CAS.
    Kragic, Danica
    KTH, Skolan för datavetenskap och kommunikation (CSC), Datorseende och robotik, CVAP. KTH, Skolan för datavetenskap och kommunikation (CSC), Centra, Centrum för Autonoma System, CAS.
    The importance of structure2011Konferensbidrag (Refereegranskat)
  • 416. Ek, Carl Henrik
    et al.
    Rihan, J.
    Torr, P.
    Rogez, G.
    Lawrence, Neil D.
    Ambiguity modeling in latent spaces2008Ingår i: MACHINE LEARNING FOR MULTIMODAL INTERACTION, PROCEEDINGS / [ed] PopescuBelis, A; Stiefelhagen, R, BERLIN: SPRINGER-VERLAG BERLIN , 2008, s. 62-73Konferensbidrag (Refereegranskat)
    Abstract [en]

    We are interested in the situation where we have two or more representations of an underlying phenomenon. In particular we are interested in the scenario where the representation Lire complementary. This implies that a single individual representation is not sufficient to fully discriminate a specific instance of the underlying phenomenon, it also means that each representation is an ambiguous representation of the other complementary spaces. In this paper we present a latent variable model capable of consolidating multiple complementary representations. Our method extends canonical correlation analysis by introducing additional latent spaces that Lire specific to the different representations, thereby explaining the full variance of the observations. These additional spaces, explaining representation specific variance, separately model the variance in a representation ambiguous to the other. We develop a spectral algorithm for fast computation of the embeddings and a probabilistic model (based on Gaussian processes) for validation and inference. The proposed model has several potential application areas, we demonstrate its use for multi-modal regression on a benchmark human pose estimation data set.

  • 417.
    Ek, Carl Henrik
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC), Datorseende och robotik, CVAP. KTH, Skolan för datavetenskap och kommunikation (CSC), Centra, Centrum för Autonoma System, CAS.
    Song, Dan
    KTH, Skolan för datavetenskap och kommunikation (CSC), Datorseende och robotik, CVAP. KTH, Skolan för datavetenskap och kommunikation (CSC), Centra, Centrum för Autonoma System, CAS.
    Huebner, Kai
    KTH, Skolan för datavetenskap och kommunikation (CSC), Datorseende och robotik, CVAP. KTH, Skolan för datavetenskap och kommunikation (CSC), Centra, Centrum för Autonoma System, CAS.
    Kragic, Danica
    KTH, Skolan för datavetenskap och kommunikation (CSC), Datorseende och robotik, CVAP. KTH, Skolan för datavetenskap och kommunikation (CSC), Centra, Centrum för Autonoma System, CAS.
    Exploring affordances in robot grasping through latent structure representation2010Ingår i: The 11th European Conference on Computer Vision (ECCV 2010), 2010Konferensbidrag (Refereegranskat)
  • 418.
    Ek, Carl Henrik
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC), Datorseende och robotik, CVAP. KTH, Skolan för datavetenskap och kommunikation (CSC), Centra, Centrum för Autonoma System, CAS.
    Song, Dan
    KTH, Skolan för datavetenskap och kommunikation (CSC), Datorseende och robotik, CVAP. KTH, Skolan för datavetenskap och kommunikation (CSC), Centra, Centrum för Autonoma System, CAS.
    Huebner, Kai
    KTH, Skolan för datavetenskap och kommunikation (CSC), Datorseende och robotik, CVAP. KTH, Skolan för datavetenskap och kommunikation (CSC), Centra, Centrum för Autonoma System, CAS.
    Kragic, Danica
    KTH, Skolan för datavetenskap och kommunikation (CSC), Datorseende och robotik, CVAP. KTH, Skolan för datavetenskap och kommunikation (CSC), Centra, Centrum för Autonoma System, CAS.
    Task Modeling in Imitation Learning using Latent Variable Models2010Ingår i: 2010 10th IEEE-RAS International Conference on Humanoid Robots, Humanoids 2010, 2010, s. 458-553Konferensbidrag (Refereegranskat)
    Abstract [en]

    An important challenge in robotic research is learning and reasoning about different manipulation tasks from scene observations. In this paper we present a probabilistic model capable of modeling several different types of input sources within the same model. Our model is capable to infer the task using only partial observations. Further, our framework allows the robot, given partial knowledge of the scene, to reason about what information streams to acquire in order to disambiguate the state-space the most. We present results for task classification within and also reason about different features discriminative power for different classes of tasks.

  • 419.
    Ek, Carl Henrik
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC), Datorseende och robotik, CVAP.
    Song, Dan
    KTH, Skolan för datavetenskap och kommunikation (CSC), Datorseende och robotik, CVAP.
    Kragic, Danica
    KTH, Skolan för datavetenskap och kommunikation (CSC), Datorseende och robotik, CVAP.
    Learning Conditional Structures in Graphical Models from a Large Set of Observation Streams through efficient Discretisation2011Ingår i: IEEE International Conference on Robotics and Automation, Workshop on Manipulation under Uncertainty, 2011Konferensbidrag (Refereegranskat)
  • 420. Ek, Carl Henrik
    et al.
    Torr, Phil
    Lawrence, Neil D.
    Gaussian process latent variable models for human pose estimation2007Ingår i: MACHINE LEARNING FOR MULTIMODAL INTERACTION / [ed] Belis, AP; Renals, S; Bourlard, H, 2007, s. 132-143Konferensbidrag (Refereegranskat)
    Abstract [en]

    We describe a method for recovering 3D human body pose from silhouettes. Our model is based on learning a latent space using the Gaussian Process Latent Variable Model (GP-LVM) [1] encapsulating both pose and silhouette features Our method is generative, this allows us to model the ambiguities of a silhouette representation in a principled way. We learn a dynamical model over the latent space which allows us to disambiguate between ambiguous silhouettes by temporal consistency. The model has only two free parameters and has several advantages over both regression approaches and other generative methods. In addition to the application shown in this paper the suggested model is easily extended to multiple observation spaces without constraints on type.

  • 421.
    Ekberg, Peter
    et al.
    KTH, Skolan för industriell teknik och management (ITM), Industriell produktion.
    Daemi, Bita
    KTH, Skolan för industriell teknik och management (ITM), Industriell produktion.
    Mattsson, Lars
    KTH, Skolan för industriell teknik och management (ITM), Industriell produktion.
    3D precision measurements of meter sized surfaces using low cost illumination and camera techniques2017Ingår i: Measurement science and technology, ISSN 0957-0233, E-ISSN 1361-6501, Vol. 28, nr 4, artikel-id 045403Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Using dedicated stereo camera systems and structured light is a well-known method for measuring the 3D shape of large surfaces. However the problem is not trivial when high accuracy, in the range of few tens of microns, is needed. Many error sources need to be handled carefully in order to obtain high quality results. In this study, we present a measurement method based on low-cost camera and illumination solutions combined with high-precision image analysis and a new approach in camera calibration and 3D reconstruction. The setup consists of two ordinary digital cameras and a Gobo projector as a structured light source. A matrix of dots is projected onto the target area. The two cameras capture the images of the projected pattern on the object. The images are processed by advanced subpixel resolution algorithms prior to the application of the 3D reconstruction technique. The strength of the method lays in a different approach for calibration, 3D reconstruction, and high-precision image analysis algorithms. Using a 10 mm pitch pattern of the light dots, the method is capable of reconstructing the 3D shape of surfaces. The precision (1 sigma repeatability) in the measurements is < 10 mu m over a volume of 60 x 50 x 10 cm(3) at a hardware cost of similar to 2% of available advanced measurement techniques. The expanded uncertainty (95% confidence level) is estimated to be 83 mu m, with the largest uncertainty contribution coming from the absolute length of the metal ruler used as reference.

  • 422.
    Eklund, Anders
    Linköpings universitet, Institutionen för systemteknik.
    Image coding with H.264 I-frames2007Självständigt arbete på grundnivå (yrkesexamen), 20 poäng / 30 hpStudentuppsats
    Abstract [sv]

    I det här examensarbetet har en del av videokodningsstandarden H.264 implementerats. Den del av videokodaren som används för att koda s.k. I-bilder har implementerats för att testa hur bra den fungerar för ren stillbildskodning. Den stora skillnaden mot andra stillbildskodningsmetoder, såsom JPEG och JPEG2000, är att denna videokodaren använder både en prediktor och en transform för att komprimera stillbilderna, till skillnad från JPEG och JPEG2000 som bara använder en transform. Eftersom prediktionsfelen skickas istället för själva pixelvärdena så är många värden lika med noll eller nära noll redan innan transformationen och kvantiseringen. Metoden liknar alltså till mycket en ren videokodare, med skillnaden att man predikterar block i en bild istället för bilder i en videosekvens.

  • 423. Eklundh, Jan-Olof
    et al.
    Uhlin, Tomas
    Nordlund, Peter
    Maki, Atsuto
    KTH, Skolan för datavetenskap och kommunikation (CSC), Datorseende och robotik, CVAP.
    Active Vision and Seeing Robots1996Ingår i: International Symposium on Robotics Research, 1996Konferensbidrag (Refereegranskat)
  • 424. Eklundh, Jan-Olof
    et al.
    Uhlin, Tomas
    Nordlund, Peter
    Maki, Atsuto
    KTH, Skolan för datavetenskap och kommunikation (CSC), Datorseende och robotik, CVAP.
    Developing an Active Observer1995Ingår i: Asian Conference on Computer Vision, 1995, Vol. 1035, s. 181-190Konferensbidrag (Refereegranskat)
  • 425.
    Ekström, Johan
    KTH, Skolan för datavetenskap och kommunikation (CSC).
    Obstacle avoidance for platforms in three-dimensional environments2016Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Fältet inom kollisionsundvikande är ett välforskat område. Trots detta så är forskning inom kollisionsundvikande metoder i tre dimensioner förvånansvärt magert. För plattformar som kan navigera det tredimensionella rummet, såsom multirotor-baserade drönare kommer sådana metoder att bli mer vanliga.

    I denna tes presenteras en kollisionsundvikande metod, menad för det tredimensionella rummet. Först reduceras dimensionaliteten av det tredimensionella rummet genom att projicera hinderobservationer på ett tvådimensionellt sfärisk ark i form av en djupkarta som bibehåller information om riktning och avstånd till hinder. Därefter beaktas plattformens dimensioner genom att tillämpa ett efterbehandlingssteg på djupkartan. Till sist, med kunskap om rörelsemodellen, ett verifieringssteg där information från djupkartan används för att försäkra sig om att plattformen inte kolliderar med några hinder genom att inte tillåta kontrollinmatningar som leder till kollisioner. Om det finns flera kontrollinmatningskandidater efter verifikationssteget som leder till hastighetsvektorer nära en önskad hastighetsvektor så används en heuristisk kostnadsfunktion, där likheten i riktning och magnitud av den resulterande vektorn och önskade hastighetsvektorn värderas, för att välja en av dem.

    Utvärdering av metoden visar att plattformar kan bibehålla avstånd till hinder. Dock föreslås ytterligare arbete för att förbättra tillförlitligheten av metoden samt att utvärdera metoden i den verkliga världen.

  • 426.
    Ekström, Per
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik.
    Eriksson, Elisabeth
    Mälardalens högskola, Akademin för innovation, design och teknik.
    REDUNDANT FIRMWARE TEST SETUP IN SIMULATION AND HARDWARE: A FEASIBILITY STUDY2018Självständigt arbete på avancerad nivå (yrkesexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    A reliable embedded real-time system has many requirements to fulfil. It must meet target deadlines in a number of situations, most of them in a situation that puts heavy stress on the system. To meet these demands, numerous tests have been created which test the hardware for any possible errors the developers might think of, in order to maximise system reliability and stability. These tests will take a lot of time to execute, and as system complexity grows, more tests are introduced leading to even longer testing times. In this thesis, a method to reduce the testing time of the software and, to a lesser extent, the hardware is examined. By using the full system simulator Simics, an existing industry system from ABB was integrated and tests were performed. A proof of concept test suite for automatic redundancy tests was also implemented. By looking at the test results, it was concluded that the method shows promise. However, problems with the average latency and performance troubles with Simics shows that more work must be put into this research before the system can be run at full speed.

  • 427.
    Ekvall, Staffan
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC), Datorseende och robotik, CVAP.
    Aarno, Daniel
    KTH, Skolan för datavetenskap och kommunikation (CSC), Numerisk Analys och Datalogi, NADA.
    Kragic, Danica
    KTH, Skolan för datavetenskap och kommunikation (CSC), Centra, Centrum för Autonoma System, CAS.
    Online task recognition and real-time adaptive assistance for computer-aided machine control2006Ingår i: IEEE Transactions on robotics, ISSN 1552-3098, E-ISSN 1941-0468, Vol. 22, nr 5, s. 1029-1033Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Segmentation and recognition of operator-generated motions are commonly facilitated to provide appropriate assistance during task execution in teleoperative and human-machine collaborative settings. The assistance is usually provided in a virtual fixture framework where the level of compliance can be altered online, thus improving the performance in terms of execution time and overall precision. However, the fixtures are typically inflexible, resulting in a degraded performance in cases of unexpected obstacles or incorrect fixture models. In this paper, we present a method for online task tracking and propose the use of adaptive virtual fixtures that can cope with the above problems. Here, rather than executing a predefined plan, the operator has the ability to avoid unforeseen obstacles and deviate from the model. To allow this, the probability of following a certain trajectory (subtask) is estimated and used to automatically adjusts the compliance, thus providing the online decision of how to fixture the movement.

  • 428.
    Eldesokey, Abdelrahman
    et al.
    Linköpings universitet, Institutionen för systemteknik, Datorseende. Linköpings universitet, Tekniska fakulteten.
    Felsberg, Michael
    Linköpings universitet, Institutionen för systemteknik, Datorseende. Linköpings universitet, Tekniska fakulteten.
    Khan, Fahad Shahbaz
    Linköpings universitet, Institutionen för systemteknik, Datorseende. Linköpings universitet, Tekniska fakulteten.
    Ellipse Detection for Visual Cyclists Analysis “In the Wild”2017Ingår i: Computer Analysis of Images and Patterns: 17th International Conference, CAIP 2017, Ystad, Sweden, August 22-24, 2017, Proceedings, Part I / [ed] Michael Felsberg, Anders Heyden and Norbert Krüger, Springer, 2017, Vol. 10424, s. 319-331Konferensbidrag (Refereegranskat)
    Abstract [en]

    Autonomous driving safety is becoming a paramount issue due to the emergence of many autonomous vehicle prototypes. The safety measures ensure that autonomous vehicles are safe to operate among pedestrians, cyclists and conventional vehicles. While safety measures for pedestrians have been widely studied in literature, little attention has been paid to safety measures for cyclists. Visual cyclists analysis is a challenging problem due to the complex structure and dynamic nature of the cyclists. The dynamic model used for cyclists analysis heavily relies on the wheels. In this paper, we investigate the problem of ellipse detection for visual cyclists analysis in the wild. Our first contribution is the introduction of a new challenging annotated dataset for bicycle wheels, collected in real-world urban environment. Our second contribution is a method that combines reliable arcs selection and grouping strategies for ellipse detection. The reliable selection and grouping mechanism leads to robust ellipse detections when combined with the standard least square ellipse fitting approach. Our experiments clearly demonstrate that our method provides improved results, both in terms of accuracy and robustness in challenging urban environment settings.

  • 429.
    Eldesokey, Abdelrahman
    et al.
    Linköpings universitet, Institutionen för systemteknik, Datorseende. Linköpings universitet, Tekniska fakulteten.
    Felsberg, Michael
    Linköpings universitet, Institutionen för systemteknik, Datorseende. Linköpings universitet, Tekniska fakulteten.
    Khan, Fahad Shahbaz
    Linköpings universitet, Institutionen för systemteknik, Datorseende. Linköpings universitet, Tekniska fakulteten. Inception Institute of Artificial Intelligence Abu Dhabi, UAE.
    Propagating Confidences through CNNs for Sparse Data Regression2018Konferensbidrag (Refereegranskat)
    Abstract [en]

    In most computer vision applications, convolutional neural networks (CNNs) operate on dense image data generated by ordinary cameras. Designing CNNs for sparse and irregularly spaced input data is still an open problem with numerous applications in autonomous driving, robotics, and surveillance. To tackle this challenging problem, we introduce an algebraically-constrained convolution layer for CNNs with sparse input and demonstrate its capabilities for the scene depth completion task. We propose novel strategies for determining the confidence from the convolution operation and propagating it to consecutive layers. Furthermore, we propose an objective function that simultaneously minimizes the data error while maximizing the output confidence. Comprehensive experiments are performed on the KITTI depth benchmark and the results clearly demonstrate that the proposed approach achieves superior performance while requiring three times fewer parameters than the state-of-the-art methods. Moreover, our approach produces a continuous pixel-wise confidence map enabling information fusion, state inference, and decision support.

  • 430.
    Eliasson, Daniel
    Uppsala universitet, Fakultetsövergripande enheter, Centrum för bildanalys. Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    On measuring the intersection length of a line and a digital volume2003Rapport (Övrigt vetenskapligt)
    Abstract [en]

    This Master Thesis investigates methods to calculate the

  • 431.
    Ellner, Henrik
    Linköpings universitet, Institutionen för systemteknik.
    Facial animation parameter extraction using high-dimensional manifolds2006Självständigt arbete på grundnivå (yrkesexamen), 20 poäng / 30 hpStudentuppsats
    Abstract [en]

    This thesis presents and examines a method that can potentially be used for extracting parameters from a manifold in a space. In the thesis the method is presented, and a potential application is described. The application is determining FAP-values. FAP-values

    are used for parameterizing faces, which can e.g. be used to compress data when sending video sequences over limited bandwidth.

  • 432.
    Englund, Cristofer
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Intelligenta system (IS-lab).
    Modelling and controlling an offset lithographic printing process2007Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    The objective of this thesis is to provide methods for print quality enhancements in an offset lithographic printing proess. Various parameters characterising the print quality are recognised, however, in this work print quality is defined as the deviation of the amount of ink in a sample image from the reference print.

    The methods developed are model-based and historical data collected at the printing press are used to build the models. Inherent in the historical process data are outliers owing to sensor faults, measurement errors and impurity of the material used. It is essential to detect and remove these outliers to avoid using them to update the process models. A process modelbased outlieer detection tool has been proposed. Several diagnostic measures are ombined via a neural network to achieve robust data categorisation into inlier and outlier classes.

    To cope with the slow variation in printing process data, a SOM-based data mining and adaptive modelling technique has been proposed. The technique continously updates the data set characterising the process and the process models if they become out-of-date. A SOM-based approach to model ombination has been proposed to permit the cration of adaptive - data dependet - committees.

    A multiple models-based controller, which employs the process models developed, is combined with an integrating controller to achieve robust ink feed control. Results have shown that the robust ink feed controller is capable of controlling the ink feed in the newspaper printing press according to the desired process output. Based on the process modelling, techniques have also been developed for initialising the printing press in order to reduce the time needed to achieve the desired print quality. The use of the developed methods and tools at a print shop in Halmstad, Sweden, resulted in higher print quality and lower ink and paper waste.

  • 433.
    Englund, Cristofer
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Intelligenta system (IS-lab).
    Modelling the offset lithographic printing process2006Licentiatavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    A concept for data management and adaptive modelling of the offset lithographic printing process is proposed. Artificial neural networks built from historical process data are used to model the offset printing process aiming to develop tools for online ink flow control.

    Inherent in the historical data are outliers owing to sensor faults, measurement errors and impurity of the materials used. It is fundamental to identify outliers in process data in order to avoid using these data points for updating the model. In this work, a hybrid the process-model-network-based technique for outlier detection is proposed. Several diagnosti measures are aggregated via a neural network to categorize the data points into the oulier or inlier classes. Experimentally it was demonstrated that a fuzzy expert can be configured to label data for training the categorization neural network.

    A SOM based model combination strategy, allowing to create adaptive - data dependent - committees, is proposed to build models used for printing press initialization. Both, the number of models included into a committee and aggregation weights are specific for each input data point analyzed.

    The printing process is constantly changing due to wear, seasonal changes, duration of print jobs etc. Consequently, models trained on historical data become out of date with time and need to be updated. Therefore, a data mining and adaptive modelling approach has been propsed. The experimental investigations performed have shown that the tools developed can follow the process changes and make appropriate adaptations of the ata set and the process models. A low process modelling error has been obtained by employing data dependent committees.

  • 434.
    Englund, Cristofer
    et al.
    RISE., Swedish ICT, Viktoria.
    Chen, Lei
    RISE., Swedish ICT, Viktoria.
    Ploeg, Jeroen
    TNO Netherlands Organization for Applied Scientific Research, Netherlands.
    Semsar-Kazerooni, Elham
    TNO Netherlands Organization for Applied Scientific Research, Netherlands.
    Voronov, Alexey
    RISE., Swedish ICT, Viktoria.
    Hoang Bengtsson, Hoai
    RISE., Swedish ICT, Viktoria.
    Didoff, Jonas
    RISE., Swedish ICT, Viktoria.
    The Grand Cooperative Driving Challenge (GCDC) 2016: boosting the introduction of Cooperative Automated Vehicles2016Ingår i: IEEE wireless communications, ISSN 1536-1284, E-ISSN 1558-0687, Vol. 23, nr 4, s. 146-152Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The Grand Cooperative Driving Challenge (GCDC), with the aim to boost the introduction of cooperative automated vehicles by means of wireless communication, is presented. Experiences from the previous edition of GCDC, which was held in Helmond in the Netherlands in 2011, are summarized, and an overview and expectations of the challenges in the 2016 edition are discussed. Two challenge scenarios, cooperative platoon merge and cooperative intersection passing, are specified and presented. One demonstration scenario for emergency vehicles is designed to showcase the benefits of cooperative driving. Communications closely follow the newly published cooperative intelligent transport system standards, while interaction protocols are designed for each of the scenarios. For the purpose of interoperability testing, an interactive testing tool is designed and presented. A general summary of the requirements on teams for participating in the challenge is also presented.

  • 435.
    Englund, Cristofer
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Intelligenta system (IS-lab).
    Verikas, Antanas
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Intelligenta system (IS-lab).
    A hybrid approach to outlier detection in the offset lithographic printing process2005Ingår i: Engineering applications of artificial intelligence, ISSN 0952-1976, E-ISSN 1873-6769, Vol. 18, nr 6, s. 759-768Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Artificial neural networks are used to model the offset printing process aiming to develop tools for on-line ink feed control. Inherent in the modelling data are outliers owing to sensor faults, measurement errors and impurity of materials used. It is fundamental to identify outliers in process data in order to avoid using these data points for updating the model. We present a hybrid, the process-model-network-based technique for outlier detection. The outliers can then be removed to improve the process model. Several diagnostic measures are aggregated via a neural network to categorize data points into the outlier and inlier classes. We demonstrate experimentally that a soft fuzzy expert can be configured to label data for training the categorization of neural network.

  • 436.
    Engman, Clara
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för visuell information och interaktion.
    Skärdin, Linnea
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för visuell information och interaktion.
    Ramverk för att motverka algoritmisk snedvridning2019Självständigt arbete på avancerad nivå (yrkesexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Användningen av artificiell intelligens (AI) har tredubblats på ett år och och anses av vissa vara det viktigaste paradigmskiftet i teknikhistorien. Den rådande AI-kapplöpningen riskerar att underminera frågor om etik och hållbarhet, vilket kan ge förödande konsekvenser. Artificiell intelligens har i flera fall visat sig avbilda, och till och med förstärka, befintliga snedvridningar i samhället i form av fördomar och värderingar. Detta fenomen kallas algoritmisk snedvridning (algorithmic bias). Denna studie syftar till att formulera ett ramverk för att minimera risken att algoritmisk snedvridning uppstår i AI-projekt och att anpassa det efter ett medelstort konsultbolag. Studiens första del är en litteraturstudie på snedvridningar - både ur ett kognitivt och ur ett algoritmiskt perspektiv. Den andra delen är en undersökning av existerande rekommendationer från EU, AI Sustainability Center, Google och Facebook. Den tredje och sista delen består av ett empiriskt bidrag i form av en kvalitativ intervjustudie, som har använts för att justera ett initialt ramverk i en iterativ process.

  • 437.
    Ericson, Anton
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion.
    Object Recognition Using Digitally Generated Images as Training Data2013Självständigt arbete på avancerad nivå (yrkesexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Object recognition is a much studied computer vision problem, where the task is to find a given object in an image. This Master Thesis aims at doing a MATLAB implementation of an object recognition algorithm that finds three kinds of objects in images: electrical outlets, light switches and wall mounted air-conditioning controls. Visually, these three objects are quite similar and the aim is to be able to locate these objects in an image, as well as being able to distinguish them from one another. The object recognition was accomplished using Histogram of Oriented Gradients (HOG). During the training phase, the program was trained with images of the objects to be located, as well as reference images which did not contain the objects. A Support Vector Machine (SVM) was used in the classification phase. The performance was measured for two different setups, one where the training data consisted of photos and one where the training data consisted of digitally generated images created using a 3D modeling software, in addition to the photos. The results show that using digitally generated images as training images didn’t improve the accuracy in this case. The reason for this is probably that there is too little intraclass variability in the gradients in digitally generated images, they’re too synthetic in a sense, which makes them poor at reflecting reality for this specific approach. The result might have been different if a higher number of digitally generated images had been used.

  • 438.
    Erikson, Henrik
    et al.
    Department of Nursing and Care, Swedish Red Cross University College, Stockholm, Sweden.
    Salzmann-Erikson, Martin
    Högskolan i Gävle, Akademin för hälsa och arbetsliv, Avdelningen för hälso- och vårdvetenskap, Medicin- och vårdvetenskap.
    Future Challenges of Robotics and Artificial Intelligence in Nursing: What Can We Learn from Monsters in Popular Culture?2016Ingår i: The Permanente Journal, ISSN 1552-5767, E-ISSN 1552-5775, Vol. 20, nr 3, artikel-id 15-243Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    It is highly likely that artificial intelligence (AI) will be implemented in nursing robotics in various forms, both in medical and surgical robotic instruments, but also as different types of droids and humanoids, physical reinforcements, and also animal/pet robots. Exploring and discussing AI and robotics in nursing and health care before these tools become commonplace is of great importance. We propose that monsters in popular culture might be studied with the hope of learning about situations and relationships that generate empathic capacities in their monstrous existences. The aim of the article is to introduce the theoretical framework and assumptions behind this idea. Both robots and monsters are posthuman creations. The knowledge we present here gives ideas about how nursing science can address the postmodern, technologic, and global world to come. Monsters therefore serve as an entrance to explore technologic innovations such as AI. Analyzing when and why monsters step out of character can provide important insights into the conceptualization of caring and nursing as a science, which is important for discussing these empathic protocols, as well as more general insight into human knowledge. The relationship between caring, monsters, robotics, and AI is not as farfetched as it might seem at first glance.

  • 439.
    Erikson, M.
    Uppsala universitet, Fakultetsövergripande enheter, Centrum för bildanalys. Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    Structure-Keeping Colour Segmentation of Tree Crowns in Aerial Images2001Konferensbidrag (Refereegranskat)
    Abstract [en]

    A new method for colour segmentation of tree crowns in aerial images is

  • 440.
    Erikson, Mats
    Uppsala universitet, Fakultetsövergripande enheter, Centrum för bildanalys. Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    Colour segmentation of individual tree crowns in aerial images2002Ingår i: Proceedings SSAB'02, 2002, s. 177-180Konferensbidrag (Övrigt vetenskapligt)
    Abstract [en]

    A method based on region growing for segmentation of tree crowns in aerial photographs is presented. By using a decision function, for including a pixel or not, both in the spatial domain and in the colour domain, the structure of the contour of the tree

  • 441.
    Erikson, Mats
    Uppsala universitet, Fakultetsövergripande enheter, Centrum för bildanalys. Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    Segmentation of individual tree crowns in colour aerial photographs using region growing supported by fuzzy rules2003Ingår i: Canadian Journal of Forest Research, Vol. 33, nr 8, s. 1557-1563Artikel i tidskrift (Refereegranskat)
  • 442.
    Erikson, Mats
    Uppsala universitet, Fakultetsövergripande enheter, Centrum för bildanalys. Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    Structure-preserving Segmentation of Individual Tree Crowns by Brownian Motion2003Ingår i: Proceedings of the 13th Scandinavian Conference on Image Analysis, 2003, s. 283-289Konferensbidrag (Refereegranskat)
  • 443.
    Erikson, Mats
    Uppsala universitet, Fakultetsövergripande enheter, Centrum för bildanalys. Uppsala universitet, Fakultetsövergripande enheter, Centrum för bildanalys. Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    Two preprocessing techniques based on grey level and geometric thickness to improve segmentation results2006Ingår i: Pattern Recognition Letters, ISSN 0167-8655, Vol. 27, nr 3, s. 160-166Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Two different techniques of performing preprocessing of an image to improve segmentation results are presented. The methods use the grey level thickness of the objects, in order to find the resulting image, by varying the size of a neighbourhood depending on the sum of the included grey levels. The first method, RW, uses the random walk of a particle, defined in the neighbourhood of the position of the particle. The resulting image holds the number of times the particle visits a pixel. Instead of randomization to find the number of visits, the second method, IP, scans the image iteratively and calculates the expected value of the same number. Three different kinds of real world applications are demonstrated to get better segmentation results with the preprocessing techniques included than without.

  • 444.
    Erikson, Mats
    et al.
    Uppsala universitet, Fakultetsövergripande enheter, Centrum för bildanalys. Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    Vestlund Karin,
    Finding tree-stems in laser range images of young mixed stands to perform selective cleaning2003Ingår i: Proceedings of the ScandLaser Scientific Workshop on Airborne Laser Scanning of Forest, 2003, s. 244-250Konferensbidrag (Övrigt vetenskapligt)
  • 445.
    Eriksson, Yvonne
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik. Informationsdesign.
    Porathe, Thomas
    Mälardalens högskola, Akademin för innovation, design och teknik. Informationsdesign.
    How children read pictures and text in some science school books: eye-tracking studies2008Ingår i: Proceedings of the Scandinavian Workshop of Applied Eye-Tracking (SWAET 2008, 2008Konferensbidrag (Refereegranskat)
    Abstract [en]

    In an eye-tracking pilot-project we have asked 6 children, age of 11, to read an opening,

    from a geography book for grade five. The aim of the study was to investigate

    the role of illustrations in text-books and to what extent they contribute to the learning

    process.

  • 446. Erkent, Ozgur
    et al.
    Karaoguz, Hakan
    KTH, Skolan för datavetenskap och kommunikation (CSC), Robotik, perception och lärande, RPL.
    Bozma, H. Isil
    Hierarchically self-organizing visual place memory2017Ingår i: Advanced Robotics, ISSN 0169-1864, E-ISSN 1568-5535, Vol. 31, nr 16, s. 865-879Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    A hierarchically organized visual place memory enables a robot to associate with its respective knowledge efficiently. In this paper, we consider how this organization can be done by the robot on its own throughout its operation and introduce an approach that is based on the agglomerative method SLINK. The hierarchy is obtained from a single link cluster analysis that is carried out based on similarity in the appearance space. As such, the robot can incrementally incorporate the knowledge of places into its visual place memory over the long term. The resulting place memory has an order-invariant hierarchy that enables both storage and construction efficiency. Experimental results obtained under the guided operation of the robot demonstrate that the robot is able to organize its place knowledge and relate to it efficiently. This is followed by experimental results under autonomous operation in which the robot evolves its visual place memory completely on its own.

  • 447.
    Erlandsson, F
    et al.
    Uppsala universitet, Fakultetsövergripande enheter, Centrum för bildanalys. Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    Linnman, C
    Ekholm, S
    Bengtsson, E
    Zetterberg, A
    A detailed analysis of cyclin a accumulation at the G(1)/S border in normal and transformed cells2000Ingår i: EXPERIMENTAL CELL RESEARCH, ISSN 0014-4827, Vol. 259, nr 1, s. 86-95Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The temporal relationship between cyclin A accumulation and the onset of DNA replication was analyzed in detail. Five untransformed and nine transformed asynchronously growing cell cultures were investigated using a triple immunofluorescence staining prot

  • 448. Erlandsson, Fredrik
    et al.
    Wählby, Carolina
    Uppsala universitet, Fakultetsövergripande enheter, Centrum för bildanalys. Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    Bengtsson, Ewert
    Uppsala universitet, Fakultetsövergripande enheter, Centrum för bildanalys. Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    Zetterberg, Anders
    Universitetsförvaltningen. Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    Detection of large numbers of antigens using sequential immunofluorescence staining2001Ingår i: 7th European Society for Analytical Cellular Pathology Congress (ESACP 2001), Caen, France, 2001, s. 56-57Konferensbidrag (Övrigt vetenskapligt)
  • 449.
    Erlandsson, Fredrik
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    Wählby, Carolina
    Fakultetsövergripande enheter, Centrum för bildanalys. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    Ekholm-Reed, Susanna
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    Hellström, Ann-Cathrin
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    Bengtsson, Ewert
    Fakultetsövergripande enheter, Centrum för bildanalys. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    Zetterberg, Anders
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    Abnormal expression pattern of cyclin E in tumour cells2003Ingår i: Int J Cancer, ISSN 0020-7136, Vol. 104, s. 369-375Artikel i tidskrift (Refereegranskat)
  • 450.
    Erlandsson, Fredrik
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    Wählby (nee Linnman), Carolina
    Fakultetsövergripande enheter, Centrum för bildanalys. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    Ekholm, Susanna
    Bengtsson, Ewert
    Fakultetsövergripande enheter, Centrum för bildanalys. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    Zetterberg, Anders
    A detailed analysis of cyclin A accumulation at the G1/S border in normal and transformed cells.2000Ingår i: Experimental Cell Research, ISSN 0014-4827/00, Vol. 256, s. 86-95Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Automatic cell segmentation has various applications in cytometry, and while the

    nucleus is often very distinct and easy to identify, the cytoplasm provides a lot

    more challenge. A new combination of image analysis algorithms for

    segmentation of cells imaged by fluorescence microscopy is presented. The

    algorithm consists of an image pre-processing step, a general segmentation

    and merging step followed by a segmentation quality measurement. The quality

    measurement consists of a statistical analysis of a number of shape descriptive

    features. Objects that have features that differ to that of correctly segmented

    single cells can be further processed by a splitting step. By statistical analysis

    we therefore get a feedback system for separation of clustered cells. After the

    segmentation is completed, the quality of the final segmentation is evaluated. By

    training the algorithm on a representative set of training images, the algorithm

    is made fully automatic for subsequent images created under similar conditions.

    Automatic cytoplasm segmentation was tested on CHO-cells stained with

    calcein. The fully automatic method showed between 89% and 97% correct

    segmentation as compared to manual segmentation.

6789101112 401 - 450 av 1859
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf