Dissertations / Theses on the topic 'Interets points'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Interets points.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Loiseau-Witon, Nicolas. "Détection et description de points clés par apprentissage." Electronic Thesis or Diss., Lyon, INSA, 2023. http://www.theses.fr/2023ISAL0101.
Full textHospitals are increasingly generating 3D medical images that require automatic registration for systematic and large-scale analysis. Key points are used to reduce the time and memory required for this registration, and can be detected and described using various classical methods, as well as neural networks, as demonstrated numerous times in 2D. This thesis presents results and discussions on methods for detecting and describing key points using 3D neural networks. Two types of networks were studied to detect and/or describe characteristic points in 3D medical images. The first networks studied describe the areas directly surrounding key points, while the second type performs both detection and description of key points in a single step
Olofsson, Erik, and Simon Edström. "Points-Of-Interest CollectionGame." Thesis, Umeå universitet, Institutionen för datavetenskap, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-38374.
Full textBayram, Ilker. "Interest Point Matching Across Arbitrary Views." Master's thesis, METU, 2004. http://etd.lib.metu.edu.tr/upload/12605114/index.pdf.
Full textsee&rsquo
is certainly one of the greatest challanges for today. Apart from possible applications, the solution may also shed light or at least give some idea on how, actually, the biological vision works. Many problems faced en route to successful algorithms require finding corresponding tokens in different views, which is termed the correspondence problem. For instance, given two images of the same scene from different views, if the camera positions and their internal parameters are known, it is possible to obtain the 3-Dimensional coordinates of a point in space, relative to the cameras, if the same point may be located in both images. Interestingly, the camera positions and internal parameters may be extracted solely from the images if a sufficient number of corresponding tokens can be found. In this sense, two subproblems, as the choice of the tokens and how to match these tokens, are examined. Due to the arbitrariness of the image pairs, invariant schemes for extracting and matching interest points, which were taken as the tokens to be matched, are utilised. In order to appreciate the ideas of the mentioned schemes, topics as scale-space, rotational and affine invariants are introduced. The geometry of the problem is briefly reviewed and the epipolar constraint is imposed using statistical outlier rejection methods. Despite the satisfactory matching performance of simple correlation-based matching schemes on small-baseline pairs, the simulation results show the improvements when the mentioned invariants are used on the cases for which they are strictly necessary.
Chavez, Aaron J. "A fast interest point detection algorithm." Thesis, Manhattan, Kan. : Kansas State University, 2008. http://hdl.handle.net/2097/538.
Full textChucre, Mirla Rafaela Rafael Braga. "K-nearest neighbors queries in time-dependent road networks: analyzing scenarios where points of interest move to the query point." reponame:Repositório Institucional da UFC, 2015. http://www.repositorio.ufc.br/handle/riufc/23696.
Full textSubmitted by Jonatas Martins (jonatasmartins@lia.ufc.br) on 2017-06-29T12:26:58Z No. of bitstreams: 1 2015_dis_mrrbchucre.pdf: 15845328 bytes, checksum: a2e4d0a03ca943372c92852d4bcf7236 (MD5)
Approved for entry into archive by Rocilda Sales (rocilda@ufc.br) on 2017-06-29T13:54:36Z (GMT) No. of bitstreams: 1 2015_dis_mrrbchucre.pdf: 15845328 bytes, checksum: a2e4d0a03ca943372c92852d4bcf7236 (MD5)
Made available in DSpace on 2017-06-29T13:54:36Z (GMT). No. of bitstreams: 1 2015_dis_mrrbchucre.pdf: 15845328 bytes, checksum: a2e4d0a03ca943372c92852d4bcf7236 (MD5) Previous issue date: 2015
A kNN query retrieve the k points of interest that are closest to the query point, where proximity is computed from the query point to the points of interest. Time-dependent road networks are represented as weighted graphs, where the weight of an edge depends on the time one passes through that edge. This way, we can model periodic congestions during rush hour and similar effects. Travel time on road networks heavily depends on the traffic and, typically, the time a moving object takes to traverse a segment depends on departure time. In time-dependent networks, a kNN query, called TD-kNN, returns the k points of interest with minimum travel-time from the query point. As a more concrete example, consider the following scenario. Imagine a tourist in Paris who is interested to visit the touristic attraction closest from him/her. Let us consider two points of interest in the city, the Eiffel Tower and the Cathedral of Notre Dame. He/she asks a query asking for the touristic attraction whose the path leading up to it is the fastest at that time, the answer depends on the departure time. For example, at 10h it takes 10 minutes to go to the Cathedral. It is the nearest attraction. Although, if he/she asks the same query at 22h, in the same spatial point, the nearest attraction is the Eiffel Tower. In this work, we identify a variation of nearest neighbors queries in time-dependent road networks that has wide applications and requires novel algorithms for processing. Differently from TD-kNN queries, we aim at minimizing the travel time from points of interest to the query point. With this approach, a cab company can find the nearest taxi in time to a passenger requesting transportation. More specifically, we address the following query: find the k points of interest (e.g. taxi drivers) which can move to the query point (e.g. a taxi user) in the minimum amount of time. Previous works have proposed solutions to answer kNN queries considering the time dependency of the network but not computing the proximity from the points of interest to the query point. We propose and discuss a solution to this type of query which are based on the previously proposed incremental network expansion and use the A∗ search algorithm equipped with suitable heuristic functions. We also discuss the design and correctness of our algorithm and present experimental results that show the efficiency and effectiveness of our solution.
Uma consulta de vizinhos mais próximos (ou kNN, do inglês k nearest neighbours) recupera o conjunto de k pontos de interesse que são mais próximos a um ponto de consulta, onde a proximidade é computada do ponto de consulta para cada ponto de interesse. Nas redes de rodovias tradicionais (estáticas) o custo de deslocamento de um ponto a outro é dado pela distância física entre esses dois pontos. Por outro lado, nas redes dependentes do tempo o custo de deslocamento (ou seja, o tempo de viagem) entre dois pontos varia de acordo com o instante de partida. Nessas redes, as consultas kNN são denominadas TD-kNN (do inglês Time-Dependent kNN). As redes de rodovias dependentes do tempo representam de forma mais adequada algumas situações reais, como, por exemplo, o deslocamento em grandes centros urbanos, onde o tempo para se deslocar de um ponto a outro durante os horários de pico, quando o tráfego é intenso e as ruas estão congestionadas, é muito maior do que em horários normais. Neste contexto, uma consulta típica consiste em descobrir os k restaurantes (pontos de interesse) mais próximos de um determinado cliente (ponto de consulta) caso este inicie o seu deslocamento ao meio dia. Nesta dissertação nós estudamos o problema de processar uma variação de consulta de vizinhos mais próximos em redes viárias dependentes do tempo. Diferentemente das consultas TD-kNN, onde a proximidade é calculada do ponto de consulta para um determinado ponto de interesse, estamos interessados em situações onde a proximidade deve ser calculada de um ponto de interesse para o ponto de consulta. Neste caso, uma consulta típica consiste em descobrir os k taxistas (pontos de interesse) mais próximos (ou seja, com o menor tempo de viagem) de um determinado cliente (ponto de consulta) caso eles iniciem o seu deslocamento até o referido cliente ao meio dia. Desta forma, nos cenários investigados nesta dissertação, são os pontos de interesse que se deslocam até o ponto de consulta, e não o contrário. O método proposto para executar este tipo de consulta aplica uma busca A∗ à medida que vai, de maneira incremental, explorando a rede. O objetivo do método é reduzir o percentual da rede avaliado na busca. A construção e a corretude do método são discutidas e são apresentados resultados experimentais com dados reais e sintéticos que mostram a eficiência da solução proposta.
Van, Niekerk A., and M. Conradie. "Literary genres as points of interest in print advertising." Journal for New Generation Sciences, Vol 12, Issue 2: Central University of Technology, Free State, Bloemfontein, 2014. http://hdl.handle.net/11462/665.
Full textThe article focuses on the interplay between print advertisements and literary genres such as poetry, drama, folklore, etc. This interplay may be used to develop an advertisement's point of interest to attract attention from a specific target audience. Based on previous research we hypothesise that literary genres are exploited as a means to engage audiences. The study aims to give a description of the typical genre characteristics of modern literary genres in SA print advertising. It also endeavours to do a pragmatic analysis of these advertisements against the background of the specific literary genre category and the genre qualities of advertisements to identify the implied marketing message.
Bachert, Sara-Lois. "Points of Interest: Essays on People, Places and Perceptions." TopSCHOLAR®, 1989. http://digitalcommons.wku.edu/theses/1873.
Full textPiekenbrock, Matthew J. "Discovering Intrinsic Points of Interest from Spatial Trajectory Data Sources." Wright State University / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=wright1527160689990512.
Full textAlghamdi, Hamzah. "E-Tourism: Context-Aware Points of Interest Finder and Trip Designer." Thesis, Université d'Ottawa / University of Ottawa, 2017. http://hdl.handle.net/10393/35676.
Full textHodzic, Lana. "TRPINav: A System for Terrain, Route, Points of Interest, and Navigation." DigitalCommons@CalPoly, 2016. https://digitalcommons.calpoly.edu/theses/1589.
Full textBai, Xueyao. "Distributed Visual Processing Based On interest Point Clustering." Thesis, KTH, Kommunikationsnät, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-168013.
Full textBraga, Reinaldo. "LIDU : Location-based approach to IDentify similar interests between Users in social networks." Thesis, Grenoble, 2012. http://www.theses.fr/2012GRENM055/document.
Full textSharing of user data has substantially increased over the past few years facilitated by sophisticated Web and mobile applications, including social networks. For instance, users can easily register their trajectories over time based on their daily trips captured with GPS receivers as well as share and relate them with trajectories of other users. Analyzing user trajectories over time can reveal habits and preferences. This information can be used to recommend content to single users or to group users together based on similar trajectories and/or preferences. Recording GPS tracks generates very large amounts of data. Therefore clustering algorithms are required to efficiently analyze such data. In this thesis, we focus on investigating ways of efficiently analyzing user trajectories, extracting user preferences from them and identifying similar interests between users. We demonstrate an algorithm for clustering user GPS trajectories. In addition, we propose an algorithm to correlate trajectories based on near points between two or more users. The final results provided interesting avenues for exploring Location-based Social Network (LBSN) applications
McKeehan, Zachary D. "Vision-based interest point extraction evaluation in multiple environments." Thesis, Monterey, Calif. : Naval Postgraduate School, 2008. http://edocs.nps.edu/npspubs/scholarly/theses/2008/Sept/08Sep%5FMcKeehan.pdf.
Full textThesis Advisor(s): Kolsch, Mathias ; Squire, Kevin. "September 2008." Description based on title screen as viewed on November 3, 2008. Includes bibliographical references (p. 175-181). Also available in print.
Faille, Flore. "Illumination invariant interest point detection for vision based recognition tasks." [S.l.] : [s.n.], 2007. http://mediatum2.ub.tum.de/doc/613251/document.pdf.
Full textJakobsson, Viktor. "The Förstner Interest Point Operator Subwindow Localization on SIFT Keypoints." Thesis, Umeå universitet, Institutionen för fysik, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-105492.
Full textLindeberg, Tony. "Scale Selection Properties of Generalized Scale-Space Interest Point Detectors." KTH, Beräkningsbiologi, CB, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-101220.
Full textQC 20121003
Image descriptors and scale-space theory for spatial and spatio-temporal recognition
Akbarzadeh, Kasra. "Navigational aid to points of interests outside the field of view in virtual environments." Thesis, Luleå tekniska universitet, Institutionen för system- och rymdteknik, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-73221.
Full textJaber, Maher, and Andrei Cojanu. "The 40 Seconds Rule and Points of Interest in The Witcher 3: Wild Hunt." Thesis, Uppsala universitet, Institutionen för speldesign, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-446386.
Full textThe Witcher 3: Wild Hunt är ett av de bäst säljande öppna världsspel de senaste åren. Tack vare spelets popularitet kanske andra speldesigners vill kopiera dess värld designmetoder. I en intervju från 2017 har spelets utvecklare förklarat att de har använt ett system som kallas ”regeln om 40 sekunder” för att säkerställa att spelaren snubblar på något intressant var fjärde sekund av utforskningen. I denna forskning genomförde författarna ett test för att kontrollera hur korrekt regeln implementerades; de gjorde det genom att analysera bilder från fyra olika innehållsskapare på YouTube på två av spelets kartor. Forskningen visade att det finns en regel, men den påverkas av spelstilar och är endast korrekt för vissa spelare. Det drar slutsatsen att designers som vill implementera regeln kan göra det på ett tillförlitligt sätt, men de bör ta hänsyn till spelstilar och spelarens rörelsehastighet när de testar deras regel.
Madsen, Michael H. Mosher Anne E. "Mormon meccas: the spiritual transformation of Mormon historical sites from points of interest to sacred space." Related Electronic Resource: Current Research at SU : database of SU dissertations, recent titles available full text, 2003. http://wwwlib.umi.com/cr/syr/main.
Full textTran, Khoa Anh. "Automatic Identification of Points of Interest in Global Navigation Satellite System Data: A Spatial Temporal Approach." Scholar Commons, 2013. http://scholarcommons.usf.edu/etd/4595.
Full textPalomares, Jean-Louis. "Une nouvelle méthode d’appariement de points d’intérêt pour la mise en correspondance d’images." Thesis, Montpellier 2, 2012. http://www.theses.fr/2012MON20075/document.
Full textThis thesis adresses the issue of image matching for stereoscopic vison applications and image stabilization of video cameras. Methods of mapping are generally based on the use of interest points in the images, i.e. of points which have strong discontinuities in light intensity. We first present a new descriptor of points of interest, obtained by means of an anisotropic rotary filter which delivers at each point of interest a one-dimensional signature based on an intensity gradient. Invariant to rotation by construction, thisdescriptor has very good properties of robustness and discrimination. We then propose a new matching method invariant to Euclidean and affine transformations. This method exploits the correlation of the signatures subject to moderate warping, and defines a distance measure, necesssary for the matching of points. the results obtained on difficult images augur promising extentions to this method
LOZET, POUYMAYOU CATHERINE. "Histiocytose a cellules de langerhans : mise au point et interet diagnostique de l'immunophenotypage." Aix-Marseille 2, 1992. http://www.theses.fr/1992AIX20904.
Full textHotze, Wolfgang. "Robotic First Aid : Using a mobile robot to localise and visualise points of interest for first aid." Thesis, Högskolan i Halmstad, Akademin för informationsteknologi, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-32324.
Full textBrilhante, Igo Ramalho. "Mobility Data under Analysis a Complex Network Perspective from Interactions Among Trajectories to Movements among Points Interest." reponame:Repositório Institucional da UFC, 2012. http://www.repositorio.ufc.br/handle/riufc/18792.
Full textSubmitted by Elineudson Ribeiro (elineudsonr@gmail.com) on 2016-07-28T19:53:04Z No. of bitstreams: 1 2012_dis_irbrilhante.pdf: 13581729 bytes, checksum: 9b1d7b6164309bf59f7d6ba1370cd90e (MD5)
Approved for entry into archive by José Jairo Viana de Sousa (jairo@ufc.br) on 2016-08-02T14:18:14Z (GMT) No. of bitstreams: 1 2012_dis_irbrilhante.pdf: 13581729 bytes, checksum: 9b1d7b6164309bf59f7d6ba1370cd90e (MD5)
Made available in DSpace on 2016-08-02T14:18:14Z (GMT). No. of bitstreams: 1 2012_dis_irbrilhante.pdf: 13581729 bytes, checksum: 9b1d7b6164309bf59f7d6ba1370cd90e (MD5) Previous issue date: 2012
The explosion of personal positioning devices like GPS-enabled smartphones has enabled the collection and storage of a huge amount of positioning data in the form of trajectories. Thereby, trajectory data have brought many research challenges in the process of recovery, storage and knowledge discovery in mobility as well as new applications to support our society in mobility terms. Other research area that has been receiving great attention nowadays is the area of complex network or science of networks. Complex network is the first approach to model complex system that are present in the real world, such as economic markets, the Internet, World Wide Web and disease spreading to name a few. It has been applied in different field, like Computer Science, Biology and Physics. Therefore, complex networks have demonstrated a great potential to investigate the behavior of complex systems through their entities and the relationships that exist among them. The present dissertation, therefore, aims at exploiting approaches to analyze mobility data using a perspective of complex networks. The first exploited approach stands for the trajectories as the main entities of the networks connecting each other through a similarity function. The second, in turn, focuses on points of interest that are visited by people, which perform some activities in these points. In addition, this dissertation also exploits the proposed methodologies in order to develop a software tool to support users in mobility analysis using complex network techniques.
The explosion of personal positioning devices like GPS-enabled smartphones has enabled the collection and storage of a huge amount of positioning data in the form of trajectories. Thereby, trajectory data have brought many research challenges in the process of recovery, storage and knowledge discovery in mobility as well as new applications to support our society in mobility terms. Other research area that has been receiving great attention nowadays is the area of complex network or science of networks. Complex network is the first approach to model complex system that are present in the real world, such as economic markets, the Internet, World Wide Web and disease spreading to name a few. It has been applied in different field, like Computer Science, Biology and Physics. Therefore, complex networks have demonstrated a great potential to investigate the behavior of complex systems through their entities and the relationships that exist among them. The present dissertation, therefore, aims at exploiting approaches to analyze mobility data using a perspective of complex networks. The first exploited approach stands for the trajectories as the main entities of the networks connecting each other through a similarity function. The second, in turn, focuses on points of interest that are visited by people, which perform some activities in these points. In addition, this dissertation also exploits the proposed methodologies in order to develop a software tool to support users in mobility analysis using complex network techniques.
Berjawi, Bilal. "Integration of heterogeneous data from multiple location-based services providers : A use case on tourist points of interest." Thesis, Lyon, 2017. http://www.theses.fr/2017LYSEI072/document.
Full textLocation Based Services (LBS) had been involved to deliver relevant geospatial information based on a geographic position or address. The amount of geospatial data is constantly increasing, making it a valuable source of information for enriching LBS applications. However, these geospatial data are highly inconsistent and contradictory from one source to another. We assume that integrating geospatial data from several sources may improve the quality of information offered to users. In this thesis, we specifically focus on data representing Points of Interest (POIs) that tourists can get through LBS. Retrieving, matching and merging such geospatial entities lead to several challenges. We mainly focus on three main challenges including (i) detecting and merging corresponding entities across multiple sources and (ii) considering the uncertainty of integrated entities and their representation in LBS applications
Jansson, David, and Viktoria Sjöbohm. "En maskininlärningsanalys av ursprunget till bostadsområdens attraktionskraft : En kvantitativ studie kring Points of Interest inverkan på bostadsområdens attraktionskraft." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-281309.
Full textThe demand on co-operative apartments in Stockholm have during the latest years been high and the prices are continuously fluctuating. Today, many agree on that the ‘location’ is one of the most important aspects in valuation of co-operative apartments but what ‘location’ actually means is not as obvious. This thesis has the purpose of exploring potential connections between a location’s attractiveness and the amount of Points of Interest in a co-operative apartment’s close proximity. The study seeks to explain which features that affects a community’s attractiveness the most. Points of Interest includes, among others, postal code, number of restaurants and number of hotels within a radius of one kilometer from each individual cooperative apartment. The study’s performance is based on the presumption that sales prices can represent willingness to pay and thereby represent attractiveness. The performance is based on machine learning, where the model Random Forest Regression is implemented to perform a quantitative data analysis on sold co-operative apartments in Stockholm. The model can estimate sales prices with an accuracy of 85.1% and the result presents the Points of Interests’ effect on the estimated sales prices, in relation to each other. The feature which was shown to have the highest effect on the estimated sales price was the postal code. It is discussed that this outcome is due to the postal code indirectly represent non-quantitative features such as the general perception of the area. The second and third most important features is showed to be public transport and nightlife. From the study it was concluded that the most important feature for the attractiveness of a location is the general perception of that area rather than the accessibility to Points of Interest.
Emir, Erdem. "A Comparative Performance Evaluation Of Scale Invariant Interest Point Detectors For Infrared And Visual Images." Master's thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/2/12610159/index.pdf.
Full textBingham, Mark. "An interest point based illumination condition matching approach to photometric registration within augmented reality worlds." Thesis, University of Huddersfield, 2011. http://eprints.hud.ac.uk/id/eprint/11048/.
Full textAhmad, Mohammad Zubair. "Measuring the evolving Internet ecosystem with exchange points." Doctoral diss., University of Central Florida, 2013. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/5753.
Full textPh.D.
Doctorate
Electrical Engineering and Computing
Engineering and Computer Science
Computer Engineering
Griesner, Jean-Benoit. "Systèmes de recommandation de POI à large échelle." Electronic Thesis or Diss., Paris, ENST, 2018. http://www.theses.fr/2018ENST0037.
Full textThe task of points-of-interest (POI) recommendations has become an essential feature in location-based social networks. However it remains a challenging problem because of specific constraints of these networks. In this thesis I investigate new approaches to solve the personalized POI recommendation problem. Three main contributions are proposed in this work. The first contribution is a new matrix factorization model that integrates geographical and temporal influences. This model is based on a specific processing of geographical data. The second contribution is an innovative solution against the implicit feedback problem. This problem corresponds to the difficulty to distinguish among unvisited POI the actual "unknown" from the "negative" ones. Finally the third contribution of this thesis is a new method to generate recommendations with large-scale datasets. In this approach I propose to combine a new geographical clustering algorithm with users’ implicit social influences in order to define local and global mobility scales
LACERDA, Yuri Almeida. "Explorando a localização e orientação de fotografias pessoais para descoberta de pontos de interesse baseada em agrupamento." Universidade Federal de Campina Grande, 2017. http://dspace.sti.ufcg.edu.br:8080/jspui/handle/riufcg/703.
Full textMade available in DSpace on 2018-05-16T14:43:46Z (GMT). No. of bitstreams: 1 YURI ALMEIDA LACERDA - TESE (PPGCC) 2017.pdf: 28353805 bytes, checksum: 0d8453f39b64823b7308c81cc7731524 (MD5) Previous issue date: 2017
Capes
A descoberta de conhecimento a partir de grandes repositórios online de fotografias tem sido uma área de pesquisa bastante ativa nos últimos anos. Isso se deve principalmente a três fatores: incorporação de câmeras digitais e sensores de geolocalização aos dispositivos móveis; avanços na conectividade com a Internet; e evolução das redes sociais. As fotografias armazenadas nesses repositórios possuem metadados contextuais que podem ser utilizados em aplicações de descoberta de conhecimento, tais como: detecção de pontos de interesse (POIs); geração de roteiros de viagens; e organização automática de fotografias. A maioria das abordagens para detecção de POIs parte do princípio que as áreas geográficas onde uma grande quantidade de pessoas capturou fotografias indica a existência de um ponto de interesse. Porém, em muitos casos, os POIs estão localizados a uma certa distância desse local na orientação em que a câmera estava direcionada, e não no ponto exato da captura da fotografia. A maioria das técnicas propostas na literatura não consideram o uso da orientação no processo de detecção de pontos de interesses. Dessa forma, este trabalho propõe novos algoritmos e técnicas para detecção de pontos de interesse em cidades turísticas a partir de coleções de fotografias orientadas e georreferenciadas explorando de diversas formas a orientação geográfica. Esta pesquisa comprovou a importância do uso da orientação nos novos algoritmos voltados para detecção de pontos de interesses. Os experimentos, utilizando uma base de dados real de grandes cidades, demonstraram que os algoritmos considerando a orientação conseguem, em alguns cenários, superar os que não a consideram. Também foram propostas novas métricas de avaliação e uma ferramenta para auxiliar as atividades de descoberta de conhecimento baseada em grandes massas de fotografias.
The knowledge discovery from huge photo repositories has been a very active area of research in the last years. This is due to three facts: the incorporation of digital cameras and geolocation sensors in mobile devices; the advances in Internet connectivity; and the evolution of social networks. The photos stored on those repositories have contextual metadata. Those metadata could be used for many applications of knowledge discovering, such as: Point of Interest (POI) detection; generating of tourist guides; and automatic photo organization. Most approaches for POI detection assume that geographic areas with high density of photos indicate the existence of a point of interest in that area. However, in many cases, the POIs are located in a certain distance of that position in direction where camera was aiming, and not in the exact point of photo shooting. Most of related work do not consider the use of orientation in the process of POI detection. In this way, we propose a set of algorithms and techniques for POI discovery in touristic cities using geotagged and oriented photos collection exploring the geographic orientation in different ways. This research has proven the importance of the usage of orientation in the new algorithms for POI detection. In the experiments with collections related to big cities, the algorithms considering orientation, in several scenarios, have beaten those that do not consider. Also, new metrics of evaluation have been proposed and a new framework to assist all the tasks for knowledge discovery based on huge photo collections.
Murphy, Timothy Charles. "Examining the Effects of Key Point Detector and Descriptors on 3D Visual SLAM." Ohio University Honors Tutorial College / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=ouhonors1461320700.
Full textJohansson, Johan. "Interest Point Detectors and Descriptors for IR Images : An Evaluation of Common Detectors and Descriptors on IR images." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-175801.
Full textDetektorer och deskriptorer är grundpelare till många applikationer inom datorseende. Vid valet av metod till en specifik tillämpning är det av stort intresse att veta hur de presterar mot möjliga förändringar i hur innehållet i en bild framträder. Grundlig forskning är utförd på visuella bilder medan det fortfarande saknas en lika grundläggande kartläggning av deras prestation på infraröda bilder. Det här examensarbetet utvärderar, på uppdrag av FLIR Systems, hur detektorer och deskriptorer presterar i infraröda bilder. Arbetet är uppdelat i tre utvärderingar varav den första utvärderar detektorer, den andra deskriptorer och den tredje kombinationen av detektor och deskriptor. Vi finner att bäst resultat uppnås av Hessian-Affine tillsammans med LIOP men att den binära kombinationen av ORB detektor och BRISK deskriptor är ett bra alternativ som har jämförbart resultat men en ökad effektivitet av två storlekordningar.
Rakotomalala, Harisoa Ny aina. "Appropriation de l'ordinateur et d'internet dans les points d'accès public : les cas comparés de Brest, de Saint-Denis de La Réunion et d'Antananarivo." Thesis, La Réunion, 2012. http://www.theses.fr/2012LARE0015.
Full textInternet access points are a place where users can access and use digital equipment and connect to internet. Various terms are used to indicate these places : « espaces publics numériques (EPN) », « Netpublics », «cyberbases », « cybercases », « espaces culturels multimédias (ECM) », « Points-cyb », « cybercommunes », « points d’accès public internet (PAPI) » and « cybercafés ». In France, internet access points help people without computer and internet access to use these technologies, to learn and to be assisted in their uses. In Madagascar, internet access points provide access to computer and internet networks but services are fee-based. The objective of this dissertation is to examine the roles of internet access points in ICTs appropriation process by public who visit these places. This research work analyses the theoretical concept of appropriation by using three approaches: the diffusion, the translation and the appropriation. This is followed by a comparative analysis of the uses of computer and internet in internet access points situated in Brest, Reunion Island and Antananarivo. The analysis shows the important role played by societal, economic and geographic contexts on ICTs appropriation. Beyond the uses of ICT in these places, this research attempts to identify users and discuss the reasons of their visits. The results are based on observations, questionnaire surveys and interviews with users in 18 internet access points in Brest, Reunion Island and Antananarivo
TOCCO, MARCEL. "Interet de la comparaison evolutive du poids et du bilan entrees-sorties chez les patients hospitalises en reanimation." Lyon 1, 1992. http://www.theses.fr/1992LYO1M351.
Full textLimpens, Freddy. "Multi-points of view semantic enrichment of folksonomies." Phd thesis, Université de Nice Sophia-Antipolis, 2010. http://tel.archives-ouvertes.fr/tel-00530714.
Full textRoos, Jan Corver S. M. Massachusetts Institute of Technology. "System development considerations and point of interest guidance of an unmanned aerial system for remote sensing in commercial application." Thesis, Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/106261.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (pages 78-79).
The objective of this thesis is to develop a contextual and system level understanding of an ISR (Intelligence, Surveillance and Reconnaissance) Unmanned Aerial System (UAS) for commercial application. The thesis is intended to support strategic decision making for creating and capturing value in the emerging Unmanned Aerial Vehicle (UAV) industry and to support system design decisions. As an example of a system design decision, a flight control capability to enable directing the flight of a UAV through the steering of the optical payload only is also proposed and developed. This flight control capability is intended to more closely align the operation of an ISR unmanned aerial system with the identified primary user need. Thus, the development presented here could be useful to the prospective entrepreneur or an established organization who would like to build a presence in the emerging commercial application of unmanned aircraft. Towards these objectives, four aspects are considered: 1. To develop an understanding of the current state of the emerging commercial unmanned aircraft industry. 2. Understanding the current and potential future regulatory requirements associated with the commercial operation of unmanned aircraft. 3. To develop a system design understanding of an ISR unmanned aerial system which includes identifying the primary need, developing a stakeholder value network, identifying the principle elements of form and understanding the principle internal functions. 4. Propose and develop a flight control capability which enables directing the flight of a UAV through the steering of the optical payload only. This flight control capability serves as a system design example to more closely align the operation of an ISR unmanned aerial system with the identified primary user need.
by Jan Corver Roos.
S.M. in Engineering and Management
Parisot, Pascaline. "Suivi d’objets dans des séquences d’images de scènes déformables : de l’importance des points d’intérêt et du maillage 2D." Thesis, Toulouse, INPT, 2009. http://www.theses.fr/2009INPT012H/document.
Full textWe deal with object tracking in videos of non-rigid scenes with two main purposes. We aim at determining the transformations of an object, from one frame to the next, when it may be distorted or moved and when the camera focus may change (movement, zoom...). To do this, we were inspired by the Jurie and Dhome algorithm, which enables the tracking of plane rigid objects. On the one hand, we improve its performance. On the other hand, we generalize it to non-rigid objects. The first goal consists in improving the performance of the Jurie and Dhome algorithm, in terms of accuracy and robustness. The tracking is based on a set of interest points, which has a great effect on the algorithm’s performance. These interest points come from a selection among the points extracted with some common detectors: SIFT, KLT, SUSAN, HARRIS, and MORAVEC.With various pictures classes, we have studied and implemented some selection heuristics based on statistical or algebraic approaches. We show that : • there is no universal detector, • the statistical approach is the best in all cases. The second goal is a proposal of a new tracking algorithm based on a 2D mesh of the video frames. This algorithm generalizes the Jurie and Dhome one for non-rigid scenes. It is based on : • elementary (nodal), direct or inverse, mesh transformations that we geometrically and analytically characterize, • generalized barycentric coordinates to approximate the composition of two mesh transformations. This algorithm gives similar results to the hexagonal matching algorithm of Nakaya and Harashima while being faster
Dias, Alessandro da Silveira. "Aumentando a acurácia de predição de avaliação de sistemas de recomendação de vídeo com o uso de pontos de interesse." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2013. http://hdl.handle.net/10183/71271.
Full textEvery day the number of videos available in the world increases. For example, there is a vast amount of video sites available on the Web, Video On Demand services, as well as devices that records videos automatically, known as Personal Video Recorders, 24 hours a day. It may create a problem for the user: the overload of content in video format. One of the ways to treat such problem is the use of recommender systems, which filter the content in order to deliver what is most interesting to the user. The typical approach is to present a hybrid recommender system, i.e., that uses both contentbased filtering and collaborative filtering, minimizing the problems that these approaches have individually. Additionally, in order to improve the recommendation or to create new approaches of recommendation, has been given new approaches such as systems using data from social networks, affective computing, tags, etc. This paper aims to present an innovative approach, which uses points of interest (POI) in video of users (i.e., video segments best liked or most interested by them) to augment the prediction accuracy of video recommender systems with collaborative filtering based in the useruser approach. In the proposed approach, users participate more actively and more interactively to mark their points of interest. To evaluate this proposed approach an experimental evaluation was performed in terms of accuracy of ratings predictions; in which it was verified that there was an improvement in ratings prediction accuracy of the recommendation system. This improvement is directly related to the level of participation of people in marking points of interest.
COCHARD, PHILIPPE. "Deux incidences sous-acromiales en radiographie simple : mise au point et interet pour la chirurgie du syndrome du conflit." Lyon 1, 1991. http://www.theses.fr/1991LYO1M296.
Full textSeltz, Francis. "Quelques reactions somato-psychiques a point de depart tactile : mise en evidence, tentative de modelisation, interet pour le medecin." Université Louis Pasteur (Strasbourg) (1971-2008), 1990. http://www.theses.fr/1990STR1M134.
Full textJOUBAUD, PATRICK. "Interet et limite de l'immunoenzymologie dans le diagnostic des candidoses profondes : mise au point et evaluation sur 444 serums." Strasbourg 1, 1991. http://www.theses.fr/1991STR15071.
Full textYouness, Chebli. "L'e-réputation du point de vue client : modèle intégrateur et échelle de mesure." Thesis, Université Grenoble Alpes (ComUE), 2016. http://www.theses.fr/2016GREAG016.
Full textAlthough online reputation has attracted significant attention among marketing practitioners, research in this area is still limited. In this research dissertation, the authors examine the antecedents and consequences of online reputation from the customer’s perspective. A structural equation modeling approach is used to test the model based on data from a survey of 1097 French online buyers. The results show the impact of trust, heritage, and website quality on online reputation, as well as how online reputation affects customer commitment, word of mouth, perceived risk, and perceived value. Several implications either in terms of conceptual or managerial insights are then discussed
Lu, Wanting. "Financial reforms, divided interests, and tipping point policy-making : renminbi internationalization as a new catalyst for structural reforms in China." Thesis, University of British Columbia, 2016. http://hdl.handle.net/2429/57944.
Full textArts, Faculty of
Political Science, Department of
Graduate
Livardjani, Fariborz. "Mise au point d'un appareil portable de dosage du mercure : interet, methodologies et applications en toxicologie animale, humaine et environnementale." Strasbourg 1, 1996. http://www.theses.fr/1996STR15112.
Full textGrigaravičienė, Regina. "Elektroninės valdžios įtaka visuomenei." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2006. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2005~D_20060317_140521-34733.
Full textWalter, Nicolas. "Détection de primitives par une approche discrète et non linéaire : application à la détection et la caractérisation de points d'intérêt dans les maillages 3D." Phd thesis, Université de Bourgogne, 2010. http://tel.archives-ouvertes.fr/tel-00808216.
Full textLedan, Antoine Le Néel Tanguy. "Celesio® et " OCP point " présentation, description et étude en 2005 /." [S.l.] : [s.n.], 2005. http://theses.univ-nantes.fr/thesemed/PHledan.pdf.
Full textAgier, Rémi. "Recalage de groupes d’images médicales 3D par extraction de points d’intérêt." Thesis, Lyon, 2017. http://www.theses.fr/2017LYSEI093/document.
Full textThe ever-increasing amount of medical images stored in hospitals offers a great opportunity for big data analysis. In order to pave the way for huge image groups screening, we need to develop methods able to make images databases consistent by group registering those images. Currently, group registration methods generally use dense, voxel-based, representations for images and often pick a reference to register images. We propose a group registration framework, without reference image, by using only interest points (Surf3D), able to register hundreds of medical images. We formulate a global problem based on interest point matching. The inter-patient variability is high, and the outliers ratio can be large (70\%). We pay a particular attention on inhibiting outliers contribution. Our first contribution is a two-step rigid groupwise registration. In the first step, we compute the pairwise rigid registration of each image pair. In a second step, a complete graph of those registrations allows us to formulate a global problem using the laplacian operator. We show experimental results for groups of up to 400 CT-scanner 3D heterogeneous images highlighting the robustness and speed of our approach. In our second contribution, we compute a non-rigid groupwise registration. Our approach involves half-transforms, parametrized by a b-spline pyramid, between each image and a common space. A reference dataset shows that our algorithm provides competitive results while being much faster than previous methods. Those results show the potential of our interest point based registration method for huge datasets of 3D medical images. We also provide to promising perspectives: multi-atlas based segmentation and anthropology
Bégin, Mathieu. "La cyberintimidation une étude exploratoire sur le point de vue des adolescents." Mémoire, Université de Sherbrooke, 2011. http://hdl.handle.net/11143/5662.
Full text